The week's pick
Random Articles
Reseach Article
Density base k-Mean’s Cluster Centroid Initialization Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 137 - Number 11 |
| Year of Publication: 2016 |
| Authors: Kabiru Dalhatu, Alex Tie Hiang Sim |
10.5120/ijca2016908923
|
Kabiru Dalhatu, Alex Tie Hiang Sim . Density base k-Mean’s Cluster Centroid Initialization Algorithm. International Journal of Computer Applications. 137, 11 ( March 2016), 48-51. DOI=10.5120/ijca2016908923
Abstract
A spatial data mining is a process of extracting valid and useful information out of generated data, which recently becomes a highly demanding field due to the huge amount of data collected everyday across various applications domains which by far exceeded human’s ability to analyses, this brought about the development of many data mining tools among which clustering is recognized to be the efficient data mining method that categorized data based on similarity measures, where k-Means is a well-known clustering algorithm used across different application domains. Similarly, k-Means suffer from multiple limitations with its clustering accuracy fully depend on cluster center positioning. In this paper, a density base k-Means cluster centroid initialization algorithm has been proposed to overcome k-Mean’s cluster center initialization problem. To prove the accuracy of the proposed algorithm the evaluation test was conducted using two synthetic datasets called Jain and Path base dataset. The clustering accuracy result of the proposed algorithm is compared with that of traditional k-Means algorithm where it proved that the clustering accuracy of the proposed algorithm is better than that of traditional k-Means algorithm.
References
- Denning, D.E., An intrusion detection model. IEEE Transactions of Software Engineering, 1987. 13(2): p. 222-232.
- Abubaker, M. and W. Ashour, Efficient Data Clustering Algorithms: Improvements over Kmeans. I.J. Intelligent Systems and Applications, 2013: p. 37-49.
- Rai, P. and S. Singh, A Survey of Clustering Techniques. International Journal of Computer Applications, 2010. 7(12): p. 1-5.
- Abhilash, B.C., A Comparative study on clustering of data using Improved K-means Algorithms. International Journal of Computer Trends and Technology 2013. 4(4): p. 771-778.
- Mumtaz, K. and D.K. Duraiswamy, A Novel Density based improved k-means Clustering Algorithm. International Journal on Computer Science and Engineering, 2013. 02(02): p. 213-218.
- Zhang, C. and Z. Fang, An Improved K-means Clustering Algorithm. Journal of Information & Computational Science, 2013. 10(1): p. 193–199.
- Wang, K., et al., An Improved K-means Clustering Algorithm Based on Prim. Journal of Information & Computational Science, 2013. 10(13): p. 4303–4310.
- Yedla, M., S.R. Pathakota, and T.M. Srinivasa, Enhancing K-means Clustering Algorithm with Improved Initial CenterInternational Journal of Computer Science and Information Technologies, 2010. 1(2): p. 121-125.
- Zhang, X., et al., A Density-Based Method for Initializing the K-means Clustering Algorithm. International Conference on Network and Computational Intelligence, 2012. 46: p. 46-53.
- Yuan, F., et al., A New Algorithm to get the Intial Centroids Proceedings of the Third International Conference on Machine Laming and Cybernetic, 2004: p. 1191-1193.
Index Terms
Keywords