• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.569-573
• /
• 2008

패턴인식 문제를 다루는 연구에서 인식 성능을 향상시키고자 베이스 에러율의 상한인 조건부 엔트로피를 응용하는 시도가 있었다. 본 논문에서는 다수의 인식기로 구성된 다수 인식기 시스템이 우수한 성능을 보이도록 인식기의 집합을 결정하는 문제에서 이러한 조건부 엔트로피의 최소화를 통하여 시도한 방법과 다른 방법들을 간단하고 분명한 예제를 통하여 비교, 분석해 보았다. 다수 인식기의 결합 방법으로 대표적인 투표 기법과 조건부 독립 가정의 베이지안 기법을 사용하였으며, 조건부 엔트로피의 최소화를 통하여 인식기의 집합을 결정하는 방법에 대한 유용성을 확인할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.485-489
• /
• 2007

Gaussian process classifiers (GPCs) are fully statistical kernel classification models which have a latent function with Gaussian process prior Recently, EP approximation method has been proposed to infer the posterior over the latent function. It can have a special hyperparameter which can treat outliers potentially. In this paper, we propose the outlier robust algorithm which alternates EP and the hyperparameter updating until convergence. We also show its usefulness with the simulation results.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.3
• /
• pp.171-184
• /
• 2000

We may be given a set of observations with the classes or clusters. The aim of this article is to provide an up-to-date review of different approaches to classification, compare their performance on a wide range of challenging data-sets. In this paper, machine learning algorithm classifiers based on CART, C4.5, CAL5, FACT, QUEST and statistical discriminant analysis are compared on various datasets in classification error rate and algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.645-651
• /
• 2002

we propose a k-nearest neighbors(k-NN) based pattern selection method. The method tries to select the patterns that are near the decision boundary and that are correctly labeled. The simulations over synthetic data sets showed promising results: (1) By converting a non-separable problem to a separable one, the search for an optimal error tolerance parameter became unnecessary. (2) SVM training time decreased by two orders of magnitude without any loss of accuracy. (3) The redundant SVM were substantially reduced.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1219-1231
• /
• 2008

The main object of this paper is to develop a leave-one-out(LOO) bound of all pairwise comparison error correcting output codes (APC-ECOC). To avoid using classifiers whose corresponding target values are 0 in APC-ECOC and requiring pilot estimates we developed a bound based on mean misclassification probability(MMP). It can be used to tune kernel hyperparameters. Our empirical experiment using kernel mean squared estimate(KMSE) as the binary classifier indicates that the bound leads to good estimates of kernel hyperparameters.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.370-376
• /
• 2010

Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.905-912
• /
• 2006

Support vector classification(SVC) provides more complete description of the linear and nonlinear relationships between input vectors and classifiers. In this paper we propose to solve the optimization problem of SVC with a modified hinge loss function, which enables to use an iterative reweighted least squares(IRWLS) procedure. We also introduce the approximate cross validation function to select the hyperparameters which affect the performance of SVC. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.405-408
• /
• 2002

Microarray 기술의 발전으로 많은 양의 유전자 정보를 얻게 되어 암의 정확한 분류와 진단에 대한 기대가 커지고 있다. 암을 정확하게 분류하기 위해서는 추출된 유전자에 많은 잡음이 들어가기 때문에 암과 관련이 있는 유전자만을 추출할 필요가 있다. 본 논문에서는 여러 가지 유전자 추출방법과 다양한 분류기의 성능을 체계적으로 평가하기 위하여, 세 가지 벤치마크 암 데이터에 대하여 실험하여 보았다. 또한 분류 성능을 향상시키기 위하여 분류기를 적절하게 결합한 결과, 결합된 분류기의 성능을 확인해볼 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.423-431
• /
• 1997

A new decision tree generator MEC is proposed in this paper, which uses the difference of multi-base entropy as a consistent criterion for discretization and selection of attributes. To evaluate the performance of the proposed generator, it is compared to other generators which use criteria based on entropy and adopt different discretization styles. As an experimental result, it is shown that the proposed generator produces the most efficient classifiers, which have the least number of leaves at the same error rate, regardless of whether attribute values constituting the training set are discrete or continuous.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.3
• /
• pp.120-124
• /
• 2021

Recently, human attribute recognition (HAR) attracts a lot of attention due to its wide application in video surveillance systems. Recent deep-learning-based solutions for HAR require time-consuming training processes. In this paper, we propose a post-processing technique that utilizes the historical video frames to improve prediction results without invoking re-training or modifying existing deep-learning-based classifiers. Experiment results on a large-scale benchmark dataset show the effectiveness of our proposed method.