• Title/Summary/Keyword: order selection

Search Result 3,286, Processing Time 0.025 seconds

Genetic Algorithm Based Feature Selection Method Development for Pattern Recognition (패턴 인식문제를 위한 유전자 알고리즘 기반 특징 선택 방법 개발)

  • Park Chang-Hyun;Kim Ho-Duck;Yang Hyun-Chang;Sim Kwee-Bo
    • 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.

Application of MCDM methods to Qualified Personnel Selection in Distribution Science: Case of Logistics Companies

  • NONG, Nhu-Mai Thi;HA, Duc-Son
    • Journal of Distribution Science
    • /
    • v.19 no.8
    • /
    • pp.25-35
    • /
    • 2021
  • Purpose: This study aims to propose an integrated MCDM model to support the qualified personnel selection in the distribution science. Research design, data, and methodology: The integrated approach of AHP and TOPSIS was employed to address the personnel selection problem. The AHP method was used to define the weights of the selection criteria, whereas the TOPSIS was applied to rank alternatives. The proposed model was then applied into a leading logistics company to select the best alternatives to be the sales deputy manager. Results: The results showed that Candidate 3 is the most qualified personnel for the sales deputy manager position as he is ranked first in the order of preference for recruitment. Conclusions: The proposed model provides the decision makers with more effective and time-saving methods than conventional ones. Therefore, the model can be applied to personnel selection around the world. In terms of theoretical contribution, this study proposes a personnel selection model for choosing the most appropriate candidates. In addition, the study adds to the theory of human resources management and logistics management the full set of personnel selection criteria including education, experience, skills, health, personality traits and foreign language.

Harmonic-Mean-Based Dual-Antenna Selection with Distributed Concatenated Alamouti Codes in Two-Way Relaying Networks

  • Li, Guo;Gong, Feng-Kui;Chen, Xiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1961-1974
    • /
    • 2019
  • In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

The Influence of Ramen Selection Attributes on Consumer Purchase Intention

  • CHA, Seong-Soo;LEE, Su-Han
    • The Korean Journal of Food & Health Convergence
    • /
    • v.7 no.4
    • /
    • pp.1-11
    • /
    • 2021
  • The purpose of this study is to investigate the ramen selection attributes of consumers. This research assigned taste, price, quantity, design, and brand as selection attributes, all of which have already been verified by previous studies as selection attributes when purchasing processed foods. A total of 500 questionnaires were issued, and the survey results were analysed to ensure validity and reliability. A Structural Equation Model was used to test the hypotheses of the study. Based on the analysis, taste, price, quantity, design, and brand had a statistically significant effect on satisfaction. Furthermore, satisfaction had a statistically significant effect on repurchase intention. Among the selection attributes (taste, price, quantity, design, and brand), only price had a statistically significant effect on repurchase intention. However, the influence of the selection attributes on satisfaction varied depending on the consumer's consumption value. In order to analyse the moderating effect of consumption value, the respondent group was divided into a hedonism group and pragmatism group, and analysed. It empirically proved that the hedonistic value-oriented group valued taste, and the practical value-oriented group valued price the most. This study empirically verified the relationship between ramen selection attributes and consumption value, and provided corresponding theoretical and practical implications.

Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role in Model Selection

  • Bajwa, Waheed U.;Calderbank, Robert;Jafarpour, Sina
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.289-307
    • /
    • 2010
  • The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence-termed as the worst-case coherence and the average coherence-among the columns of a design matrix. It utilizes these two measures of coherence to provide an in-depth analysis of a simple, model-order agnostic one-step thresholding (OST) algorithm for model selection and proves that OST is feasible for exact as well as partial model selection as long as the design matrix obeys an easily verifiable property, which is termed as the coherence property. One of the key insights offered by the ensuing analysis in this regard is that OST can successfully carry out model selection even when methods based on convex optimization such as the lasso fail due to the rank deficiency of the submatrices of the design matrix. In addition, the paper establishes that if the design matrix has reasonably small worst-case and average coherence then OST performs near-optimally when either (i) the energy of any nonzero entry of the signal is close to the average signal energy per nonzero entry or (ii) the signal-to-noise ratio in the measurement system is not too high. Finally, two other key contributions of the paper are that (i) it provides bounds on the average coherence of Gaussian matrices and Gabor frames, and (ii) it extends the results on model selection using OST to low-complexity, model-order agnostic recovery of sparse signals with arbitrary nonzero entries. In particular, this part of the analysis in the paper implies that an Alltop Gabor frame together with OST can successfully carry out model selection and recovery of sparse signals irrespective of the phases of the nonzero entries even if the number of nonzero entries scales almost linearly with the number of rows of the Alltop Gabor frame.

Consumers' Channel Selection Behavior Based on Psychological Distance Cue: Regulatory-Focus as Moderator

  • Jungyeon Sung;Sangcheol Park
    • Asia pacific journal of information systems
    • /
    • v.29 no.2
    • /
    • pp.248-267
    • /
    • 2019
  • As merging online and offline channels into one single platform, individuals could easily and frequently switch between online and offline channels. In order for understanding such unique behaviors, this study attempts to explore why and how consumers choose their channels to search and purchase a product. We have drawn on multiple theories that have been used to explain individuals' judgment and decision making (i.e., construal level theory and regula-tory focus theory) in order to develop and tested two-way ANOVA based models of how both regulatory focus (e.g., promotion vs. prevention) and product types (e.g., experience goods vs. searching goods) including the psychological distance cue separately and jointly affect individuals' channel selection behavior (e.g., intention to use single channel vs. intention to use cross-channels). Our results have indicated that consumers with promotion-focus are more likely to use a single channel in experience goods rather than in searching goods when there exists the psychological cue. Based on our findings, the implication for both research and practice are discussed.

Trust-based Relay Selection in Relay-based Networks

  • Wu, Di;Zhu, Gang;Zhu, Li;Ai, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2587-2600
    • /
    • 2012
  • It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.

A Portfolio Model for National IT R&D Strategy Project Selection Methods

  • Ryu, Dong-Hyun;Lee, Woo-Jin
    • 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.

Feature Selection Based on Bi-objective Differential Evolution

  • Das, Sunanda;Chang, Chi-Chang;Das, Asit Kumar;Ghosh, Arka
    • 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.

A Fully Differential RC Calibrator for Accurate Cut-off Frequency of a Programmable Channel Selection Filter

  • Nam, Ilku;Choi, Chihoon;Lee, Ockgoo;Moon, Hyunwon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.5
    • /
    • pp.682-686
    • /
    • 2016
  • A fully differential RC calibrator for accurate cut-off frequency of a programmable channel selection filter is proposed. The proposed RC calibrator consists of an RC timer, clock generator, synchronous counter, digital comparator, and control block. To verify the proposed RC calibrator, a six-order Chebyshev programmable low-pass filter with adjustable 3 dB cut-off frequency, which is controlled by the proposed RC calibrator, was implemented in a $0.18-{\mu}m$ CMOS technology. The channel selection filter with the proposed RC calibrator draws 1.8 mA from a 1.8 V supply voltage and the measured 3 dB cut-off frequencies of the channel selection LPF is controlled accurately by the RC calibrator.