• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.491-499
• /
• 2011

In this paper, we offer a new strategic portfolio model for national IT R&D project selection in Korea. A risk and return (R-R) portfolio model was developed using an objectively quantified index on the two axes of risk and return, in order to select a strategic project and allocate resources in compliance with a national IT R&D strategy. We strategize using the R-R portfolio model to solve the non-strategy and subjectivity problems of the existing national R&D project selection model. We also use the quantified evaluation index of the IT technology road map (TRM) and the technical level reports (TLR) for the subjectivity of project selection, and try to discover the weights using the analytic hierarchy process (AHP). In addition, we intend to maximize the chance for a successful national IT R&D project, by selecting a strategic portfolio project and balancing the allocation of resources effectively and objectively.

• Communications for Statistical Applications and Methods
• /
• v.22 no.1
• /
• pp.55-67
• /
• 2015

An important problem in cluster analysis is the selection of variables that define cluster structure that also eliminate noisy variables that mask cluster structure; in addition, outlier detection is a fundamental task for cluster analysis. Here we provide an automated K-means clustering process combined with variable selection and outlier identification. The Automated K-means clustering procedure consists of three processes: (i) automatically calculating the cluster number and initial cluster center whenever a new variable is added, (ii) identifying outliers for each cluster depending on used variables, (iii) selecting variables defining cluster structure in a forward manner. To select variables, we applied VS-KM (variable-selection heuristic for K-means clustering) procedure (Brusco and Cradit, 2001). To identify outliers, we used a hybrid approach combining a clustering based approach and distance based approach. Simulation results indicate that the proposed automated K-means clustering procedure is effective to select variables and identify outliers. The implemented R program can be obtained at http://www.knou.ac.kr/~sskim/SVOKmeans.r.

• Journal of Computing Science and Engineering
• /
• v.11 no.4
• /
• pp.130-141
• /
• 2017

Feature selection is one of the most challenging problems of pattern recognition and data mining. In this paper, a feature selection algorithm based on an improved version of binary differential evolution is proposed. The method simultaneously optimizes two feature selection criteria, namely, set approximation accuracy of rough set theory and relational algebra based derived score, in order to select the most relevant feature subset from an entire feature set. Superiority of the proposed method over other state-of-the-art methods is confirmed by experimental results, which is conducted over seven publicly available benchmark datasets of different characteristics such as a low number of objects with a high number of features, and a high number of objects with a low number of features.

• Communications for Statistical Applications and Methods
• /
• v.17 no.1
• /
• pp.17-27
• /
• 2010

Feature selection and feature weighting are useful techniques for improving the classification accuracy of k-Nearest Neighbor (k-NN) classifier. The main propose of feature selection and feature weighting is to reduce the number of features, by eliminating irrelevant and redundant features, while simultaneously maintaining or enhancing classification accuracy. In this paper, a novel hybrid approach is proposed for simultaneous feature selection, feature weighting and choice of k in k-NN classifier based on Genetic Algorithm. The results have indicated that the proposed algorithm is quite comparable with and superior to existing classifiers with or without feature selection and feature weighting capability.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.21 no.4
• /
• pp.171-179
• /
• 2017

For estimating the seismic demand of buildings, most seismic design provisions permit conducting linear and nonlinear response history analysis. In order to obtain reliable results from response history analyses, a proper selection of input ground motions is required. In this study, an accurate algorithm for selecting and scaling ground motions is proposed, which satisfies the ASCE 7-10 criteria. In the proposed algorithm, a desired number of ground motions are sequentially scaled and selected from a ground motion library without iterations.

• Culinary science and hospitality research
• /
• v.14 no.3
• /
• pp.45-57
• /
• 2008

The purpose of this study is to initiate a systematic approach to maximize profits through continuous development of menu and build a strong image of Western restaurants located inside hotels by identifying their guests' knowledge and concern and menu selection behavior in well being trend. Findings from the analysis are as follows. First, among the Western menu selection behavior, organic grain and seafood, seasonal event menu, less spicy and more natural cooking methods are favored as the most important consideration. Second, customers' knowledge and concern in well being trend and menu selection behavior were found to be statistically significant. Third, customers' awareness in health and obesity were found to be statistically significant to the concern in well being trend. Fourth, demographical characteristics of customers such as gender, marital status, age, income level and education were tested for their relationships with knowledge and concern in well being trend.

• The Korean Journal of Applied Statistics
• /
• v.33 no.1
• /
• pp.1-10
• /
• 2020

We propose a unified approach to variable selection, transformation and outliers in the linear model. The procedure includes a sequential method for outlier detection and a least trimmed squares estimator for variable transformation. It uses all possible subsets regressions for model selection. Some real data analyses and the simulation results are provided to show the efficiency of the methods in the context of the correct variable selection and the fitness of the estimated model.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.199-207
• /
• 2012

Recently, variable selection methods using penalized likelihood with a shrink penalty function have been widely studied in various statistical models including generalized linear models and survival models. In particular, they select important variables and estimate coefficients of covariates simultaneously. In this paper, we develop a penalize h-likelihood method for variable selection in gamma frailty models. For this we use the smoothly clipped absolute deviation (SCAD) penalty function, which satisfies a good property in variable selection. The proposed method is illustrated using simulation study and a practical data set.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.320-326
• /
• 2016

In existing literature on multiple-input multiple-output (MIMO) relaying communication systems, antenna selection is often implemented by maximizing the channel capacity or the output single-to-noise ratio (SNR). In this paper, we propose an energy-efficient low-complexity antenna selection scheme for MIMO relaying communication systems. The proposed algorithm is based on beamforming and maximizing the Frobenius norm to jointly optimize the transmit power, number of active antennas, and antenna subsets at the source, relaying and destination. We maximize the energy efficiency between the link of source to relay and the link of relay to destination to obtain the maximum energy efficiency of the system, subject to the SNR constraint. Compared to existing antenna selection methods forMIMO relaying communication systems, simulation results demonstrate that the proposed method can save more power in term of energy efficiency, while having lower computational complexity.

• Industrial Engineering and Management Systems
• /
• v.14 no.2
• /
• pp.210-219
• /
• 2015

A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.