• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.723-733
• /
• 2009

The crucial problems of K-means clustering are deciding the number of clusters and initial centroids of clusters. Hence, the steps of K-means clustering are generally consisted of two-stage clustering procedure. The first stage is to run hierarchical clusters to obtain the number of clusters and cluster centroids and second stage is to run nonhierarchical K-means clustering using the results of first stage. Here we provide automated K-means clustering procedure to be useful to obtain initial centroids of clusters which can also be useful for large data sets, and provide software program implemented using R.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.05a
• /
• pp.19-25
• /
• 2003

데이터베이스에 내재된 패턴이나 관계를 묘사한 것만으로도 의사결정에 필요한 정보를 제공할 수 있는데 이 데이터들의 변수들을 비슷한 특징을 가지는 소그룹으로 나누어 패턴을 찾는 것을 군집분석이라 한다. 이러한 군집 분석에는 분리군집방법과 계층적군집방법이 있는데, 재할당이 가능한 분리군집방법의 여러 알고리즘에 대해 비교해보자. 분리군집알고리즘에는 중심을 평균으로 하는 k-평균 알고리즘과, 중심을 메도이드로하는 PAM, CLARA, CLARANS 알고리즘이 있다. 이러한 알고리즘에 대한 이론과, 장단점을 설명하고, 분산과 중심들간의 평균 거리로 비교해 본다.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.1
• /
• pp.121-128
• /
• 2010

K-means clustering is an iterative algorithm in which items are moved among sets of clusters until the desired set is reached. K-means clustering has been widely used in many applications, such as market research, pattern analysis or recognition, image processing, etc. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using a center of gravity for grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.412-412
• /
• 2018

최근 지구온난화의 영향으로 겨울철 한파를 야기하는 일이 잦아지고 있다. 우리나라에도 그 영향으로 매년 겨울 한파가 지속되고 있다. 그러므로 겨울철 적설량을 기록하고 갑작스러운 재난에 대비하는 것은 지구온난화의 또 다른 숙제가 되었다. 우리나라는 전통적으로 폭설 피해가 크지 않았기 때문에 적설관측소의 수가 강우관측소에 비해 현저히 적다. 그리하여 추가적인 적설관측소의 설치가 필요하다고 판단되지만, 이에 앞서 우리나라의 현재 적설관측소의 분포현황을 분석하였다. 1월, 2월, 12월의 최대 최심신적설량과 관측소 고도자료를 K-평균 알고리즘의 4개의 변수로 사용하였으며, 전국에서 총 94개의 적설관측소를 자료보유기간으로 분류하여 군집분석을 수행하였다. 군집분석 결과 서해안지역, 태백 소백산맥을 따라 존재하는 내륙산악지역, 경상도와 남해안 그리고 제주도지역, 울릉도와 대관령으로 군집이 형성되었다. 또한, 제주도의 적설관측소가 해안가 위주로 설치되어있어, 비교적 눈이 많이 오는 한라산 산간지역에 추가적인 적설관측소 설치가 고려되어야 할 것이다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2001.11a
• /
• pp.175-178
• /
• 2001

다원분할표에서 범주들의 대응관계를 그래프적으로 보여주는 다중대응분석(multiple correspondence analysis)은 주결여성(principal inertia)이 총결여성(total inertia)에서 차지하는 비율이 전반적으로 낮아 설명력(goodness-of-fit)이 낮은 2차원의 대응분석그림을 얻게 된다. 이를 극복하기 위해 Benzecri의 공식을 사용하면 낮은 주결여성을 높이고 새로운 2차원 대응분석그림을 얻을 수 있다. 그러나 이 새로운 대응분석그림도 범주들의 대응관계를 명확히 보여주지는 못한다(Greenacre and Blasius, 1994, chapter 10). 앤드류 플롯(Andrews plot)을 이용하여 범주들의 군집화(clustering)로 다중대응분석을 재해석 하고자 하나 범주의 수가 많은 경우 해석상 어려움이 따른다. 본 소고에서 이와 같은 경우 K-평균 군집분석을 활용하여 다중대응분석의 해석을 용이하게 하고자 한다.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.2
• /
• pp.395-406
• /
• 2017

The purpose of this study is to identify the pattern of daily electricity demand through clustering and classification. The hourly data was collected by KPS (Korea Power Exchange) between 2008 and 2012. The time trend was eliminated for conducting the pattern of daily electricity demand because electricity demand data is times series data. We have considered k-means clustering, Gaussian mixture model clustering, and functional clustering in order to find the optimal clustering method. The classification analysis was conducted to understand the relationship between external factors, day of the week, holiday, and weather. Data was divided into training data and test data. Training data consisted of external factors and clustered number between 2008 and 2011. Test data was daily data of external factors in 2012. Decision tree, random forest, Support vector machine, and Naive Bayes were used. As a result, Gaussian model based clustering and random forest showed the best prediction performance when the number of cluster was 8.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.625-630
• /
• 2014

The amount of information is increasing rapidly with the development of the internet and the computer. Since these enormous information is managed by the document forms, it is necessary to search and process them efficiently. The document clustering technique which clusters the related documents through the similarity between the documents help to classify, search, and process the large amount of documents automatically. This paper proposes a method to find the initial seed points through principal component analysis when the documents represented by vectors in the feature vector space are clustered by K-means algorithm in order to increase clustering performance. The experiment shows that our method has a better performance than the traditional K-means algorithm.

• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.745-758
• /
• 2009

Cluster analysis is the automated search for groups of related observations in a data set. To group the observations into clusters many techniques has been proposed, and a variety measures aimed at validating the results of a cluster analysis have been suggested. In this paper, we compare complete linkage, Ward's method, K-means and model-based clustering and compute validity measures such as connectivity, Dunn Index and silhouette with simulated data from multivariate distributions. We also select a clustering algorithm and determine the number of clusters of Korean consumers based on Korean consumers' palatability scores for Hanwoo bull in BBQ cooking method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.4
• /
• pp.703-708
• /
• 2022

K-means clustering is a representative clustering technique. However, there is a limitation in not being able to integrate the performance evaluation scale and the method of determining the minimum number of clusters. In this paper, a method for numerically determining the minimum number of clusters is introduced. The explained variance is presented as an integrated measure. We propose that the k-means clustering method should be performed in the subspace of the PCA in order to simultaneously satisfy the minimum number of clusters and the threshold of the explained variance. It aims to present an explanation in principle why principal component analysis and k-means clustering are sequentially performed in pattern recognition and machine learning.

• Journal of The Korean Association For Science Education
• /
• v.25 no.3
• /
• pp.321-326
• /
• 2005

The purpose of this study was to identify distinctive achievement goal patterns of students and examine their influence on learning strategies (deep/surface) and science achievement. Cluster analysis procedure was performed to classify students on the basis of task, performance, and performance-avoidance goal scores. The results produced 3 clusters of students with different achievement goal patterns: high task goal (cluster 1), high task-high performance goal (cluster 2), and low task-low performance goal (cluster 3). One-way ANOVA results revealed that the scores of cluster 2 were significantly higher than those of clusters 1 and 3 in deep learning strategy. The science achievement test scores of clusters 1 and 2 were higher than those of cluster 3. Looking at surface learning strategy, however, the test scores of cluster 3 were significantly higher than those of clusters 1 and 2. The educational implications of these findings are discussed.