A sweep-line algorithm for spatial clustering

Advances in Engineering Software

Volumn 40, Issue 6, 2009, Pages 445-451

  Žalik, Krista Rizman ^a   Žalik, Borut ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Algorithm; Clustering; Spatial dataset; Sweep line paradigm

Indexed keywords

AGGLOMERATIVE HIERARCHICAL CLUSTERING; ARBITRARY SHAPES; CLUSTERING; POST-PROCESSING; PREPROCESSING PHASE; SPATIAL CLUSTERING; SPATIAL DATA SETS; SPATIAL DATASET; SPATIAL DATUM; STREAMING ALGORITHMS; SWEEP-LINE PARADIGM; THREE PHASIS;

CLUSTERING ALGORITHMS;

EID: 60849133603     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2008.06.003     Document Type: Article

References (25)

1. MacQueen JB. Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth berkeley symposium on mathematical statistics and probability; 1967. p. 281-97.
2. Jain A.K., and Dubes R.C. Algorithms for clustering data (1988), Prentice/Hall, Englewood Cliffs, New Jersey
3. Chinrungrueng C., and Sequin C.H. Optimal adaptive K-means algorithm with dynamic adjustment of learning rate. IEEE Trans Neural Networks 6 1 (1995) 157-169
4. Krishna K., and Narasimha M. Genetic k-means algorithm. IEEE Trans Syst Man Cybernet B 29 3 (1998) 433-439
5. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: a review. ACM Comput Surv 31 3 (1999) 264-323
6. Han J., and Kamber M. Data mining, concepts and techniques (2001), Morgan Kaufmann/Elsevier
7. Su M.C., and Liu Y.C. A new approach to clustering data with arbitrary shapes. Pattern Recognit 38 11 (2005) 1887-1901
8. Bishop C.M. Neural networks for pattern recognition (1997), Oxford University Press, Clarendon
9. Tsai C.-F., Tsai C.-W., Wu H.-C., and Yang T. ACODF: a novel data clustering approach for data mining in large databases. J Syst Softw 73 1 (2000) 133-145
10. Han R.N.J. CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowledge Data Eng 14 5 (2000) 1003-1016
11. Tobler W.R. A computer model simulation of urban growth in the Detroit region. Econ Geog 46 2 (1970) 234-240
12. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput C-20 (1971) 68-86
13. Page R.L. A minimal spanning tree clustering method. Commun ACM 17 6 (1974) 321-323
14. Narendra A. Dot pattern processing using Voronoi neighborhoods. IEEE Trans Pattern Anal Mach Intell 4 3 (1982) 336-343
15. Kang I.-S., Kim T.W., and Li K.-J. A spatial data mining method by Delaunay triangulation. GIS '97: proceedings of the fifth ACM international workshop on advances in geographic information systems (1997), ACM Press, New York, NY, USA 35-39
16. Yujian L. A clustering algorithm based on minimal Θ-distant subtrees. Pattern Recognit 40 5 (2007) 1425-1431
17. O'Rourke J. Computational geometry in C (1998), Cambridge University Press, Cambridge
18. Josuttis N.M. The C++ standard library (1999), Addison Wesley, Indianapolis
19. Su P, Drysdale RLS. A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of SCG'95 (ACM symposium on computational geometry); 1995. p. 61-70.
20. Žalik B. An efficient sweep-line Delaunay triangulation algorithm. Comput Aided Des 37 10 (2005) 1027-1038
21. Weitkamp C. Lidar: range-resolved optical remote sensing of the atmosphere (Springer series in optical sciences) (2005), Springer, Berlin
22. Blelloch G.E., Hardwick J.C., Miller G.L., and Talmor D. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 24 3-4 (1999) 243-269
23. Vitter J.S. External memory algorithms and data structures: dealing with massive data. ACM Comput Surv 33 2 (2001) 209-271
24. Li M., Claypool M., Kinicki R., and Nichols J. Characteristics of streaming media stored on the web. ACM Trans Internet Technol 5 4 (2005) 601-626
25. Salomon D. Data compression: the complete reference (2005), Springer-Verlag, New York