An incremental Multi-Centroid, Multi-Run Sampling Scheme for k-medoids-based algorithms

Management Information Systems

Volumn 6, Issue , 2002, Pages 553-562

  Chu, S C ^a   Roddick, J F ^a   Pan, J S ^b  

^a FLINDERS UNIVERSITY   (Australia)

^b NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER SIMULATION; DATA ACQUISITION; IMAGE PROCESSING; INVARIANCE; PATTERN RECOGNITION;

CLUSTERING; K-MEDOIDS-BASED ALGORITHMS; MULTI-CENTROID; MULTI-RUN SAMPLING SCHEME;

DATABASE SYSTEMS;

EID: 2942633848     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Conference Paper

References (18)

1. S. C. Chu, J. F. Roddick, and J. S. Pan. A comparative study and extensions to k-medoids algorithms. In Fifth International Conference on Optimization:Techniques and Applications, pages 1708-1717, Hong Kong, China, 2001.
2. S-C. Chu, J. F. Roddick, and J. S. Pan. Efficient k-medoids algorithms using multi-centroids with multi-runs sampling scheme. In Workshop on Mining Data for CRM, Taipei, Taiwan, 2002. Springer.
3. S-C. Chu, J. F. Roddick, and J. S. Pan. An incremental multi-centroid, multi-run sampling scheme for k-medoids-based algorithms - extended report. Technical Report KDM-02-003, KDM Laboratory, Flinders University, 2002.
4. Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In E. Simoudis, J. Han, and U. Fayyad, editors, Second International Conference on Knowledge Discovery and Data Mining, pages 226-231, Portland, OR, 1996. AAAI Press.
5. 5] V. Estivill-Castro and I. Lee. Autoclust+: Automatic clustering of point-data sets in the presence of obstacles. In J.F. Roddick and K. Homsby, editors, International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining, TSDM2000, volume 2007 of Lecture Notes in Artificial Intelligence, Lyon, France, 2000. Springer.
6. V. Estivill-Castro and I. Lee. Autoclust: Automatic clustering via boundary extraction for massive point-data sets. In Fifth International Conference on Geocomputation, 2000.
7. D. E. Goldberg. Genetic algorithm in search, optimization and machine learning. Addison-Wesley, 1989.
8. S. Guha, Rajeev Rastogi, and K. Shim. Cure: an efficient clustering algorithm for large databases. In ACM SIGMOD International Conference on the Management of Data, pages 73-84, Seattle, WA, USA, 1998.
9. H. C. Huang, J. S. Pan, Z. M. Lu, S. H. Sun, and H. M. Hang. Vector quantization based on genetic simulated annealing. Signal Processing, 81(7):1513-1523, 2001.
10. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: a hierarchical clustering algorithm using dynamic modeling. Computer, 32:32-68, 1999.
11. L. Kaufman and P.J. Rousseeuw. Finding groups in data: an introduction to cluster analysis. John Wiley and Sons, New York, 1990.
12. S. Kirkpatrick, C.D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220 (4598):671-680, 1983.
13. R. Krishnapuram, A. Joshi, and L. Yi. A fuzzy relative of the k-medoids algorithm with application to web document and snippet clustering. In IEEE International Fuzzy Systems Conference, pages 1281-1286, Seoul, Korea, 1999.
14. Y. Linde, A. Buzo, and R. M. Gray. An algorithm for vector quantizer design. IEEE Transactions on Communications, 28(1):84-95, 1980.
15. C. B. Lucasius, A. D. Dane, and G. Kateman. On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasibility and comparison. Analytica Chimica Acta, pages 647-669, 1993.
16. J. MacQueen. Some methods for classification and analysis of multivariate observations. In 5th Berkeley symposium on mathematics, statistics and Probability, volume 1, pages 281-296, 1967.
17. R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In J.B. Bocca, M. Jarke, and C. Zaniolo, editors, Twentieth International Conference on Very Large Data Bases, pages 144-155, Santiago, Chile, 1994. Morgan Kaufmann.
18. Tian Zhang, Raghu Ramakrishnan, and Miron Livny. Birch: An efficient clustering method for very large databases. In ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pages 103-114, Montreal, 1996.