Effective clustering and boundary detection algorithm based on Delaunay triangulation

Pattern Recognition Letters

Volumn 29, Issue 9, 2008, Pages 1261-1273

  Liu, Dongquan ^a   Nosovskiy, Gleb V ^b   Sourina, Olga ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Clustering algorithms; Data mining; Delaunay triangulation

Indexed keywords

COMPUTER GRAPHICS; DATA MINING; DATA PROCESSING; FEATURE EXTRACTION; MATHEMATICAL MODELS; STATISTICAL METHODS;

BOUNDARY DETECTION ALGORITHMS; DATA PROXIMITY; DELAUNAY TRIANGULATION; TRICLUST;

CLUSTERING ALGORITHMS;

EID: 43249120533     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2008.01.028     Document Type: Article

References (34)

1. Adamson, A., Alexa, M., 2004. Approximating bounded, non-orientable surfaces from points. In: Proc. Shape Modeling International 2004, pp. 243-252.
2. Andersson, M., Giesen, J., Pauly, M., Speckmann, B., 2004. Bounds on the k-neighborhood for locally uniformly sampled surfaces. In: Proc. 1st Symposium on Point-Based Graphics, pp. 167-171.
3. Ankerst, M., Breunig, Markus M., Kriegel, H.-P., Sander, J., 1999. OPTICS: Ordering points to identify the clustering structure. In: Proc. ACM SIGMOD Internat. Conf. on Management of Data SIGMOD'99, pp. 49-60.
4. Bailey T., and Gatrell T. Interactive Spatial Data Analysis (1996), Prentice Hall
5. Berkhin, Pavel, 2002. Survey of Clustering Data Mining Techniques. Tech. Rep., Accrue Software, San Jose, CA.
6. Bowyer A. Computing Dirichlet Tessellations. Comput. J. 24 (1981) 162-166
7. Eldershaw, C., Hegland, M., 1997. Cluster Analysis using Triangulation. In Proc. Computational Techniques and Applications: CTAC97, Singapore, pp. 201-208.
8. Ester, M., Kriegel, H.-P., Sander, J., Xu, X., 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd Internat. Conf. on Knowledge Discovery and Data Mining, pp. 226-231.
9. Estivill-Castro, V., Lee, I., 2000. AMOEBA: Hierarchical clustering based on spatial proximity using Delaunay diagram. In Proc. 9th Internat. Symposium on Spatial Data Handling, pp. 7a.26-7a.41.
10. Estivill-Castro, V., Lee, I., 2000. AUTOCLUST: Automatic clustering via boundary extraction for mining massive point-data sets. In: Proc. 5th Internat. Conf. on Geocomputation.
11. Fayad U.M. Advances in Knowledge Discovery in Databases (1996), MIT Press
12. Fraley, C., Raftery, A.E., 2002. MCLUST: Software for model-based clustering, density estimation and discriminant analysis. Tech. Rep. 415. Department of Statistics, University of Washington.
13. Fraley C., and Raftery A.E. Model-based clustering, discriminant analysis, and density estimation. J. Amer. Statist. Assoc. 97 (2002) 611-631
14. Gold C.M. Problems with handling spatial data-the Voronoi approach. CISM J. ACSGC 45 (1991) 65-80
15. Guha S., Rastogi R., and Shim K. CURE: An efficient clustering algorithm for large databases. Proc. 1998 ACM SIGMOD Internat. Conf. on Management of Data (1998), ACM Press, New York, NY, USA 73-84
16. Hader, S., Hamprecht, F.A., 2003. Efficient density clustering using basin spanning trees. In: Proc. 26th Annual Conf. of the Gesellschaft für Klassifikation (GfK1), pp. 39-48.
17. Han J., and Kamber M. Data Mining: Concepts and Techniques. first ed. (2000), Morgan Kaufman
18. Hinneburg, A., Keim, D.A., 1998. An efficient approach to clustering in large multimedia databases with noise. In: Proc. 4th Internat. Conf. on Knowledge Discovery and Data Mining, pp. 58-65.
19. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: A review. ACM Comput. Surveys 31 3 (1999) 264-323
20. Kang I.-S., Kim T.w., and Li K.-J. A spatial data mining method by Delaunay triangulation. Proc. 5th ACM Internat. Workshop on Advances in Geographic Information Systems (1997), ACM Press, New York, NY, USA 35-39
21. Kohonen T. The self-organizing map. Proc. IEEE 9 (1990) 1464-1479
22. Lee D.T., and Schacter B.J. Two algorithms for constructing a Delaunay triangulation. Internat. J. Comput. Inform Sci 3 (1980) 219-241
23. MacQueen, J., 1967. Some methods for classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Math. Statist. Prob., pp. 281-297.
24. Murtagh F. Multidimensional Clustering Algorithms, Compstat Lectures (1985), Physika Verlag, Vienna
25. Nagy G. State of the art in pattern recognition. Proc. IEEE 56 (1968) 836-863
26. Ng, R.T., Han, J., 1994. Efficient and effective clustering methods for spatial data mining. In: Proc. 20th Internat. Conf. on Very Large Data Bases VLDB 94, Santiago, Chile, pp. 144-155.
27. Okabe A., Boots B., Sugihara K., and Chiu S.N. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. second ed. (2000), John Wiley & Sons
28. Pauly, M., Gross, M., Kobbelt, L., 2002. Efficient simplification of point-sampled surfaces. In: Proc. Conf. on Visualization'02, pp. 163-170.
29. Pfister H., and Gross M. Point-based computer graphics. IEEE Comput. Graphics Applications 4 (2004) 22-23
30. Watson D.F. Computing the n-dimensional Delaunay Tessellation with application to Voronoi Polytopes. Comput. J. 24 (1981) 167-172
31. Xu II R., and Wunsch D. Survey of clustering algorithms. IEEE Trans. Neural Networks 16 (2005) 645-678
32. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. 20 1 (1971) 68-86
33. Zhang Y.J., and Liu Z.Q. Self-splitting competitive learning: A new online clustering paradigm. IEEE Trans. Neural Networks 13 (2002) 369-380
34. Zhang, T., Ramakrishnan, R., Livny, M., 1996. BIRCH: An efficient data clustering method for very large databases. In: Proc. 1996 ACM SIGMOD Internat. Conf. on Management of data, pp. 103-114.