• Title/Summary/Keyword: 랜덤 토너먼트

Search Result 3, Processing Time 0.024 seconds

A study on a multi-stage random tournament competition system and its fairness (다단 랜덤화 토너먼트 경쟁방식 및 그의 공정성에 대한 연구)

  • Lee, Kee-Won;Lee, Jung Soon;Sim, Songyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.4
    • /
    • pp.923-930
    • /
    • 2015
  • There exist many competition systems to determine a winner. Many sports games use the 1-in-2 tournament or its modified version to determine a winner. In this paper, we propose a competition system that can be used when there are many candidates and many random referees to evaluate the candidates. These competitions can be found in the cyber space where many users score many competing apps. We study fairness of our proposed competing system called a multi-stage random tournament in terms of equal probabilities. We also formulate the influence factor of a specific referee under some specific conditions.

Feature Selection for Classification of Mass Spectrometric Proteomic Data Using Random Forest (단백체 스펙트럼 데이터의 분류를 위한 랜덤 포리스트 기반 특성 선택 알고리즘)

  • Ohn, Syng-Yup;Chi, Seung-Do;Han, Mi-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.139-147
    • /
    • 2013
  • This paper proposes a novel method for feature selection for mass spectrometric proteomic data based on Random Forest. The method includes an effective preprocessing step to filter a large amount of redundant features with high correlation and applies a tournament strategy to get an optimal feature subset. Experiments on three public datasets, Ovarian 4-3-02, Ovarian 7-8-02 and Prostate shows that the new method achieves high performance comparing with widely used methods and balanced rate of specificity and sensitivity.

PTS Technique Based on Micro-Genetic Algorithm with Low Computational Complexity (낮은 계산 복잡도를 갖는 마이크로 유전자 알고리즘 기반의 PTS 기법)

  • Kong, Min-Han;Song, Moon-Kyou
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.480-486
    • /
    • 2008
  • The high peak-to-average power ratio (PAPR) of the transmitted signals is one of major drawbacks of the orthogonal frequency division multiplexing (OFDM). A partial transmit sequences (PTS) technique can improve the PAPR statistics of OFDM signals. However, in a PTS technique, the search complexity to select phase weighting factors increases exponentially with the number of sub-blocks. In this paper, a PTS technique with low computational complexity is presented, which adopts micro-genetic algorithm(${\mu}$-GA) as a search algorithm. A search on the phase weighting factors starts with a population of five randomly generated individuals. An elite having the largest fitness value and the other four individuals selected through the tournament selection strategy are determined, and then the next generation members are generated through the crossover operations among those. If the new generation converges, all the four individuals except the elite are randomly generated again. The search terminates when there has been no improvements on the PAPR during the predefined number of generations, or the maximum number of generations has been reached. To evaluate the performance of the proposed PTS technique, the complementary cumulative distribution functions (CCDF) of the PAPR are compared with those of the conventional PTS techniques.