• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1375-1376
• /
• 2015

본 논문은 퍼지 클러스터링을 이용한 규칙 성장 기반 퍼지 분류기의 설계에 대해서 소개한다. 본 논문의 목적은 퍼지 클러스터링을 통해 형성된 증가된 퍼지 규칙을 이용한 새로운 설계 방법론을 개발하는 것이다. 제안된 분류기는 네개의 기능적인 부분으로 구성된다. 퍼지 규칙의 전반부는 퍼지 클러스터링 알고리즘을 이용해 구성된 멤버쉽 함수를 나타낸다. 후반부는 지역 모델을 구성한다. 지역 모델의 파라미터는 가중 최소 자승법에 의해 추정된다. 추론부에서는, 각 퍼지 규칙의 에러 측정후, 가장 높은 에러를 갖는 하나의 퍼지 규칙이 선택된다. 규칙성장 부분에서는, 네트워크의 강화를 위해 규칙의 성장 과정이 이루어지며, 선택된 규칙은 제안된 분류기에서 더 나은 성능을 위해 두 개 또는 세 개의 세분화된 퍼지 규칙으로 나누어진다. 이러한 새로운 규칙은 context 기반 Fuzzy C-Means 클러스터링에 의해서 형성된다. 제안된 규칙 기반 분류기의 효용성을 토론하며, 머신 러닝 데이터를 이용하여 실험을 수행하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.47-50
• /
• 2003

기계학습의 한 종류인 분류자 시스템은 간단한 문제에 대하여 실시간 처리와 온라인 학습이 가능하다. 그러나 복잡한 환경에서는 빠른 적응이 힘들다. 본 논문에서는 복잡한 환경에서 분류자 시스템의 적응 성능을 개선함으로써 실시간이 가능하도록 전체 환경을 분류하고 각기 다른 룰 셋을 이용하는 룰 클러스터링에 의한 분류자 시스템을 제안한다 환경을 상황에 따라 나눔으로써 전체 환경이 변화하였을 경우 각 상황에 따른 변화에 대해서만 추가적으로 학습함으로써 탐색 공간을 줄여 학습 시간을 감소시킨다. 제안한 시스템은 분류자 시스템 중 ZCS을 이용하여 로봇축구 시스템에 적용하여 기존의 방법과 그 성능을 비교 검토한다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.4
• /
• pp.251-258
• /
• 2005

Automatic document classification may differ significantly according to the characteristics of documents that are subject to classification, as well as classifier's performance. This research identifies e-mail document's characteristics to apply a three-step preprocessing algorithm that can minimize e-mail document's atypical characteristics. In the first 5go, uncertain based sampling algorithm that used Mean Absolute Deviation(MAD), is used to address the question of selection learning document for the rule generation at the time of classification. In the subsequent stage, Weighted vlaue assigning method by attribute is applied to increase the discriminating capability of the terms that appear on the title on the e-mail document characteristic level. in the third and last stage, accuracy level during classification by each category is increased by using Naive Bayesian Presumptive Algorithm's Dynamic Threshold. And, we implemented an E-Mail Recommendtion System using a three-step preprocessing algorithm the enable users for direct and optimal classification with the recommendation of the applicable category when a mail arrives.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.8
• /
• pp.397-402
• /
• 2007

In this paper, we apply a support vector machine(SVM) that incorporates an optimized nonlinear decision rule over different sets of feature vectors to improve the performance of statistical model-based voice activity detection(VAD). Conventional method performs VAD through setting up statistical models for each case of speech absence and presence assumption and comparing the geometric mean of the likelihood ratio (LR) for the individual frequency band extracted from input signal with the given threshold. We propose a novel VAD technique based on SVM by treating the LRs computed in each frequency bin as the elements of feature vector to minimize classification error probability instead of the conventional decision rule using geometric mean. As a result of experiments, the performance of SVM-based VAD using the proposed feature has shown better results compared with those of reported VADs in various noise environments.

• Korean Journal of Remote Sensing
• /
• v.31 no.3
• /
• pp.205-214
• /
• 2015

In this study, a novel land-cover classification framework for multi-temporal SAR data is presented that can combine multiple features extracted through data transforms and multiple classifiers. At first, data transforms using principle component analysis (PCA) and 3D wavelet transform are applied to multi-temporal SAR dataset for extracting new features which were different from original dataset. Then, three different classifiers including maximum likelihood classifier (MLC), neural network (NN) and support vector machine (SVM) are applied to three different dataset including data transform based features and original backscattering coefficients, and as a result, the diverse preliminary classification results are generated. These results are combined via a majority voting rule to generate a final classification result. From an experiment with a multi-temporal ENVISAT ASAR dataset, every preliminary classification result showed very different classification accuracy according to the used feature and classifier. The final classification result combining nine preliminary classification results showed the best classification accuracy because each preliminary classification result provided complementary information on land-covers. The improvement of classification accuracy in this study was mainly attributed to the diversity from combining not only different features based on data transforms, but also different classifiers. Therefore, the land-cover classification framework presented in this study would be effectively applied to the classification of multi-temporal SAR data and also be extended to multi-sensor remote sensing data fusion.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.77-84
• /
• 2012

Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.497-509
• /
• 2008

Various algorithms and architectures for efficient packet classification have been widely studied. Packet classification algorithms based on a decision tree structure such as HiCuts and HyperCuts are known to be the best by exploiting the geometrical representation of rules in a classifier. However, the algorithms are not practical since they involve complicated heuristics in selecting a dimension of cuts and determining the number of cuts at each node of the decision tree. Moreover, the cutting is not efficient enough since the cutting is based on regular interval which is not related to the actual range that each rule covers. In this paper, we proposed a new efficient packet classification algorithm using a range cutting. The proposed algorithm primarily finds out the ranges that each rule covers in 2-dimensional prefix plane and performs cutting according to the ranges. Hence, the proposed algorithm constructs a very efficient decision tree. The cutting applied to each node of the decision tree is optimal and deterministic not involving the complicated heuristics. Simulation results for rule sets generated using class-bench databases show that the proposed algorithm has better performance in average search speed and consumes up to 3-300 times less memory space compared with previous cutting algorithms.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.80-86
• /
• 2016

A speech-act is a behavior intended by users in an utterance. Speech-act classification is important in a dialogue system. The machine learning and rule-based methods have mainly been used for speech-act classification. In this paper, we propose a speech-act classification method based on the combination of support vector machine (SVM) and transformation-based learning (TBL). The user's utterance is first classified by SVM that is preferentially applied to categories with a low utterance rate in training data. Next, when an utterance has negative scores throughout the whole of the categories, the utterance is applied to the correction phase by rules. The results from our method were higher performance over the baseline system long with error-reduction.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.38-45
• /
• 2017

Attacking of computer and network is increasing as information processing technology heavily depends on computer and network. To prevent the attack of system and network, host and network based intrusion detection system has developed. But previous rule based system has a lot of difficulties. For this reason demand for developing a intrusion detection system which detects and cope with the attack of system and network resource in real time. In this paper we develop a real time intrusion detection system which is combination of APEX and LS-SVM classifier. Proposed system is for nonlinear data and guarantees convergence. While real time processing system has its advantages, such as memory efficiency and allowing a new training data, it also has its disadvantages of inaccuracy compared to batch way. Therefore proposed real time intrusion detection system shows similar performance in accuracy compared to batch way intrusion detection system, it can be deployed on a commercial scale.