An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Using simulated annealing to design good codes
IEEE Transactions on Information Theory
Robust Clustering with Applications in Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vector quantization and signal compression
Vector quantization and signal compression
Equal-average hyperplane partitioning method for vector quantization of image data
Pattern Recognition Letters
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
CACTUS—clustering categorical data using summaries
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Computing Surveys (CSUR)
Fuzzy Clustering Models and Applications
Fuzzy Clustering Models and Applications
Vector quantization based on genetic simulated annealing
Signal Processing
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Data Mining and Knowledge Discovery
CLARANS: A Method for Clustering Objects for Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
Applying AI Clustering to Engineering Tasks
IEEE Expert: Intelligent Systems and Their Applications
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Creating Adaptive Web Sites Through Usage-Based Clustering of URLs
KDEX '99 Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange
Improving OLAP Performance by Multidimensional Hierarchical Clustering
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Ensemble Clustering in Medical Diagnostics
CBMS '04 Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems
DBRS: a density-based spatial clustering method with random sampling
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Survey of clustering algorithms
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
In this paper two categories of improvements are suggested thatcan be applied to most k-medoids-based algorithms -conceptual/algorithmic improvements, and implementationalimprovements. These include the revisiting of the accepted casesfor swap comparison and the application of partial distancesearching and previous medoid indexing to clustering. Varioushybrids are then applied to a number of k-medoids-based algorithmsand the method is shown to be generally applicable. Experimentalresults on both artificial and real datasets demonstrate that whenapplied to CLARANS the number of distance calculations can bereduced by up to 98%.