융합 인공벌군집 데이터 클러스터링 방법

서지정보

ㆍ발행기관 : 한국산업경영시스템학회 ㆍ수록지정보 : 산업경영시스템학회지 / 40권 / 4호
ㆍ저자명 : 강범수, 김성수

목차

1. 연구의 배경과 목적1
2. 데이터 클러스터링 문제와 해 평가
3. 융합 ABC 데이터 클러스터링 방법
3.1 인공벌군집 방법
3.2 융합 ABC 데이터 클러스터링 방법
4. 실험 및 분석
5. 결 론
Acknowledgements
References

영어 초록

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.

참고 자료

없음