Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
Open Access
|Mar 2011References
- Aarts, E. and van Laarhoven, P. (1987). Simulated anealing: A pedestrian review of the theory and some applications,J. Kittler and P. A. Devijver (Eds.),, Springer-Verlag, Berlin.
- Aha, D., Kibler, D. and Albert, M. (1999). Instance-based learning algorithms,(1): 37-66.
- Aksela, M. (2007)., Ph.D. thesis, Helsinki University of Technology, Helsinki.
- Asuncion, A. and Newman, D. (2007). Website of the UCI Machine Learning Repository
- Barbucha, D., Czarnowski, I., Jędrzejowicz, P., Ratajczak-Ropel, E. and Wierzbowska, I. (2009). e-JABAT—An implementation of the Web-based A-Team,N. Nguyen and L. Jain (Eds.),, Studies in Computational Intelligence, Vol. 167, Springer-Verlag, Berlin/Heidelberg, pp. 57-86.
- Bellifemine, F., Caire, G., Poggi A. and Rimassa, G. (2003). Jade. A white paper,, September 2003, pp. 6-19
- Bezdek, J. and Kuncheva, L. (2001). Nearest prototype classifier designs: An experimental study,(2): 1445-1473.
- Bhanu, B. and Peng, J. (2000). Adaptive integration image segmentation and object recognition,(4): 427-44.
- Bull, L. (2004). Learning classifier systems: A brief introduction,L. Bull (Ed.),, Studies in Fuzziness and Soft Computing, Springer, Berlin, pp. 3-14.
- Czarnowski, I. (2010). Prototype selection algorithms for distributed learning,(6): 2292-2300.
- Czarnowski, I. and Jędrzejowicz, P. (2004). An approach to instance reduction in supervised learning,F. Coenen, A. Preece and A. Macintosh (Eds.),, Springer, London, pp. 267-282.
- Czarnowski, I. and Jędrzejowicz, P. (2010). An approach to data reduction and integrated machine classification,(1): 21-40.
- Dash, M. and Liu, H. (1997). Feature selection for classification,(3): 131-156.
- DataSet, C. (2009). Website of the Datasets Used for Classification: Comparison of Results
- Friedman, M. (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance,(200): 675-701.
- Glover, F. (1989). Tabu search, Part I,(3): 533-549.
- Glover, F. (1990). Tabu search, Part II,(1): 4-32.
- Glover, F. and Laguna, M. (1993). Tabu search,C. Reeves (Ed.),, John Wiley and Sons, New Jork, NY, pp. 70-150.
- Hamo, Y. and Markovitch, S. (2005). The COMPSET algorithm for subset selection,, pp. 728-733.
- Hart, P. (1968). The condensed nearest neighbour rule,: 515-516.
- Jędrzejowicz, P. (1999). Social learning algorithm as a tool for solving some difficult scheduling problems,(2): 51-66.
- Kim, S.-W. and Oommen, B. (2003). A brief taxonomy and ranking of creative prototype reduction schemes,(3): 232-244.
- Kirkpatrick, S., Gelatt, C. and Vecci, M. (1983). Optimisation by simulated annealing,(4598): 671-680.
- Kohavi, R. and John, G. (1997). Wrappers for feature subset selection,(1-2): 273-324.
- Kuncheva, L. and Bezdek, J. (1998). Nearest prototype classification: Clustering, genetic algorithm or random search?,(1): 160-164.
- Kuncheva, L. and Jain, L. (1999). Nearest-neighbor classifier: Simultaneous editing and feature selection,(11-13): 1149-1156.
- Michalewicz, Z. (1996)., Springer, Berlin.
- Nanni, L. and Lumini, A. (2009). Particle swarm optimization for prototype reduction,(4-6): 1092-1097.
- Quinlan, J. (1993)., Morgan Kaufmann Publishers, San Mateo, CA.
- Raman, B. (2003). Enhancing learning using feature and example selection,, Texas AM University, College Station, TX.
- Ritter, G., Woodruff, H., Lowry, S. and Isenhour, T. (1975). An algorithm for a selective nearest decision rule,(6): 665-669.
- Rozsypal, A. and Kubat, M. (2003). Selecting representative examples and attributes by a genetic algorithm,(4): 291-304.
- Sahel, Z., Bouchachia, A., Gabrys, B. and Rogers, P. (2007). Adaptive mechanisms for classification problems with drifting data,B. Apolloni, R. Howlett and L. Jain (Eds.),, Lecture Notes in Artificial Intelligence, Vol. 4693, Springer-Verlag, Berlin/Heidelberg, pp. 419-426.
- Skalak, D. (1994). Prototype and feature selection by sampling and random mutation hill climbing algorithm,, pp. 293-301.
- Song, H. and Lee, S. (1996). LVQ combined with simulated annealing for optimal design of large set reference models,(2): 329-336.
- Talukdar, S., Baerentzen, L., Gove, A. and de Souza, P. (1996). Asynchronous teams: Co-operation schemes for autonomous, computer-based agents,, Carnegie Mellon University, Pittsburgh, PA.
- Wilson, D. and Martinez, T. (2000a). An integrated instancebased learning algorithm,(1): 1-28.
- Wilson, D. and Martinez, T. (2000b). Reduction techniques for instance-based learning algorithm,(3): 257-286.
- Zongker, D. and Jain, A. (1996). Algorithm for feature selection: An evaluation,, pp. 18-22.
Language: English
Page range: 57 - 68
Published on: Mar 28, 2011
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2011 Ireneusz Czarnowski, Piotr Jędrzejowicz, published by University of Zielona Góra
This work is licensed under the Creative Commons License.