• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.183-187
• /
• 2005

In this paper, we propose a heuristic method to select features using a Two-Phase Markov Blanket-based (TPMB) algorithm. The first phase, filtering phase, of TPMB algorithm works by filtering the obviously redundant features. A non-linear correlation method based on Information theory is used as a metric to measure the redundancy of a feature [1]. In second phase, approximating phase, the Markov Blanket (MB) of a system is estimated by employing the concept of cross entropy to identify the MB. We perform experiments on microarray data and report two popular dataset, AML-ALL [3] and colon tumor [4], in this paper. The experimental results show that the TPMB algorithm can significantly reduce the number of features while maintaining the accuracy of the classifiers.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.23-28
• /
• 2005

The high-dimensionality and insufficiency of gene expression profiles and proteomic profiles makes feature selection become a critical step in efficiently building accurate models for cancer problems based on such data sets. In this paper, we use a method, called Discrete Function Learning algorithm, to find discriminatory feature vectors based on information theory. The target feature vectors contain all or most information (in terms of entropy) of the class attribute. Two data sets are selected to validate our approach, one leukemia subtype gene expression data set and one ovarian cancer proteomic data set. The experimental results show that the our method generalizes well when applied to these insufficient and high-dimensional data sets. Furthermore, the obtained classifiers are highly understandable and accurate.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.25-30
• /
• 2009

패턴 인식에서 분류기 모형으로 많이 사용되는 퍼지 가중치 평균 분류기는 가중치를 적절히 설정함으로써 뛰어난 분류 성능을 얻을 수 있다는 장점이 있다. 그러나 일반적으로 가중치는 인식 문제 분야의 특성이나 해당 전문가의 지식이나 주관적 경험을 기반으로 설정되므로 설정된 가중치의 일관성과 객관성을 보장하기가 어려운 문제점을 갖고 있다. 따라서 이 논문에서는 퍼지 가중치 평균 분류기의 가중치를 설정하기 위한 객관적 기준을 제시하기 위하여 특징값들 간의 통계적 정보를 이용한 가중치 설정 기법들을 제안하였다. 제안한 기법들을 이용하여 UCI machine learning repository 사이트에서 제공되는 표준 데이터들 중의 하나인 Iris 데이터 세트를 이용하여 실험하고 그 결과를 비교, 분석하였다.

• Phonetics and Speech Sciences
• /
• v.3 no.2
• /
• pp.71-78
• /
• 2011

In this paper, we propose an approach which constructs classifier ensembles of various channel compensation and feature enhancement methods. CMN and CMVN are used as channel compensation methods. PCA, kernel PCA, greedy kernel PCA, and kernel multimodal discriminant analysis are used as feature enhancement methods. The proposed ensemble system is constructed with the combination of 15 classifiers which include three channel compensation methods (including 'without compensation') and five feature enhancement methods (including 'without enhancement'). Experimental results show that the proposed ensemble system gives highest average speaker identification rate in various environments (channels, noises, and sessions).

• Journal of Engineering Education Research
• /
• v.14 no.2
• /
• pp.30-39
• /
• 2011

There is a problem that some spoken words are not consistent with the written words when Arabic numerals in Korean language are read. Since some rules for reading the Arabic numerals are not clear, the numerals should be read carefully by recognizing the position of the numbers in sentence, the relationship of the numerals with measurement nouns and other writing elements, and context. In view of technical writing, this work is to appreciate some rules for writing Korean numerals in place of Arabic numerals by studying the works regarding numerals, classifiers and measurement nouns.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.334-336
• /
• 2003

얼굴인식 연구는 얼굴표현에 집중하여 연구가 이루어져 왔으며, 이에 따라 최종 인식단계에서는 간단한 분류기가 적용되었다. 그러나, 보다 강건한 분류 성능을 얻기 위해서는 복잡한 분류기를 도입할 필요성이 있다. 복잡한 분류기를 사용하면서, 얼굴인식의 특성상 온라인 학습을 가능하게 하기 위해서는 이진 분류기 분해/결합 방법을 도입한다. 이러한 기법으로는 OPC와 PWC가 대표적이다. 본 방법의 성능은 기본이진 분류기의 성능에 좌우되기 때문에 SVM을 적용한다. 본 논문에서는 대표적인 방법인 OPC와 PWC의 장단점을 설명하고, 거절 조건을 갖는 이들 분류기들의 순차 결합 방법을 제안한다. ORL얼굴데이터 베이스에 대한 실험에서는, 제안하는 방법을 통해 얼굴인식 성능을 향상시킬 수 있음을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.40-44
• /
• 2005

Applying artificial intelligence, machine learning and data mining techniques to intrusion detection system are increasing. But most of researches are focused on improving the performance of classifier. These classifiers are performed by batch way and it is not proper method for realtime intrusion detection system. We propose an incremental feature extraction and classification technique for realtime intrusion detection system. Applying proposed system to KDD CUP 99 data, experimental result shows that it has similar capability compared to batch way intrusion detection system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.3
• /
• pp.255-263
• /
• 2006

In the last decade, face analysis, e.g. face detection, face recognition, facial expression recognition, is a very lively and expanding research field. As computer animated agents and robots bring a social dimension to human computer interaction, interest in this research field is increasing rapidly. In this paper, we introduce an artificial emotion mimic system which can recognize human facial expressions and also generate the recognized facial expression. In order to recognize human facial expression in real-time, we propose a facial expression classification method that is performed by weak classifiers obtained by using new rectangular feature types. In addition, we make the artificial facial expression using the developed robotic system based on biological observation. Finally, experimental results of facial expression recognition and generation are shown for the validity of our robotic system.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2002.05a
• /
• pp.545-550
• /
• 2002

Concrete is one of the essential structural materials in the construction. But, concrete consists of many materials and is affected by many factors such as properties of materials, site environmental situations, and skill of constructor. Therefore, concrete mixes depend on experiences of experts. However, it is more and more difficult to determine concrete mixes design by empirical means because more ingredients like mineral and chemical admixtures are included. Artificial Neural Networks(ANN) are a mimic models of human brain to solve a complex nonlinear problem. They are powerful pattern recognizers and classifiers, also their computing abilities have been proven in the fields of prediction, estimation and pattern recognition. Here, among them, the back propagation network and radial basis function network are used. Compositions of high-performance concrete mixes are eight components(water, cement, fine aggregate, coarse aggregate, fly ash, silica fume, superplasticizer and air-entrainer). Compressive strength and slump are measured. The results show that neural networks are proper tools to minimize the uncertainties of the design of concrete mixtures.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1281-1288
• /
• 2015

Nongroup Cellular Automata(CA) having two trees in the state transition diagram of a CA is suitable for pattern classifier which divides pattern set into two classes. Maji et al. [1] classified patterns by using multiple attractor cellular automata as a pattern classifier with dependency vector. In this paper we propose a method of generation of a pattern classifier using feature vector which is the extension of dependency vector. In addition, we propose methods for finding nonreachable states in the 0-tree of the state transition diagram of TPMACA corresponding to the given feature vector for the analysis of the state transition behavior of the generated pattern classifier.