A sweep-line algorithm for spatial clustering

This paper presents an agglomerative hierarchical clustering algorithm for spatial data. It discovers clusters of arbitrary shapes which may be nested. The algorithm uses a sweeping approach consisting of three phases: sorting is done during the preprocessing phase, determination of clusters is performed during the sweeping phase, and clusters are adjusted during the post processing phase. The properties of the algorithm are demonstrated by examples. The algorithm is also adapted to the streaming algorithm for clustering large spatial datasets.

[1]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[2]  J. A. Rose.  Artifical Intelligence Through Prolog by Neils Rowe Prentice-Hall, Englewood Cliffs, New Jersey, U.S.A., 1988 (£15.95) , 1988, Robotica.

[3]  Mark Claypool,et al.  Characteristics of streaming media stored on the Web , 2005, TOIT.

[4]  Jiawei Han,et al.  CLARANS: A Method for Clustering Objects for Spatial Data Mining , 2002, IEEE Trans. Knowl. Data Eng..

[5]  Guy E. Blelloch,et al.  Design and Implementation of a Practical Parallel Delaunay Algorithm , 1999, Algorithmica.

[6]  Narendra Ahuja,et al.  Dot Pattern Processing Using Voronoi Neighborhoods , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[8]  Borut alik.  An efficient sweep-line Delaunay triangulation algorithm , 2005 .

[9]  Li Yujian.  A clustering algorithm based on maximal θ-distant subtrees , 2007 .

[10]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[11]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[12]  M. Narasimha Murty,et al.  Genetic K-means algorithm , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[13]  Carlo H. Séquin,et al.  Optimal adaptive k-means algorithm with dynamic adjustment of learning rate , 1995, IEEE Trans. Neural Networks.

[14]  Christopher M. Bishop,et al.  Neural networks for pattern recognition , 1995 .

[15]  Ki-Joune Li,et al.  A spatial data mining method by Delaunay triangulation , 1997, GIS '97.

[16]  Nicolai M. Josuttis.  The C++ standard library , 1999 .

[17]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[18]  W. Tobler.  A Computer Movie Simulating Urban Growth in the Detroit Region , 1970 .

[19]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[20]  Mu-Chun Su,et al.  A new approach to clustering data with arbitrary shapes , 2005, Pattern Recognit..

[21]  Rex Page,et al.  Algorithm 479: A minimal spanning tree clustering method , 1974, CACM.

[22]  Robert L. Scot Drysdale,et al.  A comparison of sequential Delaunay triangulation algorithms , 1995, SCG '95.

[23]  Cheng-Fa Tsai,et al.  ACODF: a novel data clustering approach for data mining in large databases , 2004 .

[24]  David Salomon,et al.  Data Compression: The Complete Reference , 2006 .