• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.4
• /
• pp.16-25
• /
• 2004

A Classifier System is a system based on rules to invent new rules from the present useful ones. In this paper, Genetic Algorithms are proposed to find good classification rule of Classifier System which can extract useful information from huge database. The proposed scheme is applied to the real problems such as the car insurance problem to evaluate the performance of Genetic Algorithm based classifier systems.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.369-376
• /
• 2006

This paper presents a new method of significantly improving conventional Bayesian statistical text classifier by incorporating accelerated EM(Expectation Maximization) algorithm. EM algorithm experiences a slow convergence and performance degrade in its iterative process, especially when real online-textual documents do not follow EM's assumptions. In this study, we propose a new accelerated EM algorithm with uncertainty-based selective sampling, which is simple yet has a fast convergence speed and allow to estimate a more accurate classification model on Naive Bayesian text classifier. Experiments using the popular Reuters-21578 document collection showed that the proposed algorithm effectively improves classification accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.5
• /
• pp.61-71
• /
• 1998

Genetic Algorithm(GA) is a method of approaching optimization problems by modeling and simulating the biological evolution. GA needs large time-consuming, so ti had better do on a parallel computer architecture. Our proposed system has a VLSI-oriented interconnection network, which is constructed from a viewpoint of fractal geometry, so that self-similarity is considered in its configuration. The approach to Parallel Genetic Algorithm(PGA) on our proposed system is explained, and then, we construct the classifier system such that the set of samples is classified into weveral classes based on the features of each sample. In the process of designing the classifier system, We have applied PGA to the Traveling Salesman Problem and classified the sample set in the Euclidean space into several categories with a measure of the distance.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.531-535
• /
• 2004

A new method is presented to construct a classifier. This was accomplished by combining a generalized regression neural network (GRNN) and a genetic algorithm (GA). The classifier constructed in this way is referred to as a GA-GRNN. The GA played a role of controlling training factors simultaneously. The GA-GRNN was applied to classify 4 different Promoter sequences. The training and test data were composed of 115 and 58 sequence patterns, respectively. The classifier performance was investigated in terms of the classification sensitivity and prediction accuracy. Compared to conventional GRNN, GA-GRNN significantly improved the total classification sensitivity as well as the total prediction accuracy. As a result, the proposed GA-GRNN demonstrated improved classification sensitivity and prediction accuracy over the convention GRNN.

• 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.

• ETRI Journal
• /
• v.44 no.4
• /
• pp.560-572
• /
• 2022

H²RDC (heuristic handover based on RCC-DTSK-C), a heuristic algorithm based on a highly interpretable deep Takagi-Sugeno-Kang fuzzy classifier, is proposed for suppressing the mobile heterogeneous networks problem of frequent handover and handover ping-pong in the multibase-station scenario. This classifier uses a stack structure between subsystems to form a deep classifier before generating a base station (BS) priority sequence during the handover process, and adaptive handover hysteresis is calculated. Simulation results show that H²RDC allows user equipment to switch to the best antenna at the optimal time. In high-BS density load and mobility scenarios, the proposed algorithm's handover success rate is similar to those of classic algorithms such as best connection (BC), self tuning handover algorithm (STHA), and heuristic for handover based on AHP-TOPSIS-FUZZY (H²ATF). Moreover, the handover rate is 83% lower under H²RDC than under BC, whereas the handover ping-pong rate is 76% lower.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.785-804
• /
• 2017

Due to various factors such as postures, facial expressions and illuminations, face recognition by videos often suffer from poor recognition accuracy and generalization ability, since the within-class scatter might even be higher than the between-class one. Herein we address this problem by proposing a hierarchical cascaded classifier for video face recognition, which is a multi-layer algorithm and accounts for the misclassified samples plus their similar samples. Specifically, it can be decomposed into single classifier construction and multi-layer classifier design stages. In single classifier construction stage, classifier is created by clustering and the number of classes is computed by analyzing distance tree. In multi-layer classifier design stage, the next layer is created for the misclassified samples and similar ones, then cascaded to a hierarchical classifier. The experiments on the database collected by ourselves show that the recognition accuracy of the proposed classifier outperforms the compared recognition algorithms, such as neural network and sparse representation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.161-165
• /
• 2014

In this paper, we proposed the fuzzy prototype pattern classifier. In the proposed classifier, each prototype is defined to describe the related sub-space and the weight value is assigned to the prototype. The weight value assigned to the prototype leads to the change of the boundary surface. In order to define the prototypes, we use Fuzzy C-Means Clustering which is the one of fuzzy clustering methods. In order to optimize the weight values assigned to the prototypes, we use the Differential Evolutionary Algorithm. We use Linear Discriminant Analysis to estimate the coefficients of the polynomial which is the structure of the consequent part of a fuzzy rule. Finally, in order to evaluate the classification ability of the proposed pattern classifier, the machine learning data sets are used.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.5
• /
• pp.766-778
• /
• 2015

In this paper, we design a hybrid system for recognition and tracking realized with the aid of polynomial based RBFNNs pattern classifier and particle filter. The RBFNN classifier is built by learning the training data for diverse pose images. The optimized parameters of RBFNN classifier are obtained by Particle Swarm Optimization(PSO). Testing data for pose image is used as a face image obtained under real situation, where the face image is detected by AdaBoost algorithm. In order to improve the recognition performance for a detected image, pose estimation as preprocessing step is carried out before the face recognition step. PCA is used for pose estimation, the pose of detected image is assigned for the built pose by considering the featured difference between the previously built pose image and the newly detected image. The recognition of detected image is performed through polynomial based RBFNN pattern classifier, and if the detected image is equal to target for tracking, the target will be traced by particle filter in real time. Moreover, when tracking is failed by PF, Adaboost algorithm detects facial area again, and the procedures of both the pose estimation and the image recognition are repeated as mentioned above. Finally, experimental results are compared and analyzed by using Honda/UCSD data known as benchmark DB.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.536-543
• /
• 2014

Terrain classification is still a challenging issue in image processing, especially with high resolution satellite images. The well-known obstacles include low accuracy in the detection of targets, especially for the case of man-made structures, such as buildings and roads. In this paper, we present an efficient approach to classify and detect building footprints, foliage, grass and road from high resolution grayscale satellite images. Our contribution is to build a strong classifier using AdaBoost based on a combination of co-occurrence and Haar-like features. We expect that the inclusion of Harr-like feature improves the classification performance of the man-made structures, since Haar-like feature is extracted from corner features and rectangle features. Also, the AdaBoost algorithm selects only critical features and generates an extremely efficient classifier. Experimental result indicates that the classification accuracy of AdaBoost classifier is much higher than that of the conventional classifier using back propagation algorithm. Also, the inclusion of Harr-like feature significantly improves the classification accuracy. The accuracy of the proposed method is 98.4% for the target detection and 92.8% for the classification on high resolution satellite images.