A voronoi diagram approach to autonomous clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4265 LNAI, Issue , 2006, Pages 149-160

  Koivistoinen, Heidi ^a   Ruuska, Minna ^a   Elomaa, Tapio ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DENSITY (SPECIFIC GRAVITY); INFORMATION ANALYSIS; LEARNING SYSTEMS; LINEAR ALGEBRA;

AGGLOMERATIVE CLUSTERING ALGORITHMS; AUTONOMOUS CLUSTERING; DISTANCE BASED CLUSTERING ALGORITHMS; VORONOI DIAGRAMS;

DATA MINING;

EID: 33750728071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11893318_17     Document Type: Conference Paper

References (21)

1. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys 31 (1999) 264-323
2. MacQueen, J.B.: On convergence of k-means and partitions with minimum average variance (abstract). Annals of Mathematical Statistics 38 (1965) 1084
3. Forgy, E.: Cluster analysis of multivariate data: Efficiency vs. interpretability of classifications. Biometrics 21 (1965) 768
4. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley & Sons, New York, NY (1973)
5. Pelleg, D., Moore, A.: X-means: Extending k-means with efficient estimation of the number of clusters. In Langley, P., ed.: Proc. 17th International Conference on Machine Learning, San Francisco, CA, Morgan Kaufmann (2000) 727-734
6. Hamerly, G., Elkan, C.: Learning the k in k-means. In Thrun, S., Saul, L.K., Schölkopf, B., eds.: Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA (2004) 281-288
7. Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In Bocca, J.B., Jarke, M., Zaniolo, C., eds.: Proc. 20th International Conference on Very Large Data Bases, San Francisco, CA, Morgan Kaufmann (1994) 144-155
8. Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: Proc. ACM SIGMOD International Conference on Management of Data, New York, NY, ACM Press (1995) 103-114
9. Guha, S., Rastogi, R., Shim, K.: Cure: An efficient clustering algorithm for large datasets. In: Proc. ACM SIGMOD International Conference on Management of Data, New York, NY, ACM Press (1998) 73-84
10. Moore, A.W.: The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In Boutilier, C., Goldszmidt, M., eds.: Proc. 16th Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, Morgan Kaufmann (2000) 397-405
11. Elkan, C.: Using the triangle inequality to accelerate k-means. In Fawcett, T., Mishra, N., eds.: Proc. 20th International Conference on Machine Learning, Menlo Park, AAAI Press (2003) 147-153
12. Elomaa, T., Koivistoinen, H.: On autonomous k-means clustering. In Hacid, M.S., Murray, N., Ras, Z.W., Tsumoto, S., eds.: Foundations of Intelligent Systems, Proc. 15th International Symposium, ISMIS'05. Volume 3488 of Lecture Notes in Artificial Intelligence., Berlin Heidelberg New York, Springer (2005) 228-236
13. Aurenhammer, F., Klein, R.: Voronoi diagrams. In Sack, J., Urrutia, G., eds.: Handbook of Computational Geometry. North-Holland, Amsterdam, The Netherlands (2000) 201-290
14. Schreiber, T.: A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data. In Bieri, H., Noltemeier, H., eds.: Computational Geometry - Methods, Algorithms and Applications. Volume 553 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer (1991) 265-275
15. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd International Conference on Knowledge Discovery and Data Mining, Menlo Park, CA, AAAI Press (1996) 226-231
16. Xu, X., Ester, M., Kriegel, H.P., Sander, J.: A distribution-based clustering algorithm for mining in large spatial databases. In: Proc. 14th International Conference on Data Engineering, Los Alamitos, CA, IEEE Computer Society Press (1998) 324-331
17. Hinneburg, A., Keim, D.A.: A general approach to clustering in large databases with noise. Knowledge and Information Systems 5 (2003) 387-415
18. Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1 + )-approximation algorithm for k-means clustering in any dimensions. In: Proc. 45th Annual IEEE Symposium on Foundations on Computer Science, Los Alamitos, CA, IEEE Press (2004) 454-462
19. Barber, C.B., Dobkin, D.P., Huhdanpaa, H.T.: The Quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software 22 (1996) 469-483
20. Aggarwal, A., Guibas, L.J., Saxe, J.B., Shor, P.W.: A linear-time algorithm for computing the voronoi diagram of a convex polygon. Discrete & Computational Geometry 4 (1989) 591-604
21. Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge, UK (2004)