• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.355-359
• /
• 2014

In this paper, we proposed the new fuzzy pattern classifier which combines several fuzzy models with simple consequent parts hierarchically. The basic component of the proposed fuzzy pattern classifier with hierarchical structure is a fuzzy model with simple consequent part so that the complexity of the proposed fuzzy pattern classifier is not high. In order to analyze and divide the input space, we use Fuzzy C-Means clustering algorithm. In addition, we exploit Conditional Fuzzy C-Means clustering algorithm to analyze the sub space which is divided by Fuzzy C-Means clustering algorithm. At each clustered region, we apply a fuzzy model with simple consequent part and build the fuzzy pattern classifier with hierarchical structure. Because of the hierarchical structure of the proposed pattern classifier, the data distribution of the input space can be analyzed in the macroscopic point of view and the microscopic point of view. Finally, in order to evaluate the classification ability of the proposed pattern classifier, the machine learning data sets are used.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.108-111
• /
• 2007

속성선택(Feature Selection)은 패턴분류 문제에서 분류기들의 성능을 향상시킬 수 있는 중요한 부분으로 다양한 기법들이 연구되어지고 있다. 특히, 많은 변수와 속성들을 가지는 데이터를 패턴분류 하는 과정에서 주요 속성부분집합을 추출하여 이용함으로써 분류기의 연산속도 및 정확도를 향상시킬 수 있다. 본 논문에서는 유전자 알고리즘과 정보이론의 상호정보량을 이용하여 속성선택을 하는 기법을 제안하였다. 제안된 기법의 성능을 평가하기 위하여 패턴분류 문제에 적용하고 그 성능이 우수함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.598-600
• /
• 2001

본 논문에서는 양상 뮤 논리를 위한 속성 명세 패턴 연구를 통해 시제 논리에 대한 패턴 기반의 단일한 프레임워크를 제시한다. 본 연구에서는 Dwyer의 속성 명세 패턴 분류를 상태(S)와 행동(A)으로 세분화하고 이를 다시 강함(A)와 약함(E)으로 다시 세분했다. 이러한 의미 기반의 계층적 패턴 분류 체계를 통해 양상 뮤 논리의 속성 명세 패턴을 분석했으며 실제 모형 검사기에서 사용된 예제들의 패턴 분류에 적용했다. 그 결과 기존의 분류 체계보다 더 정확한 분류가 가능했을 뿐만 아니라, 속성 명세의 작성 및 이해가 용이하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.509-514
• /
• 2015

In this paper, we introduce a new pattern classifier which is based on the learning algorithm of Extreme Learning Machine the sort of artificial neural networks and fuzzy set theory which is well known as being robust to noise. The learning algorithm used in Extreme Learning Machine is faster than the conventional artificial neural networks. The key advantage of Extreme Learning Machine is the generalization ability for regression problem and classification problem. In order to evaluate the classification ability of the proposed pattern classifier, we make experiments with several machine learning data sets.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.456-464
• /
• 1997

We describe a random prcess model that prvides sets of patterms whth prcisely contrlolled within-class varia-bility and between-class distinctions.We used these pattems in a simulation study wity the back-propagation netwoek to chracterize its perfotmance as we varied the process-controlling parameters,the statistical differences between the processes,and the random noise on the patterns.Our results indicated that grneralized statistical difference between the processes genrating the patterns provided a good predictor of the difficulty of the clssi-fication problem. Also we analyzed the performance of the Bayes classifier whith the maximum-likeihood cri-terion and we compared the performance of the neural network to that of the Bayes classifier.We found that the performance of neural network was intermediate between that of the simulated and theoretical Bayes classifier.

• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.946-950
• /
• 2010

Many sentiment categorization systems based on machine learning methods use morphological analyzers in order to extract linguistic features from sentences. However, the morphological analyzers do not generally perform well in a customer review domain because online customer reviews include many spacing errors and spelling errors. These low performances of the underlying systems lead to performance decreases of the sentiment categorization systems. To resolve this problem, we propose a feature extraction method based on simple longest matching of Eojeol (a Korean spacing unit) and phoneme patterns. The two kinds of patterns are automatically constructed from a large amount of POS (part-of-speech) tagged corpus. Eojeol patterns consist of Eojeols including content words such as nouns and verbs. Phoneme patterns consist of leading consonant and vowel pairs of predicate words such as verbs and adjectives because spelling errors seldom occur in leading consonants and vowels. To evaluate the proposed method, we implemented a sentiment categorization system using a SVM (Support Vector Machine) as a machine learner. In the experiment with Korean customer reviews, the sentiment categorization system using the proposed method outperformed that using a morphological analyzer as a feature extractor.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.824-830
• /
• 2003

RPA (Recursive Partition Averaging) method was proposed in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked well in many areas, however, the major drawbacks of RPA are it's pattern averaging mechanism. We propose an adaptive OHC algorithm which uses the FPD(Feature-based Population Densimeter) to increase the classification rate of RPA. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed a excellent results in terms of classification when we compare it to the k-NN.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.633-641
• /
• 2009

In this paper, we proposed a new pattern classifier which can be incrementally learned, be added new class in learning time, and handle with analog data. Proposed pattern classifier has hierarchical structure and the classification rate is improved by using different metric for each levels. Proposed model is based on the Gaussian ARTMAP which is an artificial neural network model for the pattern classification. We hierarchically constructed the Gaussian ARTMAP and proposed the Principal Component Emphasis(P.C.E) method to be learned different features in each levels. And we defined new metric based on the P.C.E. P.C.E is a method that discards dimensions whose variation are small, that represents common attributes in the class. And remains dimensions whose variation are large. In the learning process, if input pattern is misclassified, P.C.E are performed and the modified pattern is learned in sub network. Experimental results indicate that Hierarchical Gaussian ARTMAP yield better classification result than the other pattern recognition algorithms on variable data set including real applicable problem.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.335-342
• /
• 2001

본 논문은 보로노이 공간분류를 활용하여 원격탐사 영상인식을 위한 다층 신경망 분류기를제안한다. 제안된 다층 신경망 분류기는 보로노이 다각형 영역으로 클래스를 구분하며, 초평면 방정식의 계수를 오류 역전과 학습 초기의 연결 강도, 임계치 그리고 은닉층의 노드 수로 결정한다. 제안된 방법은 오류역전과 학습 알고리즘에서 임의로 정해주던 초기 정보를 사전 분석에 의해 공학적으로 결정함으로써 느린 수렴 속도와 학습실패 등의 단점을 피할 수 있는 장점이 있다. 보로노이 다이어그램에 대한 경계선의 초평면 방정식은 훈련집합의 클래스별 평균값을 구하여 Mathematica 패키지로 계산하였다. 제안된 다층 신경망에 의한 영상분류기의 인식능력을 평가하기 위하여 원격탐사 영상인식에서 자주 활용되는 최소거리 분류 방법과 최대우도 분류 방법으로 처리해서 비교한 결과, 최소거리 분류 방법은 실험화상에 대해 81.4%, 최대우도 부류기에 의한 분류는 87.8%, 제안한 방법은 92.2% 정확성을 가진 분류결과를 나타냈다.

• The Journal of Information Technology
• /
• v.1 no.1
• /
• pp.65-84
• /
• 1998

The MBR (Memory Based Reasoning) is a supervised learning method that utilizes the distances among the input and trained patterns in its classification, and is also called a distance based learning algorithm. The MBR is based on the k-NN classifier, in which teaming is performed by simply storing training patterns in the memory without any further processing. This paper proposes a new learning algorithm which is more efficient than the traditional k-NN classifier and has incremental learning capability, Furthermore, our proposed algorithm is insensitive to noisy patterns, and guarantees more efficient memory usage.