Sciweavers

960 search results - page 2 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 8 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
13 years 11 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
ICDE
1998
IEEE
122views Database» more  ICDE 1998»
14 years 8 months ago
A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases
Xiaowei Xu, Martin Ester, Hans-Peter Kriegel, J&ou...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 7 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley