• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.1
• /
• pp.98-103
• /
• 2000

This paper suggests a method to recognize the various defect patterns of a cold mill strip using a binary decision tree automatically constructed by a genetic algorithm(GA). In classifying complex patterns with high similarity like the defect patterns of a cold mill stirp, the selection of an optimal feature set and an appropriate recognizer is important to achieve high recognition rate. In this paper a GA is used to select a subset of the suitable features at each node in the binary decision tree. The feature subset with maximum fitness is chosen and the patterns are classified into two classes using a linear decision function. This process is repeated at each node until all the patterns are classified into individual classes. In this way, the classifier using the binary decision tree is constructed automatically. After constructing the binary decision tree, the final recognizer is accomplished by having neural network learning sits of standard patterns at each node. In this paper, the classifier using the binary decision tree is applied to the recognition of defect patterns of a cold mill strip, and the experimental results are given to demonstrate the usefulness of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.876-882
• /
• 2003

The future wireless communication systems will use spatial multiplexing with Multiple Input Multiple Output(MIMO) system to take advantage of large channel capacity gains. In such systems it will be desirable to select a sub-set of available transmit or receive antennas to reduce cost and complexity. In this paper we propose a novel antenna selection schemes for MIMO systems be suitable for multipath environment. Also, we analyze the capacity and define the outage probability for a novel antenna selection schemes for MIMO systems in multipath environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.121-127
• /
• 2004

This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.73-82
• /
• 2013

In pattern classification, feature selection is an important factor in the performance of classifiers. In particular, when classifying a large number of features or variables, the accuracy and computational time of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. The proposed method consists of two parts: a wrapper part with an improved genetic algorithm(GA) using a new reproduction method and a filter part using mutual information. We also considered feature selection methods based on mutual information(MI) to improve computational complexity. Experimental results show that this method can achieve better performance in pattern recognition problems than other conventional solutions.

• Communications for Statistical Applications and Methods
• /
• v.26 no.6
• /
• pp.575-582
• /
• 2019

The problem of selecting variables in the presence of outliers is considered. Variable selection and outlier detection are not separable problems because each observation affects the fitted regression equation differently and has a different influence on each variable. We suggest a simultaneous method for variable selection and outlier detection in a linear regression model. The suggested procedure uses a sequential method to detect outliers and uses all possible subset regressions for model selections. A simplified version of the procedure is also proposed to reduce the computational burden. The procedures are compared to other variable selection methods using real data sets known to contain outliers. Examples show that the proposed procedures are effective and superior to robust algorithms in selecting the best model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.3
• /
• pp.275-282
• /
• 2014

One of the most widely used methods for dimensionality reduction is principal component analysis (PCA). However, the reduced dimensions from PCA do not provide a clear interpretation with respect to the original features because they are linear combinations of a large number of original features. This interpretation problem can be overcome by feature selection approaches that identifying the best subset of given features. In this study, we propose an unsupervised feature selection method based on the geometrical information of PCA loading vectors. Experimental results from a simulation study demonstrated the efficiency and usefulness of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.173-180
• /
• 2015

We propose a selection procedure of principal components in principal component regression. Our method selects principal components using variable selection procedures instead of a small subset of major principal components in principal component regression. Our procedure consists of two steps to improve estimation and prediction. First, we reduce the number of principal components using the conventional principal component regression to yield the set of candidate principal components and then select principal components among the candidate set using sparse regression techniques. The performance of our proposals is demonstrated numerically and compared with the typical dimension reduction approaches (including principal component regression and partial least square regression) using synthetic and real datasets.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.11-20
• /
• 2015

In order to prevent the elderly people from committing suicide attempts, it is necessary to verify attributes that affect the suicide attempts. It is noted that previous studies have focused on qualitative approaches, and simple correlation analyses to determine the attributes related to the suicide attempts in the elderly people. However, such previous approaches had led to insufficient performance when facing with complicated data sets. In this sense, this study suggests an alternative method in which attribute selection techniques are adopted to determine more relevant attributes of the suicide attempts occurring in Korean elderly people. To verify empirical validity of our proposed method, we used Korea National Health and Nutrition Examination Survey (KNHANES) from January 2007 to December 2012. Empirical results proved that the proposed attribute selection techniques showed better predictive effectiveness; 94.4% compared to the simple statistical methods. This study proposes a way to determining the elderly suicide and preventing it to happen.

• Structural Engineering and Mechanics
• /
• v.25 no.3
• /
• pp.347-363
• /
• 2007

A novel methodology, referred to as Auxiliary Domain Method (ADM), allowing for a very efficient solution of nonlinear reliability problems is presented. The target nonlinear failure domain is first populated by samples generated with the help of a Markov Chain. Based on these samples an auxiliary failure domain (AFD), corresponding to an auxiliary reliability problem, is introduced. The criteria for selecting the AFD are discussed. The emphasis in this paper is on the selection of the auxiliary linear failure domain in the case where the original nonlinear reliability problem involves multiple objectives rather than a single objective. Each reliability objective is assumed to correspond to a particular response quantity not exceeding a corresponding threshold. Once the AFD has been specified the method proceeds with a modified subset simulation procedure where the first step involves the direct simulation of samples in the AFD, rather than standard Monte Carlo simulation as required in standard subset simulation. While the method is applicable to general nonlinear reliability problems herein the focus is on the calculation of the probability of failure of nonlinear dynamical systems subjected to Gaussian random excitations. The method is demonstrated through such a numerical example involving two reliability objectives and a very large number of random variables. It is found that ADM is very efficient and offers drastic improvements over standard subset simulation, especially when one deals with low probability failure events.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.179-188
• /
• 2004

Bankruptcy prediction is an important and widely studied topic since it can have significant impact on bank lending decisions and profitability. Recently, support vector machine (SVM) has been applied to the problem of bankruptcy prediction. The SVM-based method has been compared with other methods such as neural network, logistic regression and has shown good results. Genetic algorithm (GA) has been increasingly applied in conjunction with other AI techniques such as neural network, CBR. However, few studies have dealt with integration of GA and SVM, though there is a great potential for useful applications in this area. This study proposes the methods for improving SVM performance in two aspects: feature subset selection and parameter optimization. GA is used to optimize both feature subset and parameters of SVM simultaneously for bankruptcy prediction.