Sciweavers

1413 search results - page 27 / 283
» Mining Multiple Large Databases
Sort
View
EUROPAR
1999
Springer
13 years 12 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
14 years 2 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
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...
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 3 days ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
SIGKDD
2000
237views more  SIGKDD 2000»
13 years 7 months ago
The UCI KDD Archive of Large Data Sets for Data Mining Research and Experimentation
Advances in data collection and storage have allowed organizations to create massive, complex and heterogeneous databases, which have stymied traditional methods of data analysis....
Stephen D. Bay, Dennis F. Kibler, Michael J. Pazza...