• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.661-666
• /
• 2003

In this paper, the conventional k-modes and fuzzy k-modes algorithms for clustering categorical data is extended by representing the clusters of categorical data with fuzzy centroids instead of the hard-type centroids used in the original algorithm. The hard-type centroids of the traditional algorithms had difficulties in dealing with ambiguous boundary data, which might be misclassified and lead to thelocal optima. Use of fuzzy centroids makes it possible to fully exploit the power of fuzzy sets in representing the uncertainty in the classification of categorical data. The distance measure between data and fuzzy centroids is more precise and effective than those of the k-modes and fuzzy k-modes. To test the proposed approach, the proposed algorithm and two conventional algorithms were used to cluster three categorical data sets. The proposed method was found to give markedly better clustering results.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.8-19
• /
• 2004

In this paper, we propose an efficient method for locating destination address block on both of machine-Printed and handwritten Korean mail piece images. The proposed method extracts connected components from the binary mail piece image, generates text lines by merging them, and then groups the text fines into nine clusters. The destination address block is determined by selecting some clusters. Considering the geometric characteristics of address information on Korean mail piece, we split a mail piece image into nine areas with an equal size. The nine clusters are initialized with the center coordinate of each area. A modified Manhattan distance function is used to compute the distance between text lines and clusters. We modified the distance function on which the aspect ratio of mail piece could be reflected. The experiment done with live Korean mail piece images has demonstrated the superiority of the Proposed method. The success rate for 1, 988 testing images was about 93.56%.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.5
• /
• pp.155-164
• /
• 2024

This study proposes an unsupervised learning-based clustering model to estimate the ESG ratings of domestic public institutions. To achieve this, the optimal number of clusters was determined by comparing spectral clustering and k-means clustering. These results are guaranteed by calculating the Davies-Bouldin Index (DBI), a model performance index. The DBI values were 0.734 for spectral clustering and 1.715 for k-means clustering, indicating lower values showed better performance. Thus, the superiority of spectral clustering was confirmed. Furthermore, T-test and ANOVA were used to reveal statistically significant differences between ESG non-financial data, and correlation coefficients were used to confirm the relationships between ESG indicators. Based on these results, this study suggests the possibility of estimating the ESG performance ranking of each public institution without existing ESG ratings. This is achieved by calculating the optimal number of clusters, and then determining the sum of averages of the ESG data within each cluster. Therefore, the proposed model can be employed to evaluate the ESG ratings of various domestic public institutions, and it is expected to be useful in domestic sustainable management practice and performance management.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.4
• /
• pp.885-894
• /
• 2015

It is necessary to forecast the electricity demand for reliable and effective operation of the power system. In this study, we try to categorize a functional data, the mean curve in accordance with the time of daily power demand pattern. The data were collected between January 1, 2009 and December 31, 2011. And it were converted to time series data consisting of seasonal components and error component through log transformation and removing trend. Functional clustering by Ma et al. (2006) are applied and parameters are estimated using EM algorithm and generalized cross validation. The number of clusters is determined by classifying holidays or weekdays. Monday, weekday (Tuesday to Friday), Saturday, Sunday or holiday and season are described the mean curve of daily power demand pattern.

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

최근 이상기후로 인한 국부적인 혹은 광역적인 가뭄이 빈번하게 발생하고 있는 추세이며 발생횟수 뿐 아니라 가뭄 심도 및 지속기간이 과거보다 크게 증가하여 그에 따른 피해가 커질 것으로 예측되고 있다. 특히, 2014~2015년도의 유례없는 가뭄으로 인해 저수지 용수공급이 제한되면서 많은 농가들이 피해를 입었다. 본 연구의 목적은 전국 농업용 저수지를 대상으로 기상청 3개월 예보자료를 활용 할 수 있는 농업용 저수지 저수율 다중선형 회귀 모형을 개발하여 저수율 전망정보를 생산하는 것이다. 본 연구에서는 전국에 적용 가능한 저수율 다중선형 회귀 모형개발을 위해 5개의 기상요소(강수량, 최고기온, 최저기온, 평균기온, 평균풍속)와 관측 저수지 저수율을 활용했다. 기상자료는 2002년부터 2017년까지의 기상청 63개 지상관측소로부터 기상관측자료를 수집하였다. 본 연구에서는 저수율 전망 단계를 세 단계로 나누었다. 첫 번째 단계로 농어촌공사에서 전국 511개 용수구역을 대상으로 군집분석 및 의사결정나무 분석을 통해 제시한 65개 대표저수지를 대상으로 기상자료 및 관측 저수율 자료를 이용하여 다중선형 회귀분석을 실시하였다. 수집한 기상요소와 저수율을 독립변수로 하여 월별 회귀식을 산정한 결과 결정계수($R^2$)는 0.51~0.95로 나타났다. 두 번째 단계로 대표저수지의 회귀분석 결과를 전국의 저수지로 확대하기 위해 나이브 베이즈 분류법을 적용하여 전국 3098개의 저수지를 65의 군집으로 분류하고 각각의 군집에 해당되는 월별 회귀식을 산정하였다. 마지막으로 전국 저수지로 산정된 회귀식과 농업 가뭄 예측을 위해 기상청의 GS5(Global Seasonal Forecasting System 5) 3개월 예보자료를 수집하여 회귀식에 적용해 2017년 전국 저수지의 3개월 저수율 전망정보를 생산하였다. 본 연구의 전국 저수지 군집결과 기반의 저수율 전망기술은 2017년도 관측 저수율과 비교한 결과 유의한 상관성을 나타냈으며 이 결과는 추후 농업용 저수지의 물 공급 및 농업가뭄 전망 자료로서 이용이 가능할 것으로 판단된다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.404-404
• /
• 2017

이상기후현상으로 인해 극치 수문 사상들이 빈번히 발생함에 따라 상대적으로 높은 재현기간에 해당하는 극치 수문 사상해석에 대한 관심이 높아지고 있다. 그러나 우리나라의 경우 이러한 극치 수문 사상을 추정하기 위한 표본의 수가 부족한 실정이다. 지역빈도해석은 지점의 표본 수가 적거나 수문자료의 수집이 불가능한 미계측지점인 경우, 해당 지점과 수문학적으로 동질하다고 여겨지는 주변 지점들의 자료를 확보하여 확률수문량을 추정함으로써 상대적으로 지점빈도해석 보다 roubst한 추정값을 얻을 수 있다는 장점을 가지고 있다. 따라서 최근 확률수문량 산정 기법으로 지역빈도해석 방법에 관한 관심이 높아지고 있다. 지역구분은 지역빈도해석이 지점빈도해석과 구분될 수 있는 큰 특징이고 지역구분 결과 따라 지역의 표본 크기가 결정되기 때문에 수문학적으로 동질한 지역을 나누는 방법은 매우 중요하다고 볼 수 있다. 인공신경망은 인간의 뇌가 학습하는 방식을 모사한 통계적 모델링 기법이다. 즉, 인간의 뇌가 일정한 반복 학습을 통해 어떠한 문제의 해법을 추론하거나 예측, 또는 패턴을 인식하는 일련의 과정을 알고리즘화 하여 목적함수의 해를 찾는 방식이다. 특히, 주어진 자료들로 부터 특징을 추출하고 그 특징을 학습하여 전체 자료의 분류나 군집화를 이루는데 널리 이용되고 있다. 본 연구에서는 낙동강유역을 대상으로 인공신경망을 이용한 군집분석을 수행하고 구분된 지역을 이용하여 지역빈도해석을 수행하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.996-1003
• /
• 2022

In this paper, we present a new method for determining the scan line and range for vision-based 1-D barcode recognition. This is a study on how to detect valid barcode representative points and directions by applying the DBSCAN clustering method based on block HOG (histogram of gradient) and determine scan lines and barcode crosslines based on this. In this paper, the minimum and maximum search techniques were applied to determine the cross-line range of barcodes based on the obtained scan lines. This can be applied regardless of the barcode size. This technique enables barcode recognition even by detecting only a partial area of the barcode, and does not require rotation to read the code after detecting the barcode area. In addition, it is possible to detect barcodes of various sizes. Various experimental results are presented to evaluate the performance of the proposed technique in this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.224-229
• /
• 2009

When swarm robots exist in the same workspace, first we have to decide robots in order to accomplish some tasks. There have been a lot of works that research how to control robots in cooperation. The interest in using swarm robot systems is due to their unique characteristics such as increasing the adaptability and the flexibility of mission execution. When an invader is discovered, swarm robots have to enclose a invader through a variety of path, expecting invader's move, in order to effective enclose. In this paper, we propose an effective swarm robots enclosing and distributed moving algorithm in a two dimensional map.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.72-79
• /
• 2009

This paper describes the performance evaluation of NHD(nonhomogeneity detector) for STAP(space-time adaptive processing) airborne radar according to various normalization methods in the nonhomogeneous clutter environment. In practice, the clutter can be characterized as random variation signals, because it sometimes includes signals with very large magnitude like impulsive signal due to the system environment. The received interference signals are composed of homogeneous and nonhomogeneous data. In this situation, NHB is needed to maintain the STAP performance. The normalization using the NHD result is an effective method for removing the nonhomogeneous data. The optimum normalization can be performed by a representative value considered with a characteristic of the given data, so we propose the K-means clustering algorithm. The characteristic of random variation data due to nonhomogeneous clutters can be considered by the number of clusters, and then the representative value for selecting the homogeneous data is determined in the clustering result. In order to reflect a characteristic of the nonstationary interference data, we also investigate the algorithm for a calculation of the proper number of clusters. Through our simulations, we verified that the K-means clustering algorithm has very superior normalization and target detection performances compared with the previous introduced normalization methods.

• Smart Media Journal
• /
• v.9 no.4
• /
• pp.126-133
• /
• 2020

The treatment policy and prognosis are determined based on the final stage of lung cancer patients. The final stage of lung cancer patients is determined based on the T, N, and M stage classification table provided by the American Cancer Society (AJCC). However, the final stage of AJCC has limitations in its use for various fields such as patient treatment, prognosis and survival days prediction. In this paper, clustering algorithm which is one of non-supervised learning algorithms was assessed in order to check whether using only T, N, M stages with a data science method is effective for classifying the group of patients in the aspect of survival days. The final stage groups and T, N, M stage clustering groups of lung cancer patients were compared by using the cox proportional hazard model. It is confirmed that the accuracy of prediction of survival days with only T, N, M stages becomes higher than the accuracy with the final stages of patients. Especially, the accuracy of prediction of survival days with clustering of T, N, M stages improves when more or less clusters are analyzed than the seven clusters which is same to the number of final stage of AJCC.