Nonlinear Feature Extraction in a Logarithmic Space with Evolutionary Algorithms
By: Mihaela Breaban, Dan Simovici and Henri Luchian
Open Access
|Aug 2013
References
- [1] C. M. Fonseca, E. M. Mendes, P. J. Fleming, and S. A. Billings, Non-linear Model Term Selection with Genetic Algorithms, 1993.
- [2] J. H. Friedman and J. W. Tukey, A projection pursuit algorithm for exploratory data analysis, IEEE Trans. Comput., C23(9), (1974), 881890.
- [3] J.H. Friedman, Exploratory Projection Pursuit, American Statistical Association, (1987), 249266.
- [4] J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975.
- [5] M. C. Jones and R. Sibson, What is projection pursuit? (with discussion), J. R.Statist. Soc. A, 150, (1987), 136.
- [6] J. B. Kruskal, Toward a practical method which helps uncover the structure of a set of multivariate observations by finding the linear transformation which optimizes a new ’index of condensation’, Statistical Computation Ed. by R.C. Milton and J.A. Nelder, Academic Press, New York, 1969.
- [7] J. Mao and A.K. Jain, Discriminant analysis neural networks, 1993, 300-305.
- [8] S. Mika, G. Ratsch, J. Weston, B. Scholkoph, and K.R. Mullers, Fisher discriminant analysis with kernels, Neural Networks for Signal Processing, (1999.)
- [9] K. Price, R.M. Storn, and J.A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization, Springer, 2005.
- [10] V. Vemuri and W. Cedeo, Multi-Niche Crowding for Multimodal Search, Practical Handbook of Genetic Algorithms: New Frontiers, Ed. Lance Chambers, 1995.
- [11] D Zaharie, Influence of crossover on the behavior of Differential Evolution Algo- rithms, Applied Soft Computing, 9(3), (2009), 1126-1138.
Language: English
Page range: 25 - 36
Published on: Aug 14, 2013
Published by: West University of Timisoara
In partnership with: Paradigm Publishing Services
Publication frequency: Volume open
Related subjects:
© 2013 Mihaela Breaban, Dan Simovici, Henri Luchian, published by West University of Timisoara
This work is licensed under the Creative Commons License.