IEEE Transactions on Knowledge and Data Engineering · 2004 · 99 citations · 61 references
ComputingComputer ScienceComputer SystemsData ManagementData MiningDatabasesCluster DetectionCluster ManagementData PartitioningDocument ClusteringScalable Data MiningScalable Machine LearningClusteringClustering AlgorithmsClustering For Large-scale DataDimensionality ControlHigh-dimensional Data ClusteringK-means ClusteringRelational Database SystemsScalable Clustering
K-means is one of the most popular clustering algorithms. We introduce an efficient disk-based implementation of K-means. The proposed algorithm is designed to work inside a relational database management system. It can cluster large data sets having very high dimensionality. In general, it only requires three scans over the data set. It is optimized to perform heavy disk I/O and its memory requirements are low. Its parameters are easy to set. An extensive experimental section evaluates quality of results and performance. The proposed algorithm is compared against the Standard K-means algorithm as well as the Scalable K-means algorithm.
61
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations