• Title/Summary/Keyword: Search algoritm

Search Result 4, Processing Time 0.018 seconds

Pattern Analysis and Performance Comparison of Lottery Winning Numbers

  • Jung, Yong Gyu;Han, Soo Ji;kim, Jae Hee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.6 no.1
    • /
    • pp.16-22
    • /
    • 2014
  • Clustering methods such as k-means and EM are the group of classification and pattern recognition, which are used in management science and literature search widely. In this paper, k-means and EM algorithm are compared the performance using by Weka. The winning Lottery numbers of 567 cases are experimented for our study and presentation. Processing speed of the k-means algorithm is superior to the EM algorithm, which is about 0.08 seconds faster than the other. As the result it is summerized that EM algorithm is better than K-means algorithm with comparison of accuracy, precision and recall. While K-means is known to be sensitive to the distribution of data, EM algorithm is probability sensitive for clustering.

Optimal solution search method by using modified local updating rule in ACS-subpath algorithm (부경로를 이용한 ACS 탐색에서 수정된 지역갱신규칙을 이용한 최적해 탐색 기법)

  • Hong, SeokMi;Lee, Seung-Gwan
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.443-448
    • /
    • 2013
  • Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

Effect of search algorithm execution time analysis education on logical thinking of elementary school student (파이썬을 활용한 탐색 알고리즘 수행시간 분석이 초등학생의 논리성에 미치는 효과)

  • Yang, Yunghoon;Kong, Gipyo;Kim, Jonghoon
    • Journal of The Korean Association of Information Education
    • /
    • v.23 no.2
    • /
    • pp.179-188
    • /
    • 2019
  • The purpose of this study is to develop a Python search algorithm educational program based on execution time to improve the logical thinking of elementary school students. This educational program was developed based on the process of ADDIE model, utilizing the results of pre-demand analysis conducted for 133students in elementary school in ${\bigcirc}{\bigcirc}$. In order to verify the effectiveness of the developed education program, 25 students who participated in the education donation program at ${\bigcirc}{\bigcirc}$ University conducted 42 hours of classes during 6 days. The GALT test was used to analyze the educational effects of the pre- and post-test. The results of the analysis show that the SW education program developed in this study can positively affect the logic of elementary school students.

An Optimal Reliability-Redundancy Allocation Problem by using Hybrid Parallel Genetic Algorithm (하이브리드 병렬 유전자 알고리즘을 이용한 최적 신뢰도-중복 할당 문제)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • IE interfaces
    • /
    • v.23 no.2
    • /
    • pp.147-155
    • /
    • 2010
  • Reliability allocation is defined as a problem of determination of the reliability for subsystems and components to achieve target system reliability. The determination of both optimal component reliability and the number of component redundancy allowing mixed components to maximize the system reliability under resource constraints is called reliability-redundancy allocation problem(RAP). The main objective of this study is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for reliability-redundancy allocation problem that decides both optimal component reliability and the number of component redundancy to maximize the system reliability under cost and weight constraints. The global optimal solutions of each example are obtained by using CPLEX 11.1. The component structure, reliability, cost, and weight were computed by using HPGA and compared the results of existing metaheuristic such as Genetic Algoritm(GA), Tabu Search(TS), Ant Colony Optimization(ACO), Immune Algorithm(IA) and also evaluated performance of HPGA. The result of suggested algorithm gives the same or better solutions when compared with existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improve solution through swap, 2-opt, and interchange processes. In order to calculate the improvement of reliability for existing studies and suggested algorithm, a maximum possible improvement(MPI) was applied in this study.