• Communications for Statistical Applications and Methods
• /
• v.18 no.3
• /
• pp.391-401
• /
• 2011

Consider a cluster, so called a 'son cluster', whose mean and variance is composed of the means and variances of both clusters called as a 'father cluster' and a 'mother cluster'. In this paper, a method for identifying each of three clusters is provided by modeling the relationship with father and mother clusters. Under the normal mixture model, the parameters are estimated via EM algorithm. We were able to overcome the problems of estimation using ECM approximation. Numerical examples show that our method can effectively identify the three clusters, so called a 'family of clusters'.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.73-82
• /
• 2005

This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1236-1243
• /
• 2017

In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.77-80
• /
• 2002

이상치를 포함한 학습 데이터의 군집화 전략은 일반적으로 이상치를 포함하여 학습하거나, 이상치를 제거하는 두 가지 선택이 가능하다. 이상치를 제거하지 않고 학습에 반영시켜야 할 경우 한 개 또는 소수의 이상치가 독자적인 군집을 형성하거나 객관적인 군집화를 방해하는 문제가 발생할 수 있다. 이 때 주어진 학습 데이터의 군집 결과가 이상치의 영향으로부터 벗어나기 위해 원래의 학습 데이터에 대한 변환 작업을 거친 후 군집화를 수행할 수 있다. 이러한 변환 방법으로서 본 논문에서는 차원 축소의 기법으로 알려진 인자 분석의 점수를 사용하였다. 인자 점수로 변환된 학습 데이터에 대해 계층적 군집화, K-means 그리고 자기조직화 지도 등과 같은 군집화 알고리즘을 적용하면 이상치가 자신만의 군집을 별도로 형성하지 않고 다른 학습 데이터의 군집에 소속되면서 이상회의 영향으로부터 벗어남을 실험을 통하여 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.853-856
• /
• 2008

최근 모바일 기기 사용자의 수가 증가함에 따라 모바일 기기 사용자의 위치정보를 관리하기 위한 기법들이 활발히 연구되고 있다. 기존의 모바일 시스템에서 위치정보를 관리하기 위한 방법으로 two-tier 방식과 two-tier 방식을 개선한 구조적 기법이 제시되었다. 구조적 기법에서는 어떻게 위치 데이터베이스를 군집화시키는 것이 매우 중요하다. 왜냐하면 데이터베이스를 군집하는 방법에 따라 업데이트 비용의 차이가 크기 때문이다. 구조적 기법을 위한 이전 연구는 set-cover 알고리즘을 기반한 bottom-up 방식의 시스템 이다. 본 논문에서는 구조적 기법의 데이터베이스 군집화를 위해 K-means clustering 알고리즘을 기반한 top-down 방식의 시스템을 사용하였고, 실험을 통해 본 논문에서 제시된 방식의 시스템이 기존 방식의 시스템보다 데이터베이스 업데이트측면에서 13.67%의 성능이 향상되었음을 보였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.29-30
• /
• 2019

본 논문에서는 다중 컨트롤러가 존재하는 분산 SDN 환경에서 과도한 제어 메시지로 인한 과부하된 컨트롤러의 부하를 줄이기 위하여 이주할 스위치를 K-means 군집화와 Harmony Search(HS)를 기반으로 선정 하는 기법을 제안하였다. 기존에 HS를 이용하여 이주할 스위치를 선택하는 기법이 제시되었으나, 시간 소모에 비하여 정확도가 부족한 단점이 있다. 또한 Harmony Memory(HM) 구축을 위해 메모리 소모 또한 크다. 이를 해결하기 위하여 본 논문에서는 유클리드 거리를 기반으로 하는 K-means 군집화를 이용하여 이주할 스위치를 골라내어 HM의 크기를 줄이고 이주 효율을 향상 시킨다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.124-130
• /
• 2023

In this paper, we intend to improve the network lifetime by improving the energy efficiency of sensor nodes in a wireless sensor network by utilizing machine learning using K-means clustering algorithm. A wireless sensor network is a wireless network composed of physical devices including batteries as physical sensors. Due to the characteristics of sensor nodes, all resources must be efficiently used to minimize energy consumption to maximize network lifetime. A cluster based approach is used to manage groups of relatively large numbers of nodes. In the proposed protocol, by improving the existing LEACH algorithm, we propose a clustering algorithm that selects a cluster head using a cluster based approach and a location based approach. The performance results to be improved were measured using Matlab simulation. Through the experimental results, K-means clustering was applied to the energy efficiency part. By utilizing K-means, it is confirmed that energy efficiency is improved and the lifetime of the entire network is extended.

• The Korean Journal of Applied Statistics
• /
• v.19 no.2
• /
• pp.271-282
• /
• 2006

The aim of this study is to propose a tree-structured clustering for mixed data. We suggest a scaling method to reduce the variable selection bias among categorical variables. In numerical examples such as credit data, German credit data, we note several differences between tree-structured clustering and K-means clustering.

• Smart Media Journal
• /
• v.9 no.3
• /
• pp.122-129
• /
• 2020

The possibility that an asymptotic coronavirus-19 infected person around the world is not aware of his infection and can spread it to people around him is still a very important issue in that the public is not free from anxiety and fear over the spread of the epidemic. In this paper, the K-means clustering algorithm and deep learning-based crowd aggregation were proposed to determine the possibility of contact with confirmed cases of infectious diseases. As a result of 300 iterations of all input learning images, the PSNR value was 21.51, and the final MAE value for the entire data set was 67.984. This means the average absolute error between observations and the average absolute error of fewer than 4,000 people in each CCTV scene, including the calculation of the distance and infection rate from the confirmed patient and the surrounding persons, the net group of potential patient movements, and the prediction of the infection rate.

• Journal of Advanced Navigation Technology
• /
• v.25 no.1
• /
• pp.8-16
• /
• 2021

In this paper, locations of vertiports were selected and evaluated to operate urban air mobility (UAM) in the Seoul metropolitan area. Demand data were analyzed using the data from the survey of commuting population and were marked on a map using MATLAB. To cluster the data, the K-means algorithm function built in MATLAB was used to identify the center of the cluster to as the location of vertiports, and using the silhouette technique, the accuracy and reliability of the clustering were evaluated. The locations of the selected vertiports were also identified using satellite maps to ensure that the locations of the selected vertiports were suitable for the actual vertiport location, and, if the location was not appropriate, final vertiports were selected through the repositioning process.