Spelling suggestions: "subject:"[een] DATA"" "subject:"[enn] DATA""
31 |
Software Design of Estimation Method of Program Data LocalityFan, Yi-Da 11 September 2008 (has links)
Data accesses consume considerable execution time during program execution. If we can improve the data access time at compile time, overall program execution time can be improved effectively. Hence, we designed a software for a data locality estimation method for estimating data locality in program optimizer. The program optimizer can then reduce the number of main memory block access and enhance the overall program performance effectively. In this research, we implemented the software design of the data locality estimation method. It includes two estimation models for estimating the number of access matches in memory blocks and for estimating the number of memory block access. We carried out experiments to verify accuracy of the locality estimation method.
|
32 |
Temporal pattern mining in dynamic environments /Lattner, Andreas D. January 2007 (has links)
Univ., Diss.--Frankfurt am Main, 2007.
|
33 |
Knowledge-intensive subgroup mining : techniques for automatic and interactive discovery /Atzmüller, Martin. January 2007 (has links)
Univ., Diss--Würzburg, 2006.
|
34 |
Data warehousing mobile code designCheung, Chun-lung. January 2000 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 70-73).
|
35 |
Visual data mining Using parallel coordinate plots with K-means clustering and color to find correlations in a multidimensional dataset /Peterson, Angela R. January 2009 (has links)
Thesis (M.S.)--Kutztown University of Pennsylvania, 2009. / Source: Masters Abstracts International, Volume: 47-05, page: 2936. Adviser: Randy Kaplan. Bibliographical references (p. 50-52)
|
36 |
Internet data acquisition, search and processingNeeli, Sandeep. Wilamowski, Bogdan M. January 2009 (has links)
Thesis--Auburn University, 2009. / Abstract. Includes bibliographic references (p.31-33).
|
37 |
Mining order-preserving submatrices from data with repeated measurementsZhu, Xinjie., 朱信杰. January 2010 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
|
38 |
Mining multi-faceted dataWan, Chang, 萬暢 January 2013 (has links)
Multi-faceted data contains different types of objects and relationships between them. With rapid growth of web-based services, multi-faceted data are increasing (e.g. Flickr, Yago, IMDB), which offers us richer information to infer users’ preferences and provide them better services. In this study, we look at two types of multi-faceted data: social tagging system and heterogeneous information network and how to improve service such as resources retrieving and classification on them.
In social tagging systems, resources such as images and videos are annotated with descriptive words called tags. It has been shown that tag-based resource searching and retrieval is much more effective than content-based retrieval. With the advances in mobile technology, many resources are also geo-tagged with location information. We observe that a traditional tag (word) can carry different semantics at different locations. We study how location information can be used to help distinguish the different semantics of a resource’s tags and thus to improve retrieval accuracy. Given a search query, we propose a location-partitioning method that partitions all locations into regions such that the user query carries distinguishing semantics in each region. Based on the identified regions, we utilize location information in estimating the ranking scores of resources for the given query. These ranking scores are learned using the Bayesian Personalized Ranking (BPR) framework. Two algorithms, namely, LTD and LPITF, which apply Tucker Decomposition and Pairwise Interaction Tensor Factorization, respectively for modeling the ranking score tensor are proposed. Through experiments on real datasets, we show that LTD and LPITF outperform other tag-based resource retrieval methods.
A heterogeneous information network (HIN) is used to model objects of different types and their relationships. Meta-paths are sequences of object types. They are used to represent complex relationships between objects beyond what links in a homogeneous network capture. We study the problem of classifying objects in an HIN. We propose class-level meta-paths and study how they can be used to (1) build more accurate classifiers and (2) improve active learning in identifying objects for which training labels should be obtained. We show that class-level meta-paths and object classification exhibit interesting synergy. Our experimental results show that the use of class-level meta-paths results in very effective active learning and good classification performance in HINs. / published_or_final_version / Computer Science / Master / Master of Philosophy
|
39 |
Data Consistency Checks on Flight Test DataMueller, G. 10 1900 (has links)
ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CA / This paper reflects the principal results of a study performed internally by Airbus's flight test centers. The purpose of this study was to share the body of knowledge concerning data consistency checks between all Airbus business units. An analysis of the test process is followed by the identification of the process stakeholders involved in ensuring data consistency. In the main part of the paper several different possibilities for improving data consistency are listed; it is left to the discretion of the reader to determine the appropriateness these methods.
|
40 |
Data warehousing mobile code design張振隆, Cheung, Chun-lung. January 2000 (has links)
published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Master / Master of Philosophy
|
Page generated in 0.0549 seconds