Using Pivots to Speed-Up k-Medoids Clustering
暂无分享,去创建一个
Caetano Traina | Mario A. Nascimento | Adriano Arantes Paterlini | M. Nascimento | C. Traina | A. Paterlini
[1] Qiaoping Zhang,et al. A New and Efficient K-Medoid Algorithm for Spatial Clustering , 2005, ICCSA.
[2] Thanasis Hadzilacos,et al. Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.
[3] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[4] J. A. Hartigan,et al. A k-means clustering algorithm , 1979 .
[5] Kyriakos Mouratidis,et al. Medoid Queries in Large Spatial Databases , 2005, SSTD.
[6] Peter J. Rousseeuw,et al. Clustering by means of medoids , 1987 .
[7] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[8] Jiawei Han,et al. Data Mining: Concepts and Techniques , 2000 .
[9] Robin Sibson,et al. SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..
[10] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[11] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.
[12] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[13] Arnold W. M. Smeulders,et al. The Amsterdam Library of Object Images , 2004, International Journal of Computer Vision.
[14] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .
[15] Hans-Peter Kriegel,et al. Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification , 1995, SSD.
[16] Peter J. Rousseeuw,et al. CLUSTERING LARGE DATA SETS , 1986 .
[17] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[18] Hanan Samet,et al. Properties of Embedding Methods for Similarity Searching in Metric Spaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[19] Agma J. M. Traina,et al. The Metric Histogram: A New and Efficient Approach for Content-based Image Retrieval , 2002, VDB.
[20] Hae-Sang Park,et al. A simple and fast algorithm for K-medoids clustering , 2009, Expert Syst. Appl..
[21] Jeng-Shyang Pan,et al. An Efficient K -Medoids-Based Algorithm Using Previous Medoid Index, Triangular Inequality Elimination Criteria, and Partial Distance Search , 2002, DaWaK.