• 한국정보통신학회논문지
• /
• 제19권1호
• /
• pp.35-40
• /
• 2015

본 논문은 유전 알고리즘 기반 귀납적 학습 환경 하에서 메타 학습법을 이용한 다중 분류기 시스템의 구축에 관한 것이다. 메타 학습법을 이용한 다중 분류기 시스템의 구축에서 분류기는 일반 분류기와 메타 분류기로 구성된다. 메타 분류기는 사례에 대한 일반 분류기의 분류 결과에 학습 알고리즘을 적용하여 얻어진다. 분류시스템의 의사 결정과정에서 메타 분류기의 역할은 일반 분류기의 분류 결과를 평가하여 최종 의사 결정 과정에의 참여 여부를 결정하는 것이다. 분류 시스템은 분류기의 분류 결과가 옳은 것으로 평가된 결과들만 취합하여 이를 바탕으로 최종 분류 결과를 도출해 낸다. 메타 학습법이 다중 분류기 시스템의 성능에 미치는 영향을 다수의 사례 집합을 이용하여 평가하였다.

• 한국지능시스템학회논문지
• /
• 제21권4호
• /
• pp.487-492
• /
• 2011

본 논문에서는 가장 단순한 구조를 가진 Nearest Prototype Classifier의 성능 개선을 위해 차분 진화 알고리즘을 적용하여 prototype의 위치를 결정하는 방법을 제안하였다. 차분 진화 알고리즘을 이용하여 prototype의 위치 벡터가 결정이 되며, 차분 진화 알고리즘에 의해 결정된 prototype의 class label을 결정하기 위한 class label 결정 알고리즘도 제안하였다. 제안된 알고리즘의 성능 평가를 위해 기존의 패턴 분류기와 비교 결과를 보인다.

• 한국지능시스템학회논문지
• /
• 제23권2호
• /
• pp.166-171
• /
• 2013

The method proposed in this paper can improve the performance of the Boosting algorithm in machine learning. The proposed Boundary AdaBoost algorithm can make up for the weak points of Normal binary classifier using threshold boundary concepts. The new proposed boundary can be located near the threshold of the binary classifier. The proposed algorithm improves classification in areas where Normal binary classifier is weak. Thus, the optimal boundary final classifier can decrease error rates classified with more reasonable features. Finally, this paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Boundary AdaBoost in a simulation experiment of pedestrian detection using 10-fold cross validation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.361-367
• /
• 1998

The main two applications of the Genetic Algorithms(GA) are the optimization and the machine learning. Machine Learning has two objectives that make the complex system learn its environment and produce the proper output of a system. The machine learning using the Genetic Algorithms is called GA machine learning or genetic-based machine learning (GBML). The machine learning is different from the optimization problems in finding the rule set. In optimization problems, the population of GA should converge into the best individual because optimization problems, the population of GA should converge into the best individual because their objective is the production of the individual near the optimal solution. On the contrary, the machine learning systems need to find the set of cooperative rules. There are two methods in GBML, Michigan method and Pittsburgh method. The former is that each rule is expressed with a string, the latter is that the set of rules is coded into a string. Th classifier system of Holland is the representative model of the Michigan method. The classifier systems arrange the strength of classifiers of classifier list using the message list. In this method, the real time process and on-line learning is possible because a set of rule is adjusted on-line. A classifier system has three major components: Performance system, apportionment of credit system, rule discovery system. In this paper, we solve the food search problem with the learning and evolution of an artificial ant using the learning classifier system.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.233-236
• /
• 2001

In this paper, we propose a TSK-type fuzzy classifier using PCA(Principal Component Analysis), FCM(Fuzzy C-Means) clustering and hybrid GA(genetic algorithm). First, input data is transformed to reduce correlation among the data components by PCA. FCM clustering is applied to obtain a initial TSK-type fuzzy classifier. Parameter identification is performed by AGA(Adaptive Genetic Algorithm) and RLSE(Recursive Least Square Estimate). we applied the proposed method to Iris data classification problems and obtained a better performance than previous works.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.609-615
• /
• 1998

In this paper, we propose efficient total recognition system of handwritten and printed numerals for enhancing the classification time. The proposed system consist two step neuroclassifier: Printed numerals classifier and Handwritten numerals classifier. The performance of the propose classifier was tested on 5000 handwritten numerals database of NIST and 100 printed numerals database. In case of handwritten classifier, the overall classification times were 11 second. And in case of proposed system, the overall classification times were reduced by...

• Asia pacific journal of information systems
• /
• 제29권4호
• /
• pp.789-816
• /
• 2019

Text classification is a challenging task, especially when dealing with a huge amount of text data. The performance of a classification model can be varied depending on what type of words contained in the document corpus and what type of features generated for classification. Aside from proposing a new modified version of the existing algorithm or creating a new algorithm, we attempt to modify the use of data. The classifier performance is usually affected by the quality of learning data as the classifier is built based on these training data. We assume that the data from different domains might have different characteristics of noise, which can be utilized in the process of learning the classifier. Therefore, we attempt to enhance the robustness of the classifier by injecting the heterogeneous data artificially into the learning process in order to improve the classification accuracy. Semi-supervised approach was applied for utilizing the heterogeneous data in the process of learning the document classifier. However, the performance of document classifier might be degraded by the unlabeled data. Therefore, we further proposed an algorithm to extract only the documents that contribute to the accuracy improvement of the classifier.

• 제어로봇시스템학회논문지
• /
• 제15권5호
• /
• pp.457-464
• /
• 2009

The weak classifier of AdaBoost algorithm is a central classification element that uses a single criterion separating positive and negative learning candidates. Finding the best criterion to separate two feature distributions influences learning capacity of the algorithm. A common way to classify the distributions is to use the mean value of the features. However, positive and negative distributions of Haar-like feature as an image descriptor are hard to classify by a single threshold. The poor classification ability of the single threshold also increases the number of boosting operations, and finally results in a poor classifier. This paper proposes a weak classifier that uses multiple criterions by adding a probabilistic criterion of the positive candidate distribution with the conventional mean classifier: the positive distribution has low variation and the values are closer to the mean while the negative distribution has large variation and values are widely spread. The difference in the variance for the positive and negative distributions is used as an additional criterion. In the learning procedure, we use a new classifier that provides a better classifier between them by selective switching between the mean and standard deviation. We call this new type of combined classifier the "Mixed Weak Classifier". The proposed weak classifier is more robust than the mean classifier alone and decreases the number of boosting operations to be converged.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.828-835
• /
• 2008

We present a novel method for eye location by means of a two-level classifier scheme. Locating the eye by machine-inspection of an image or video is an important problem for Computer Vision and is of particular value to applications in biomedical imaging. Our method aims to overcome the significant challenge of an eye-location that is able to maintain high accuracy by disregarding highly variable changes in the environment. A first level of computational analysis processes this image context. This is followed by object detection by means of a two-class discrimination classifier(second algorithmic level).We have tested our eye location system using FERET and BioID database. We compare the performance of two-level classifier with that of non-level classifier, and found it's better performance.

• 한국산업정보학회논문지
• /
• 제9권4호
• /
• pp.16-25
• /
• 2004

분류시스템은 현재의 유용한 규칙들로부터 새로운 규칙들을 만들어 가기 위해 학습하는 규칙 기반 시스템이다. 본 논문에서는 방대한 데이터베이스에서 유용한 정보를 얻는 분류시스템의 분류 규칙 발견을 위한 유전자 알고리즘 을 제안하였다. 제안된 방법을 자동차 보험문제에 적용하여 제안된 유전자 알고리즘 기반 분류시스템의 성능을 평가하였다.