융합 인공벌군집 데이터 클러스터링 방법
Combined Artificial Bee Colony for Data Clustering
2
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.
Abstract
Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.
참고문헌 (28)
- Assuncao, M. D., "Big Data computing and clouds :Trends and future directions", Journal of Parallel and Distributed Computing, 79, pp.3~15 (2015)
- Fahad, A., "A survey of clustering algorithms for big data : Taxonomy and empirical analysis", IEEE transactions on emerging topics in computing, 2(3), pp.267~279 (2014)
- Gungor, Z., "K-harmonic means data clustering with simulated annealing heuristic", Applied Mathematics and Computation, 184(2), pp.199~209 (2007)
- Hruschka, E. R., "A survey of evolutionary algorithms for clustering", IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 39(2), pp.133~155 (2009)
- 전수연, "빅데이터 기반 군수품 품질정보 활용방안에 대한 연구", 한국산학기술학회논문지, 17(6), pp.315~325 (2016), 한국산학기술학회[DOI]
- Karaboga, D., "A novel clustering approach : Artificial Bee Colony (ABC) algorithm", Applied soft computing, 11(1), pp.652~657 (2011)
- Kao, Y. T., "A hybridized approach to data clustering", Expert Systems with Applications, 34(3), pp.1754~1762 (2008)
- 김성수, "데이터 클러스터링을 위한 혼합 시뮬레이티드 어닐링", 산업경영시스템학회지, 40(2), pp.92~98 (2017), 한국산업경영시스템학회
- 김성수, "인공벌군집을 적용한 무선네트워크 셀 그룹핑 설계", 산업경영시스템학회지, 39(2), pp.46~53 (2016), 한국산업경영시스템학회
- Krishna, K., "Genetic K-means algorithm", IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 29(3), pp.433~439 (1999)
- Kumar, Y., "A two-step artificial bee colony algorithm for clustering", Neural Computing and Applications, 28(3), pp.537~551 (2017)
- Maulik, U., "Genetic algorithmbased clustering technique", Pattern recognition, 33(9), pp.1455~1465 (2000)
- Perim, G., "K-Means Initialization Methods for Improving Clustering by Simulated Annealing", 11th Ibero-American Conference on AI, 5290, pp.133~142 (2008)
- Reisi, M., "A feature weighting based artificial bee colony algorithm for data clustering", Information and Knowledge Technology (IKT), 2016 Eighth International Conference on, pp.134~138 (2016)
- Selim, S.Z., "A simulated annealing algorithm for the clustering problem", Pattern recognition, 24(10), pp.1003~1008 (1991)
- Singh, S.S., "K-means v", s K-medoids:A Comparative Study, 2011, pp.13, ~
- Sithara, E.P., "A Hybrid K Harmonic Means with ABC Clustering Algorithm using an Optimal K value for High Performance Clustering", International Journal on Cybernetics & Informatics, 5(2) (2016)
- Sun, L. X., "Cluster analysis by the K-means algorithm and simulated annealing", Chemometrics and intelligent laboratory systems, 25(1), pp.51~60 (1994)
- Tran, D. C., "A Novel Hybrid Data Clustering Algorithm Based on Artificial Bee Colony Algorithm and K-Mean", Chinese Journal of Electronics, 24(4), pp.694~701 (2015)
- "UCI machine learning repository Cloud datasets"[URL]
- "UCI machine learning repository Glass datasets"[URL]
- "UCI machine learning repository Iris datasets"[URL]
- "UCI machine learning repository Vowel datasets"[URL]
- "UCI machine learning repository Wine datasets"[URL]
- Van der Merwe, D.W., "Data clustering using particle swarm optimization", Evolutionary Computation, 2003, CEC’03. The 2003 Congress on, 1, pp.215~220 (2003), IEEE
- Xu, R., "A comparison study of validity indices on swarm-intelligence-based clustering", IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 42(4), pp.1243~1256 (2012)
- Yan, X., "A new approach for data clustering using hybrid artificial bee colony algorithm", Neurocomputing, 97, pp.241~250 (2012)
- Zhang, C., "An artificial bee colony approach for clustering", Expert Systems with Applications, 37(7), pp.4761~4767 (2010)