Fereshte Khani
Mohmmad Javad Hosseini
ABSTRACT
In clustering spatial data, we are given a set of points in Rn and the objective is to find the clusters (representing spatial objects) in the set of points. Finding clusters with different shapes, sizes, and densities in data with noise and potentially outliers is a challenging task. This problem is especially studied in machine learning community and has lots of applications. We present a novel clustering technique, which can solve mentioned issues considerably. In the proposed algorithm, we let the structure of the data set itself find the clusters, this is done by having points actively send and receive feedbacks to each other.
The idea of the proposed method is to transform the input data set into a graph by adding edges between points that belong to the same cluster, so as connected components correspond to clusters, whereas points in different clusters are almost disconnected. At the start, our algorithm creates a preliminary graph and tries to improve it iteratively. In order to build the graph (add more edges), each point sends feedback to its neighborhood points. The neighborhoods and the feedback to be sent are determined by investigating the received feedbacks. This process continues until a stable graph is created. Henceforth, the clusters are formed by post-processing the constructed graph. Our algorithm is intuitive, easy to state and analyze, and does not need to have lots of parameter tuning. Experimental results show that our proposed algorithm outperforms existing related methods in this area.
- ACSD Data Sets.ce.sharif.edu/~fkhani/research/ACSD. {Online; accessed Sep-2012}.Google Scholar
- Chameleon Data Sets. http://glaros.dtc.umn.edu/gkhome/cluto/cluto/download. {Online; accessed Sep-2012}.Google Scholar
- M. Ankerst, M. Breunig, H. Kriegel, and J. Sander. Optics: ordering points to identify the clustering structure. ACM SIGMOD Record, 28(2):49--60, 1999. Google ScholarDigital Library
- D. Birant and A. Kut. St-dbscan: An algorithm for clustering spatial--temporal data. Data & Knowledge Engineering, 60(1):208--221, 2007. Google ScholarDigital Library
- B. Borah and D. Bhattacharyya. An improved sampling-based dbscan for large spatial databases. In Intelligent Sensing and Information Processing, pages 92--96. IEEE, 2004.Google ScholarCross Ref
- B. Borah and D. Bhattacharyya. A clustering technique using density difference. In Signal Processing, Communications and Networking, pages 585--588. IEEE, 2007.Google Scholar
- B. Borah and D. Bhattacharyya. Ddsc: A density differentiated spatial clustering technique. Journal of Computers, 3(2):72--79, 2008.Google ScholarCross Ref
- M. Connor and P. Kumar. Fast construction of k-nearest neighbor graphs for point clouds. Visualization and Computer Graphics, IEEE Transactions on, 16(4):599--608, 2010. Google ScholarDigital Library
- M. Dickerson and D. Eppstein. Algorithms for proximity problems in higher dimensions. Computational Geometry, 5(5):277--291, 1996. Google ScholarDigital Library
- L. Ertöz, M. Steinbach, and V. Kumar. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In SIAM international conference on data mining, volume 47, 2003.Google ScholarCross Ref
- M. Ester, H. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining, volume 1996, pages 226--231. AAAI Press, 1996.Google Scholar
- N. Grira, M. Crucianu, and N. Boujemaa. Unsupervised and semi-supervised clustering: a brief survey. A Review of Machine Learning Techniques for Processing Multimedia Content, 2004.Google Scholar
- S. Jigui, L. Jie, and Z. Lianyu. Clustering algorithms research. Journal of Software, 19(1):48--61, 2008.Google ScholarCross Ref
- P. Jones, A. Osipov, and V. Rokhlin. A randomized approximate nearest neighbors algorithm. Applied and Computational Harmonic Analysis, 2012.Google Scholar
- G. Karypis, E. Han, and V. Kumar. Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8):68--75, 1999. Google ScholarDigital Library
- J. Sander, M. Ester, H. Kriegel, and X. Xu. Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery, 2(2):169--194, 1998. Google ScholarDigital Library
Index Terms
- An algorithm for discovering clusters of different densities or shapes in noisy data sets
Recommendations
CB-DBSCAN: A Novel Clustering Algorithm for Adjacent Clusters with Different Densities
Advances in Artificial IntelligenceAbstractDensity-based clustering is well-known for finding clusters that have different shapes and sizes, but they have unsatisfactory results on adjacent clusters with different densities. In this paper, we propose a novel algorithm that combines DBSCAN ...
Validity index for clusters of different sizes and densities
Cluster validity indices are used to validate results of clustering and to find a set of clusters that best fits natural partitions for given data set. Most of the previous validity indices have been considerably dependent on the number of data objects ...
A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
It is important to find the natural clusters in high dimensional data where visualization becomes difficult. A natural cluster is a cluster of any shape and density, and it should not be restricted to a globular shape as a wide number of algorithms ...
Comments