Top > JACIII > Multi-Space Competitive DGA for Model Selection and its Applic ...

single-jc.php

JACIII Vol.15 No.9 pp. 1320-1328
doi: 10.20965/jaciii.2011.p1320
(2011)

Paper:

Views over last 60 days: 539

Multi-Space Competitive DGA for Model Selection and its Application to Localization of Multiple Signal Sources

Shudai Ishikawa*, Hideaki Misawa*, Ryosuke Kubota**,
Tatsuji Tokiwa*, Keiichi Horio*,***,
and Takeshi Yamakawa*,***

*Graduate School of Life Science and Systems Engineering, Kyushu Institute of Technology Kitakyushu, 2-4 Hibikino, Wakamatsu-ku, Kitakyushu 808-0196, Japan

**Department of Intelligent Systems Engineering, Ube National College of Technology, 2-14-1 Tokiwadai, Ube, Yamaguchi 755-8555, Japan

***Fuzzy Logic Systems Institute, 680-41 Kawazu, Iizuka, Fukuoka 820-0067, Japan

Received:
May 31, 2011
Accepted:
September 20, 2011
Published:
November 20, 2011
Creative Commons License
Keywords:
distributed genetic algorithm, competition between sub-populations,multiple solution spaces, model selection, signal source localization
Abstract
In this paper, a new optimization method, which is effective for the problems that the optimum solution should be searched in several solution spaces, is proposed. The proposed method is an extension of Distributed Genetic Algorithm (DGA), in which each subpopulation searches a solution in the corresponding solution space. Through the competition between the sub-populations, population sizes are adequately and gradually changed. By the change of the population size, the appropriate sub-population attracts many individuals. The changing population size yield the efficient search for the problems of searching for solutions in multiple spaces. In order to evaluate the proposed method, it is applied to a polynomial curve fitting and signal source localization, in which the number of sources is preliminarily unknown. Simulation results show the effectiveness of the proposed method.
Cite this article as:
S. Ishikawa, H. Misawa, R. Kubota, T. Tokiwa, K. Horio, and T. Yamakawa, “Multi-Space Competitive DGA for Model Selection and its Application to Localization of Multiple Signal Sources,” J. Adv. Comput. Intell. Intell. Inform., Vol.15 No.9, pp. 1320-1328, 2011.
Data files:
References
  1. [1] J. H. Holland, “Outline for a Logical Theory of Adaptive Systems,” J. of the Association for Computing Machinery, Vol.3, pp. 297-314, 1962.
  2. [2] S. Tsutsui and Y. Fujimoto, “The fGA: Forking Genetic Algorithm with Blocking and Shrinking Modes,” Proc. 5th ICGA, pp. 206-213, 1993.
  3. [3] D. Whitley, “The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best,” Proc. 3rd ICGA, pp. 116-121, 1989.
  4. [4] H. Takagi, “Interactive Evolutionary Computation: Fusion of the Capacities of EC Optimization and Human Evaluation,” Proc. of the IEEE, Vol.89, No.9, pp. 1275-1296, 2001.
  5. [5] R. Tanese, “Parallel Genetic Algorithm for a Hypercube,” Proc. of the Int. Conf. on Genetic Algorithms, pp. 177-183, 1987.
  6. [6] R. Tanese, “Distributed Genetic Algorithms,” Proc. of the Int. Conf. on Genetic Algorithms, pp. 434-439, 1989.
  7. [7] M. Kim, V. Aggarwal, U.-M. O’ Reilly, and M. Medard, “A Doubly Distributed Genetic Algorithm for Network Coding,” Proc. ACM Genetic and Evolutionary Computation Conference (GECCO), 2007.
  8. [8] A. Peregrin and M. A. Rodriguez, “Multiple Source Estimation Method Combined with Genetic Algorithm and Simulated Annealing,” Eighth International Conference on Hybrid Intelligent Systems, pp. 531-536, 2008.
  9. [9] S. Baillet, J. C. Mosher, and R. M. Leahy, “Electromagnetic Brain Mapping,” IEEE Signal Processing Magazine, Vol.18, No.6, pp. 14-30, 2001.
  10. [10] C. Michel, M. Murray, G. Lantz, S. Gonzalez Andino, L. Spinelli, and R. Grave de Peralta Menendez, “EEG source imaging,” Clinical Neurophysiology, Vol.115, No.10, pp. 2195-2222, 2004.
  11. [11] D. McNay, E. Michielssen, R. L. Rogers, S. A. Taylor, M. Akhtari, and W. W. Sutherling, “Multiple source localization using genetic algorithms,” J. of Neuroscience Methods, Vol.64, Issue 2, pp. 163-172, 1996.
  12. [12] T. Nagano, Y. Ohno, N. Uesugi, H. Ikeda, and A. Ishiyama, “Multisource localization by Genetic Algorithms using MEG,” IEEE Trans. on Magnetics, Vol.34, No.5, 1998.
  13. [13] Y. Ono, A. Ishiyama, and N. Kasai, “Multiple Source Estimation Method Combined with Genetic Algorithm and Simulated Annealing,” Trans. of the Institute of Electrical Engineers of Japan, Vol.122-A, pp. 93-99, 2002 (in Japanese).
  14. [14] C. M. Bishop, “Pattern Recognition and Machine Learning,” Springer, 2006.
  15. [15] L. J. Eshelman and J. D. Schaffer, “Real Coded Genetic Algorithms and Interval-Schemata,” Foundations of Genetic Algorithms 2, Morgan Kaufman Publishers, San Mateo, pp. 187-202, 1993.
  16. [16] H. Akaike, “Information theory and an extension of the maximum likefood principle,” Second Int. Symposium on Information Theory, Akademiai Kiado, pp. 267-281, 1973.
  17. [17] Z. Zhang, “A fast method to compute surface potentials generated by dipole within multilayer anisotropic spheres,” Phys. Med. Biol., Vol.40, pp. 335-349, 1995.

Creative Commons License  This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 19, 2024