• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.4
• /
• pp.466-471
• /
• 2006

IAn important problem of pattern recognition is to extract or select feature set, which is included in the pre-processing stage. In order to extract feature set, Principal component analysis has been usually used and SFS(Sequential Forward Selection) and SBS(Sequential Backward Selection) have been used as a feature selection method. This paper applies genetic algorithm which is a popular method for nonlinear optimization problem to the feature selection problem. So, we call it Genetic Algorithm Feature Selection(GAFS) and this algorithm is compared to other methods in the performance aspect.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.1
• /
• pp.11-22
• /
• 2023

In this paper, we propose an efficient satellite selection method for multi-constellation GNSS. The number of visible satellites has increased dramatically recently due to multi-constellation GNSS. By the increased availability, the overall GNSS performance can be improved. Whereas, due to the increase of the number of visible satellites, the computational burden in implementing advanced processing such as integer ambiguity resolution and fault detection can be increased considerably. As widely known, the optimal satellite selection method requires very large computational burden and its real-time implementation is practically impossible. To reduce computational burden, several sub-optimal but efficient satellite selection methods have been proposed recently. However, these methods are prone to the local optimum problem and do not fully utilize the information redundancy between different constellation systems. To solve this problem, the proposed method utilizes the inter-system biases and geometric assignments. As a result, the proposed method can be implemented in real-time, avoids the local optimum problem, and does not exclude any single-satellite constellation. The performance of the proposed method is compared with the optimal method and two popular sub-optimal methods by a simulation and an experiment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.114-123
• /
• 2003

This paper proposes an efficient method for encoding the shape information of the object in the image. The polygonal approximation method is categorized into a loss coding method and is widely used for approximating object's shape information. The proposed method selects less number of vertices than IRM (iterated refinement method) or PVS (progressive vertex selection) when the maximum distortion is given, so reduces the bit-rates. The proposed method selects the vertices of a polygon with a simple and efficient method considering the rate-distortion sense. We construct the shape information coder, which shows the outstanding performance in the rate-distortion sense, based on the conventional progressive vertex selection method and the new vertex selection condition that we propose in this paper. Simulation results show that the proposed method has better performance than other conventional vertex selection methods in the tate-distortion sense.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.31-40
• /
• 2013

In this paper, a novel method is proposed to build an ensemble of classifiers by using a feature selection schema. The feature selection schema identifies the best feature sets that affect the arrhythmia classification. Firstly, a number of feature subsets are extracted by applying the feature selection schema to the original dataset. Then classification models are built by using the each feature subset. Finally, we combine the classification models by adopting a voting approach to form a classification ensemble. The voting approach in our method involves both classification error rate and feature selection rate to calculate the score of the each classifier in the ensemble. In our method, the feature selection rate depends on the extracting order of the feature subsets. In the experiment, we applied our method to arrhythmia dataset and generated three top disjointed feature sets. We then built three classifiers based on the top-three feature subsets and formed the classifier ensemble by using the voting approach. Our method can improve the classification accuracy in high dimensional dataset. The performance of each classifier and the performance of their ensemble were higher than the performance of the classifier that was based on whole feature space of the dataset. The classification performance was improved and a more stable classification model could be constructed with the proposed approach.

• Journal of the Korea Institute of Building Construction
• /
• v.16 no.4
• /
• pp.331-339
• /
• 2016

According to high-rise, complexation, and enlargement of buildings, various construction methods are being developed, and the significance of construction method selection about main work types has emerged as a major interest. However, it has been pointed out that hand-on workers cannot consider project characteristics carefully, and they lack an objective standard or reference for main construction method selection. Hence, the selection is being made depending on hand-on workers' experience and intuition. To solve this problem, various studies have proceeded for construction method selection of main work types using Artificial Intelligence like Fuzzy, AHP and Case-based reasoning. It is difficult to apply many different kinds of construction method selection to every main work type with consideration for characteristics of work types and condition of a construction site when selecting construction method in the field. Accordingly, this study proposed the decision-making model which can apply to fields easily. Using matrix analysis and liner transformation, this study verified consistency of study models applied in the process of soil retaining selection with a case study.

• Journal of Information Technology Applications and Management
• /
• v.15 no.1
• /
• pp.271-282
• /
• 2008

Database administrators are demanded to acquire much knowledges and take great efforts for keeping consistent performance in system. Various principles, methods, and tools have been proposed in many studies and commercial products in order to alleviate such burdens on database administrators, and it has resulted to the automation of DBMS which reduces the intervention of database administrator. This paper suggests a resource selection method that estimates the status of the database system based on the workload characteristics and that recommends tuneable resources. Our method tries to simplify selection information on DBMS status using data-mining techniques, enhance the accuracy of the selection model, and recommend tuneable resource. For evaluating the performance of our method, instances are collected in TPC-C and TPC-W workloads, and accuracy are calculated using 10 cross validation method, comparisons are made between our scheme and the method which uses only the classification procedure without any simplification of informations. It is shown that our method has over 90% accuracy and can perform tuneable resource selection.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.459-462
• /
• 2004

In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. A a reducing power consumption of a scheduling for module selection under the time constraint execute scheduling and allocation for considering the switching activity. The focus scheduling of this phase adopt Force-Directed Scheduling for low power to existed Force-Directed Scheduling. and it constructs the module selection RT library by in account consideration the mutual correlation of parameters in which the power and the area and delay. when it is, in this paper we formulate the module selection method as a multi-objective optimization and propose a branch and bound approach to explore the large design space of module selection. Therefore, the optimal module selection method proposed to consider power, area, delay parameter at the same time. The comparison experiment analyzed a point of difference between the existed FDS algorithm and a new FDS_RPC algorithm.

• Communications for Statistical Applications and Methods
• /
• v.26 no.2
• /
• pp.149-161
• /
• 2019

In this article, we suggest the following approaches to simultaneous variable selection and outlier detection. First, we determine possible candidates for outliers using properties of an intercept estimator in a difference-based regression model, and the information of outliers is reflected in the multiple regression model adding mean shift parameters. Second, we select the best model from the model including the outlier candidates as predictors using stochastic search variable selection. Finally, we evaluate our method using simulations and real data analysis to yield promising results. In addition, we need to develop our method to make robust estimates. We will also to the nonparametric regression model for simultaneous outlier detection and variable selection.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.443-450
• /
• 2007

In this paper, we propose a novel threshold selection method based on statistical information on gray-levels of given images and interval-valued fuzzy sets. In the proposed threshold selection method, the interval-valued fuzzy set is used to represent more definitely the relationship between a pixel and its belonging region, that is, the object and the background. Also the statistical information on gray-level is used to determine the rules and partitions of interval-valued fuzzy sets. To show the validity of the proposed method, we compared the performance of the proposed with those of conventional methods such as Otsu's method, Huang and Wang's method applied to 5 test images with various types of histograms.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.659-672
• /
• 2005

This paper evaluates discretization of continuous variables to select relevant variables for supervised learning using mutual information. Three discretization methods, MDL, Histogram and 4-Intervals are considered. The process of discretization and variable subset selection is evaluated according to the classification accuracies with the 6 real data sets of UCI databases. Results show that 4-Interval discretization method based on quantiles, is robust and efficient for variable selection process. We also visually evaluate the appropriateness of the selected subset of variables.