Sciweavers

728 search results - page 17 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICDM
2006
IEEE
95views Data Mining» more  ICDM 2006»
14 years 1 months ago
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
Hui Xiong, Mark Brodie, Sheng Ma
AUSDM
2008
Springer
227views Data Mining» more  AUSDM 2008»
13 years 9 months ago
Exploratory Mining over Organisational Communications Data
Exploratory data mining is fundamental to fostering an appreciation of complex datasets. For large and continuously growing datasets, such as obtained by regular sampling of an or...
Alan Allwright, John F. Roddick
FIMI
2003
170views Data Mining» more  FIMI 2003»
13 years 9 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
EDBT
2006
ACM
122views Database» more  EDBT 2006»
14 years 7 months ago
TQuEST: Threshold Query Execution for Large Sets of Time Series
Effective and efficient data mining in time series databases is essential in many application domains as for instance in financial analysis, medicine, meteorology, and environmenta...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...