Sciweavers

73 search results - page 3 / 15
» Data Mining on an OLTP System (Nearly) for Free
Sort
View
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
14 years 5 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
GIS
2010
ACM
13 years 4 months ago
Detecting nearly duplicated records in location datasets
The quality of a local search engine, such as Google and Bing Maps, heavily relies on its geographic datasets. Typically, these datasets are obtained from multiple sources, e.g., ...
Yu Zheng, Xixuan Fen, Xing Xie, Shuang Peng, James...
HPCA
2000
IEEE
13 years 9 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
SAC
2008
ACM
13 years 4 months ago
Frequent pattern mining for kernel trace data
Operating systems engineers have developed tracing tools that log details about process execution at the kernel level. These tools make it easier to understand the actual executio...
Christopher LaRosa, Li Xiong, Ken Mandelberg
MSR
2010
ACM
13 years 10 months ago
A comparative exploration of FreeBSD bug lifetimes
—In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in h...
Gargi Bougie, Christoph Treude, Daniel M. Germ&aac...