CDNASA: clustering data with noise and arbitrary shape Online publication date: Sun, 06-Nov-2016
by Zhong-Han Niu; Jian-Cong Fan; Wen-Hua Liu; Liang Tang; Shuai Tang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 11, No. 2, 2016
Abstract: In many data domains, especially for spatial data, clusters of data are of arbitrary shape, size and density. Traditional clustering methods often fail to identify clusters efficiently or accurately in those situations. But the need for scalable spatial clustering algorithms has emerged with the rapid growth of spatial data in recent years. In this paper we propose a spatial clustering method, named CDNASA, based on the idea that each data object belongs to a certain space and if the two spaces have overlapping sections, they can be merged into one cluster. The data points which cannot be merged by any cluster are noise points. The effectiveness and efficiency of the proposed algorithm are tested on both synthetic and real data sets. Experimental results show that the quality of clusters discovered by CDNASA is much better than those by existing algorithms, especially for arbitrary shaped clusters. CDNASA also has the characteristics of noise-tolerance as well as low time and space complexity.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook