논문 상세보기
빠른 클러스터 개수 선정을 통한 효율적인 데이터 클러스터링 방법 KCI 등재
Efficient Data Clustering using Fast Choice for Number of Clusters
pp.1-8
K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, this method has the limitation to be used with fixed number of clusters because of only considering the intra-cluster distance to evaluate the data clustering solutions. Silhouette is useful and stable valid index to decide the data clustering solution with number of clusters to consider the intra and inter cluster distance for unsupervised data. However, this valid index has high computational burden because of considering quality measure for each data object. The objective of this paper is to propose the fast and simple speed-up method to overcome this limitation to use silhouette for the effective large-scale data clustering. In the first step, the proposed method calculates and saves the distance for each data once. In the second step, this distance matrix is used to calculate the relative distance rate (Vｊ) of each data j and this rate is used to choose the suitable number of clusters without much computation time. In the third step, the proposed efficient heuristic algorithm (Group search optimization, GSO, in this paper) can search the global optimum with saving computational capacity with good initial solutions using Vｊ probabilistically for the data clustering. The performance of our proposed method is validated to save significantly computation time against the original silhouette only using Ruspini, Iris, Wine and Breast cancer in UCI machine learning repository datasets by experiment and analysis. Especially, the performance of our proposed method is much better than previous method for the larger size of data.
2. 빠른 클러스터 수 선택과 휴리스틱 알고리즘
2.1 데이터 클러스터링 문제와 빠른 클러스터 수선택 방법
2.2 거리의 상대적인 비율을 적용한 휴리스틱 알고리즘
3. 실험 및 분석
3.1 빠른 클러스터 수 선택
3.2 거리의 상대적인 비율을 적용한 휴리스틱알고리즘 분석
4. 결 론
References
