A novel data reduction method based on information theory and the Eclectic Genetic Algorithm

[1]  G. Anandalingam,et al.  A penalty function approach for solving bi-level linear programs , 1993, J. Glob. Optim..

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  H. Oja.  Multivariate Nonparametric Methods with R , 2010 .

[4]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[5]  Ken Black,et al.  Business Statistics: Contemporary Decision Making , 1994 .

[6]  David G. Lowe,et al.  Similarity Metric Learning for a Variable-Kernel Classifier , 1995, Neural Computation.

[7]  Tetsuo Kinoshita,et al.  On-demand Data Numerosity Reduction for Learning Artifacts , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[8]  Huan Liu,et al.  Instance Selection and Construction for Data Mining , 2001 .

[9]  Hyun Myung,et al.  Evolutionary programming techniques for constrained optimization problems , 1997, IEEE Trans. Evol. Comput..

[10]  Tony R. Martinez,et al.  Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.

[11]  Dennis L. Wilson,et al.  Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..

[12]  G. Krishna,et al.  The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[13]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[14]  Rob J Hyndman,et al.  Sample Quantiles in Statistical Packages , 1996 .

[15]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[16]  David B. Skalak,et al.  Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms , 1994, ICML.

[17]  Francisco Herrera,et al.  Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study , 2003, IEEE Trans. Evol. Comput..

[18]  John R. Koza,et al.  Genetic Programming as a Darwinian Invention Machine , 1999, EuroGP.

[19]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[20]  David P. Doane,et al.  Aesthetic Frequency Classifications , 1976 .

[21]  L. Shampine,et al.  Fundamentals of Numerical Computing , 1997 .

[22]  I. Olkin,et al.  Sampling theory of surveys, with applications , 1955 .

[23]  C B Begg,et al.  Optimal sample size for a series of pilot trials of new agents. , 1996, Biometrics.

[24]  Colin R. Reeves,et al.  Using Genetic Algorithms for Training Data Selection in RBF Networks , 2001 .

[25]  É. Kisdi,et al.  Evolutionarily singular strategies and the adaptive growth and branching of the evolutionary tree , 2004, Evolutionary Ecology.

[26]  H. Oja.  Multivariate Nonparametric Methods with R: An approach based on spatial signs and ranks , 2010 .

[27]  P. Müller,et al.  Optimal Sample Size for Multiple Testing , 2004 .

[28]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[29]  Ángel Fernando Kuri Morales,et al.  Penalty Function Methods for Constrained Optimization with Genetic Algorithms: A Statistical Analysis , 2002, MICAI.

[30]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[31]  S. Walter,et al.  Sample size and optimal designs for reliability studies. , 1998, Statistics in medicine.

[32]  David W. Aha,et al.  Learning Representative Exemplars of Concepts: An Initial Case Study , 1987 .

[33]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[34]  S. Brooks,et al.  Optimization Using Simulated Annealing , 1995 .

[35]  Chris Cornelis,et al.  Fuzzy-rough instance selection , 2010, International Conference on Fuzzy Systems.

[36]  Francisco Herrera,et al.  FRPS: A Fuzzy Rough Prototype Selection method , 2013, Pattern Recognit..