• Journal of information and communication convergence engineering
• /
• v.3 no.4
• /
• pp.209-212
• /
• 2005

This study proposes hybrid case-based reasoning and genetic algorithms model for customer classification. In this study, vertical and horizontal dimensions of the research data are reduced through integrated feature and instance selection process using genetic algorithms. We applied the proposed model to customer classification model which utilizes customers' demographic characteristics as inputs to predict their buying behavior for the specific product. Experimental results show that the proposed model may improve the classification accuracy and outperform various optimization models of typical CBR system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.61-75
• /
• 2007

The purpose of this paper is to develop a new group classification method based on genetic algorithm and to com-pare its prediction performance with those of existing methods in the area of bond rating. To serve this purpose, we conduct various experiments with pilot and general models. Specifically, we first conduct experiments employing two pilot models : the one searching for the cluster center of each group and the other one searching for both the cluster center and the attribute weights in order to maximize classification accuracy. The results from the pilot experiments show that the performance of the latter in terms of classification accuracy ratio is higher than that of the former which provides the rationale of searching for both the cluster center of each group and the attribute weights to improve classification accuracy. With this lesson in mind, we design two generalized models employing genetic algorithm : the one is to maximize the classification accuracy and the other one is to minimize the total misclassification cost. We compare the performance of these two models with those of existing statistical and artificial intelligent models such as MDA, ANN, and Decision Tree, and conclude that the genetic algorithm-based group classification method that we propose in this paper significantly outperforms the other methods in respect of classification accuracy ratio as well as misclassification cost.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.115-123
• /
• 2016

In this study, we collect various side effect pairs which are appeared frequently at many drugs, and select side effect pairs that have higher severity. For every selected side effect pair, we extract common genetic networks which are shared by side effects' genes and drugs' target genes based on PPI(Protein-Protein Interaction) network. For this work, firstly, we gather drug related data, side effect data and PPI data. Secondly, for extracting common genetic network, we find shortest paths between drug target genes and side effect genes based on PPI network, and integrate these shortest paths. Thirdly, we develop a classification model which uses this common genetic network as a classifier. We calculate similarity score between the common genetic network and genetic network of a drug for classifying the drug. Lastly, we validate our classification model by means of AUC(Area Under the Curve) value.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.75-81
• /
• 2011

This paper presents a novel method for image classification based on a hybrid genetic algorithm (GA) and support vector machine (SVM) approach which can significantly improve the classification performance for content-based image retrieval (CBIR). Though SVM has been widely applied to CBIR, it has some problems such as the kernel parameters setting and feature subset selection of SVM which impact the classification accuracy in the learning process. This study aims at simultaneously optimizing the parameters of SVM and feature subset without degrading the classification accuracy of SVM using GA for CBIR. Using the hybrid GA and SVM model, we can classify more images in the database effectively. Experiments were carried out on a large-size database of images and experiment results show that the classification accuracy of conventional SVM may be improved significantly by using the proposed model. We also found that the proposed model outperformed all the other models such as neural network and typical SVM models.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.209-212
• /
• 2005

Hyperspectral data consists of more than 200 spectral bands that are highly correlated. In order to utilize hyperspectral data for classification, dimensional reduction or feature extraction is desired. By applying feature extraction, computational complexity of classification can be reduced and classification accuracy may be improved. In this paper, a genetic algorithm based feature extraction technique is proposed. Measure from discriminant analysis is utilized as optimization criterion. A subset of spectral bands is selected by genetic algorithm. Dimension of feature space is further reduced by linear transformation. Feasibility of the proposed technique is evaluated with AVIRIS data.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2815-2817
• /
• 2002

Classification method of cancers using cDNA microarrays data was developed using genetic algorithms and neural networks. For gene selection, 2308 genes were ranked using genetic algorithms, and selected by frequency number of selection from 1000 of genetic iterative runs. To calculate fitness values, artificial neural networks are used as classifier. The small, round blue cell tumors (SRBCTs) which is difficult to distinguish via pathological single test was used as test diseases for classification, and the test results showed the 96% of exact classification capability for 25 test samples.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.1-16
• /
• 2008

The purpose of this paper is to propose a new binary classification method for predicting corporate failure based on genetic algorithm, and to validate its prediction power through empirical analysis. Establishing virtual companies representing bankrupt companies and non-bankrupt ones respectively, the proposed method measures the similarity between the virtual companies and the subject for prediction, and classifies the subject into either bankrupt or non-bankrupt one. The values of the classification variables of the virtual companies and the weights of the variables are determined by the proper model to maximize the hit ratio of training data set using genetic algorithm. In order to test the validity of the proposed method, we compare its prediction accuracy with ones of other existing methods such as multi-discriminant analysis, logistic regression, decision tree, and artificial neural network, and it is shown that the binary classification method we propose in this paper can serve as a premising alternative to the existing methods for bankruptcy prediction.

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

• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.1
• /
• pp.335-358
• /
• 2008

According to Wayne A. Wiegand in the 1998, he research to The "Amherst Method": The Origins of the Dewey Decimal Classification Scheme. Although a debate about the origins of the Dewey Decimal Classification Scheme has been going on for generations, historical consensus remains elusive. This paper contributes information to the historiography on the origins of the scheme: 1) by grounding an account of Dewey's thinking as he was crafting the DDC on an analysis of a large body of sources than previous classification historians have consulted; and 2) by expanding and deepening historical understanding of the contextual forces influencing on the classification structure. Because the DDC idea as it first occurred to M. Dewey in Amherst in 1872-73 is an important in the history of library development in the world. He outlined the first draft of his decimal scheme and submitted it to the Amherst College Library Committee on 8 May 1873. This paper analysis to "Three Genetic Paper", that is 1) The Merits of the System, 2) Library Classification System, 3) Its Special Adaption to our Library.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.525-528
• /
• 2009

Recently, image classification has been an important task in various fields. Generally, the performance of image classification is not good without the adjustment of image features. Therefore, it is desired that the way of automatic feature extraction. In this paper, we propose an image classification method which adjusts image features automatically. We assume that texture features are useful in image classification tasks because natural images are composed of several types of texture. Thus, the classification accuracy rate is improved by using distribution of texture features. We obtain texture features by calculating image features from a current considering pixel and its neighborhood pixels. And we calculate image features from distribution of textures feature. Those image features are adjusted to image classification tasks using Genetic Algorithm. We apply proposed method to classifying images into "head" or "non-head" and "male" or "female".