The KIPS Transactions:PartB (정보처리학회논문지B)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Distributed Genetic Algorithm using Automatic Migration Control

분산 유전 알고리즘에서 자동 마이그레이션 조절방법

  • 이현정 (삼성전자 DMC 연구소) ;
  • 나용찬 (서강대학교 컴퓨터공학과) ;
  • 양지훈 (서강대학교 컴퓨터공학과)
  • Received : 2009.09.21
  • Accepted : 2010.02.15
  • Published : 2010.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

We present a new distributed genetic algorithm that can be used to extract useful information from distributed, large data over the network. The main idea of the proposed algorithms is to determine how many and which individuals move between subpopulations at each site adaptively. In addition, we present a method to help individuals from other subpopulations not be weeded out but adapt to the new subpopulation. We used six data sets from UCI Machine Learning Repository to compare the performance of our approach with that of the single, centralized genetic algorithm. As a result, the proposed algorithm produced better performance than the single genetic algorithm in terms of the classification accuracy with the feature subsets.

본 논문에서는 분산된 거대한 네트워크상의 데이터에서 유용한 정보를 추출하는 새로운 마이그레이션 조절방법을 이용한 유전 알고리즘을 제안한다. 제안된 알고리즘의 주된 아이디어는 부분 개체군 사이에서 개체들의 이동에 필요한 파라미터들을 적응적으로 결정하는 것이다. 또 이동된 개체들이 새로운 부분 개체군에서 도태되지 않고 적응 할 수 있기 위한 방법을 제시한다. UCI 기계학습 관련 데이터 셋에서 중앙 집중적 단일 유전 알고리즘과 제안된 알고리즘을 비교하기 위해 여섯 개의 데이터를 사용했다. 결론적으로 분산 유전 알고리즘을 적용한 특징 부분 집합이 단일 유전 알고리즘을 적용한 것 보다 좋은 성능을 보였다.

Keywords

References

  1. H. Kargupta, and P. Chan, “Advancedin Distributed and Parallel Knowledge Discovery,” AAAIPress/MITPress, California, 2000.
  2. J. H. Holland, “Adaptation in Natural and Artificial systems,” AnnArbor : The University of Michigan Press, Michigan, 1975.
  3. D. E. Goldberg, “Genetic algorithms in Search, Optimization and Machine Learning,” Addison-Wesley Longman, Inc, Boston, 1989.
  4. D. V. Michael, “The Simple Genetic Algorithm : Foundations and Theory,” MITPress, California, 1999.
  5. E. Alba, “Parallel Metaheuristics : A New Class of Algorithms,” JohnWiley & Sons, Inc., New Jersey, 2005.
  6. F. Herrera and M. Lozano, “Gradual distributed real-coded genetic algorithms,” IEEE Transactions on Evolutionary Computation, 2000, Vol.4, No.1, pp.43-63. https://doi.org/10.1109/4235.843494
  7. E. Cant-paz, “A survey of parallel genetic algorithm,” Calculateurs Paralleles, 1998, Vol.10, pp.141-171.
  8. A. Jain and D. Zongker, “Feature Selection: Evaluation, Application, and Small Sample Performance”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997, Vol.19, No.2, pp.153-158. https://doi.org/10.1109/34.574797
  9. J. Yang and V. Honavar, “Feature subset selection using a Genetic Algorithm,” IEEE Intelligent Systems, 1998, Vol.13, No.2, pp.44-49. https://doi.org/10.1109/5254.671091
  10. P. Domingos and M. Pazzani, “On the optimality of the simple Bayesian classifier under zero-one loss”, Machine Learning, 1997, Vol. 29, pp. 103-137. https://doi.org/10.1023/A:1007413511361
  11. A. Asuncion and D. Newman, UCI Machine Learning Repository [http://www.ics.uci.edu/~mlearn/MLRepository.html], Irvine, CA: University of California, School of Information and Computer Science, 2007.
  12. WEKA3.5, http://www.cs.waikato.ac.nz/~ml/