• 제어로봇시스템학회논문지
• /
• 제16권1호
• /
• pp.96-100
• /
• 2010

This paper proposes novel genetic design of optimal classifier ensemble for vehicle detection using Genetic Algorithm with Varying Population Size (GAVaPS). Recently, many classifiers are used in classifier ensemble to deal with tremendous amounts of data. However the problem has a exponential large search space due to the increasing the number of classifier pool. To solve this problem, we employ the GAVaPS which outperforms comparison with simple genetic algorithm (SGA). Experiments are performed to demonstrate the efficiency of the proposed method.

• 전자공학회논문지C
• /
• 제34C권2호
• /
• pp.71-79
• /
• 1997

In this paper, we propose a new nearest-neighbor classifier with reduced computational complexity in search process. In the proposed classifier, the classes are divided into two sets: reference and non-reference sets. It reduces computational requriement by approximating the distance between the input and a class iwth the information of distances among the calsses. It calculates only the distance between the input and the reference classes. We convert a given classifier into RCC (reduced computational complexity but smal lincrease in misclassification probability of its corresponding RCC classifier. We designed RCC classifiers for the recognition of digits from the NIST database. We obtained an RCC classifier with 60% reduction in the computational complexity with the cost of 0.5% increase in misclassification probability.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.236-240
• /
• 2000

A cellular automaton is well-known for self-organizing and dynamic behaviors in the field of artificial life. This paper addresses a new neuronic architecture called an evolvable cellular classifier which evolves with the genetic rules (chromosomes) in the non-uniform cellular automata. An evolvable cellular classifier is primarily based on cellular programing, but its mechanism is simpler because it utilizes only mutations for the main genetic operators and resembles the Hopfield network. Therefore, the desirable hi t-patterns could be obtained through evolutionary processes for just one individual agent. As a result, an evolvable hardware is derived which is applicable to classification of bit-string information.

• Journal of Information Processing Systems
• /
• 제8권2호
• /
• pp.301-314
• /
• 2012

In this paper, two new approaches to align English-Arabic sentences in bilingual parallel corpora based on the Multi-Class Support Vector Machine (MSVM) and the Hidden Markov Model (HMM) classifiers are presented. A feature vector is extracted from the text pair that is under consideration. This vector contains text features such as length, punctuation score, and cognate score values. A set of manually prepared training data was assigned to train the Multi-Class Support Vector Machine and Hidden Markov Model. Another set of data was used for testing. The results of the MSVM and HMM outperform the results of the length based approach. Moreover these new approaches are valid for any language pairs and are quite flexible since the feature vector may contain less, more, or different features, such as a lexical matching feature and Hanzi characters in Japanese-Chinese texts, than the ones used in the current research.

• ETRI Journal
• /
• 제36권6호
• /
• pp.1016-1022
• /
• 2014

This paper presents a hybrid model solution for user motion recognition. The use of a single classifier in motion recognition models does not guarantee a high recognition rate. To enhance the motion recognition rate, a hybrid model consisting of decision trees and artificial neural networks is proposed. We define six user motions commonly performed in an indoor environment. To demonstrate the performance of the proposed model, we conduct a real field test with ten subjects (five males and five females). Experimental results show that the proposed model provides a more accurate recognition rate compared to that of other single classifiers.

• 한국컴퓨터정보학회논문지
• /
• 제23권4호
• /
• pp.17-24
• /
• 2018

This paper proposes data mining models relevant to the serial publication periods and mobile gamification likelihood of webtoon contents which were either serialized or completed in platform. The size of the cartoon industry including webtoon takes merely 1% of the total entertainment contents industry in Korea. However, the significance of webtoon business is rapidly growing because its intellectual property can be easily used as an effective OSMU (One Source Multi-Use) vehicle for multiple types of contents such as movie, drama, game, and character-related merchandising. We suggested a set of data mining classifiers that are deemed suitable to provide prediction models for serial publication periods and mobile gamification likelihood for the sake of webtoon contents. As a result, the balanced accuracies are respectively recorded as 85.0% and 59.0%, from the two models.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권4호
• /
• pp.331-334
• /
• 2006

Original Support Vsctor Machines (SVMs) by Vapnik were used for binary classification problems. Some researchers have tried to extend original SVM to multiclass classification. However, their studies have only focused on classifying samples into nominal categories. This study proposes a novel multiclass SVM model in order to handle ordinal multiple classes. Our suggested model may use less classifiers but predict more accurately because it utilizes additional hidden information, the order of the classes. To validate our model, we apply it to the real-world bond rating case. In this study, we compare the results of the model to those of statistical and typical machine learning techniques, and another multi class SVM algorithm. The result shows that proposed model may improve classification performance in comparison to other typical multiclass classification algorithms.

• Journal of the Korean Data and Information Science Society
• /
• 제23권2호
• /
• pp.375-383
• /
• 2012

The purpose of the ensemble methods is to increase the accuracy of prediction through combining many classifiers. According to recent studies, it is proved that random forests and forward stagewise regression have good accuracies in classification problems. However they have great prediction error in separation boundary points because they used decision tree as a base learner. In this study, we use the kernel ridge regression instead of the decision trees in random forests and boosting. The usefulness of our proposed ensemble methods was shown by the simulation results of the prostate cancer and the Boston housing data.

• 전기학회논문지
• /
• 제61권9호
• /
• pp.1336-1339
• /
• 2012

In this paper, we focus on solving the classification problem by using semisupervised learning strategy. Traditional classifiers are constructed based on labeled data in supervised learning. Labeled data, however, are often difficult, expensive or time consuming to obtain, as they require the efforts of experienced human annotators. Unlabeled data are significantly easier to obtain without human efforts. Thus, we use AdaBoost algorithm with SVM-KNN classifier to apply semisupervised learning problem and improve the classifier performance. Experimental results on both artificial and UCI data sets show that the proposed methodology can reduce the error rate.

• 전기학회논문지
• /
• 제63권5호
• /
• pp.696-702
• /
• 2014

Recently, researches on analyzing relationship between the state of emotion and musical stimuli using EEG are increasing. A selection of feature vectors is very important for the performance of EEG pattern classifiers. This paper proposes a comparison of EEG feature vectors for emotion classification according to music listening. For this, we extract some feature vectors like DAMV, IAV, LPC, LPCC from EEG signals in each class related to music listening and compare a separability of the extracted feature vectors using Bhattacharyya distance. So more effective feature vectors are recommended for emotion classification according to music listening.