• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.468-471
• /
• 2004

In this paper, a method for classifying fingerprint ridge lines using runlength codes is proposed. To detect feature points(minutiae) in automatic fingerprint identification system(AFIS), classification of fingerprint ridge lines are essential process. The fingerprint ridge lines are classified by run-length coding, and also the end and bifurcation regions in ridge lines are separated. To evaluate the performance of the proposed method, detected feature regions including minutiae points and classified fingerprint ridge lines are shown.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.121-126
• /
• 2006

In this paper, we propose an approach to increase the power of clustering Web images by using high-level semantic features from text information relevant to Web images as well as low-level visual features of image itself. These high-level text features can be obtained from image URLs and file names, page titles, hyperlinks, and surrounding text. As a clustering engine, self-organizing map (SOM) proposed by Kohonen is used. In the SOM-based clustering using high-level text features and low-level visual features, the 200 images from 10 categories are divided in some suitable clusters effectively. For the evaluation of clustering powers, we propose simple but novel measures indicating the degrees of scattering images from the same category, and degrees of accumulation of the same category images. From the experiment results, we find that the high-level text features are more useful in SOM-based Web image clustering.

• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.321-327
• /
• 2014

Feature selection is the technique to improve the classification performance by using a minimal set by removing features that are not related with each other and characterized by redundancy. This study proposed new feature selection using the distance between the center of gravity of the bounded sum of weighted fuzzy membership functions (BSWFMs) provided by the neural network with weighted fuzzy membership functions (NEWFM) in order to improve the classification performance. The distance-based feature selection selects the minimum features by removing the worst features with the shortest distance between the center of gravity of BSWFMs from the 24 initial features one by one, and then 22 minimum features are selected with the highest performance result. The proposed methodology shows that sensitivity, specificity, and accuracy are 97.7%, 99.7%, and 98.7% with 22 minimum features, respectively.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.258-265
• /
• 2002

베이지안망은 기존의 방법에 비해 불확실한 상황에서도 지식을 표현하고 결론을 추론하는데 유용한 것으로 알려져 있다. 본 논문에서는 대표적인 베이지안망 분류기들을 제시하고, 동일 임상데이터에 대해 서로 다른 유형별 베이지안망 분류기들을 학습하였다. 베이지안망을 적용할 때 변수의 수가 많아짐에 따라 베이지안망의 구조를 학습하는데 탐색공간이 넓어져 어려움이 있다. 본 연구에서는 이런 탐색공간을 효율적으로 줄이기 위하여 클래스 노드의 Markov blanket에 속한 특징들로 집합을 축소하는 것을 제안하고, 실험을 통해 이 특징 축소방법이 베이지안망 분류기들의 성능을 높여 줄 수 있는지 알아보았다. 분류기들의 성능에서는 축소한 특징집합으로부터 얻은 베이지안망으로 확장한 나이브 베이지안망 분류기가 가장 우수한 정확도를 가짐을 실험을 통해 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.109-111
• /
• 2011

대부분의 빈발 부분그래프를 이용한 그래프 분류 알고리즘들은 빈발 부분그래프를 마이닝하여 개별적인 빈발 부분그래프의 포함 여부를 특징 벡터로 구성하는 단계와 기계학습 알고리즘들을 훈련시켜 분류 모델을 수립하는 단계로 구성된다. 이와 같은 그래프 분류 알고리즘들은 부분그래프의 개별적인 존재 여부만을 이용하여 특징을 구성하기 때문에 변별력이 떨어지는 문제점이 있다. 본 논문에서는 빈발 부분그래프들이 동시 발생하는 특징 벡터의 변별력을 반영할 수 있는 특징선택 기법을 적용한 모델 기반 탐색트리 기법을 제안한다. 동시 발생 부분그래프를 특징으로 사용하여 변별력을 향상시킬 수 있으며, 모델기반 탐색 트리를 사용하여 제안하는 기법이 기존의 방법보다 더 높은 그래프 분류 성능을 보이는 것을 입증하였다.

• Annual Conference of KIPS
• /
• 2002.11a
• /
• pp.351-354
• /
• 2002

최근 생명공학 기술과 분석화학 기술의 발달로 생물 유전 데이터를 대량으로 얻는 것이 가능하게 되었다. 아울러 이렇게 얻어진 데이터를 적절하게 처리하고 분석하는 방법들도 여러 가지가 소개되어 왔다. 본 논문에서는 DNA 마이크로어레이 정보를 분류하기 위하여 세 가지 데이터에 대하여 여러 가지 특징 전혀 방법으로 선택된 유전자들을 사용하여 신경망 분류기에 적용시켜 보았다. 실험 결과 백혈병 데이터의 경우 피어슨 상관계수를 이용한 분류가 97.1%로 가장 높은 인식률을 보여주었다. 한편 여러 가지 특징 선택 방법에 의하여 공통적으로 선택된 유전자를 사용하여 분류하면 더 높은 인식률이 나올 것 같았지만 실제로는 기대에 못 미치는 성과를 보여주었다. 따라서 무조건 여러 번 선택된 특징을 선택하기 보다는 특징들끼리의 상관관계를 고려하여 선택하는 방법이 필요할 것이다.

• Journal of Digital Convergence
• /
• v.19 no.12
• /
• pp.347-352
• /
• 2021

In this paper, we propose a method for finding feature subsets that are effective for classification in an input dataset by using a multi-agent reinforcement learning method. In the field of machine learning, it is crucial to find features suitable for classification. A dataset may have numerous features; while some features may be effective for classification or prediction, others may have little or rather negative effects on results. In machine learning problems, feature selection for increasing classification or prediction accuracy is a critical problem. To solve this problem, we proposed a feature selection method based on reinforced learning. Each feature has one agent, which determines whether the feature is selected. After obtaining corresponding rewards for each feature that is selected, but not by the agents, the Q-value of each agent is updated by comparing the rewards. The reward comparison of the two subsets helps agents determine whether their actions were right. These processes are performed as many times as the number of episodes, and finally, features are selected. As a result of applying this method to the Wisconsin Breast Cancer, Spambase, Musk, and Colon Cancer datasets, accuracy improvements of 0.0385, 0.0904, 0.1252 and 0.2055 were shown, respectively, and finally, classification accuracies of 0.9789, 0.9311, 0.9691 and 0.9474 were achieved, respectively. It was proved that our proposed method could properly select features that were effective for classification and increase classification accuracy.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.137-142
• /
• 2000

많은 정보를 포함하고 있는 영상 자료에서 빠른 검색과 분류를 위해서 색깔이나 질감 등의 특징을 나타내는 기술자가 필요하다. 또한 한 영상 안에서도 각 영역별로 다른 특징을 나타내고 있기 때문에 영역별 검색과 분류를 위한 영역 단위의 특징 추출이 중요하다. 본 논문에서는 색깔 특징으로 영역화된 영상의 각 영역에서 색깔 특징 벡터와 질감 특징 벡터를 추출하고 추출된 특징 벡터를 다른 영역에서 추출된 특징 벡터와의 거리를 이용하여 비슷한 특징을 보이는 영역을 검색한다. 기존의 전체 영상의 색깔이나 질감 어느 하나만을 이용한 검색과 달리 이러한 특징을 공간적 위치와 색깔, 질감을 조합하여 검색함으로써 보다 만족스러운 검색 결과를 얻을 수 있다.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.457-464
• /
• 2008

In the real-world operational environment, most of text classification systems have the problems of insufficient training documents and no prior knowledge of feature space. In this regard, $Na{\ddot{i}ve$ Bayes is known to be an appropriate algorithm of operational text classification since the classification model can be evolved easily by incrementally updating its pre-learned classification model and feature space. This paper proposes the improving technique of $Na{\ddot{i}ve$ Bayes classifier through feature weighting strategy. The basic idea is that parameter estimation of $Na{\ddot{i}ve$ Bayes considers the degree of feature importance as well as feature distribution. We can develop a more accurate classification model by incorporating feature weights into Naive Bayes learning algorithm, not performing a learning process with a reduced feature set. In addition, we have extended a conventional feature update algorithm for incremental feature weighting in a dynamic operational environment. To evaluate the proposed method, we perform the experiments using the various document collections, and show that the traditional $Na{\ddot{i}ve$ Bayes classifier can be significantly improved by the proposed technique.

• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.505-514
• /
• 2002

In this Paper, we propose a method of content-based image classification using neural network. The images for classification ate object images that can be divided into foreground and background. To deal with the object images efficiently, object region is extracted with a region segmentation technique in the preprocessing step. Features for the classification are texture and shape features extracted from wavelet transformed image. The neural network classifier is constructed with the extracted features and the back-propagation learning algorithm. Among the various texture features, the diagonal moment was more effective. A test with 300 training data and 300 test data composed of 10 images from each of 30 classes shows correct classification rates of 72.3% and 67%, respectively.