Skip to main content

An Agent-Based Simulated Annealing Algorithm for Data Reduction

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6071))

Abstract

Data reduction in the supervised machine learning aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction can result in increased capabilities and generalization properties of the learning model and shorter learning process time. It can also help in scaling up to a large data sources. This paper proposes an approach based on a combination of the simulated annealing technique and the multi-agent architecture designed for solving the data reduction problem. The paper includes the overview of the proposed approach and shows the computational experiment results. Experiment has shown that the proposed agent-based simulated annealing outperforms the traditional simulated annealing approach when solving the data reduction problem.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E.H.L., van Laarhoven, P.J.M.: Simulated Anealing: A Pedestrian Review of the Theory and Some Applications. In: Devijever, P.A., Kittler, J. (eds.) Pattern Recognition and Applications. Springer, Berlin (1987)

    Google Scholar 

  2. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine (2007) http://www.ics.uci.edu/~mlearn/MLRepository.html

    Google Scholar 

  3. Bellifemine, F., Caire, G., Poggi, A., Rimassa, G.: JADE. A white paper, Exp. 3(3), 6–20 (2003)

    Google Scholar 

  4. Barbucha, D., Czarnowski, I., Jędrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: e-JABAT - An Implementation of the Web-Based A-Team. In: Nguyen, N.T., Jain, I.C. (eds.) Intelligent Agents in the Evolution of Web and Applications, Studies in Computational Intelligence, vol. 167, pp. 57–86. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Cano, J.R., Herrera, F., Lozano, M.: On the Combination of Evolutionary Algorithms and Stratified Strategies for Training Set Selection in Data Mining. Applied Soft Computing 6, 323–332 (2004)

    Article  Google Scholar 

  6. Czarnowski, I., Jędrzejowicz, P.: An Approach to Instance Reduction in Supervised Learning. In: Coenen, F., Preece, A., Macintosh, A. (eds.) Research and Development in Intelligent Systems XX, pp. 267–282. Springer, London (2004)

    Google Scholar 

  7. Datasets used for classification: comparison of results. In. directory of data sets, http://www.is.umk.pl/projects/datasets.html (Accessed September 1, 2009

  8. Han, J., Kamber, M.: Data Mining. Concepts and Techniques. Academic Press, San Diego (2001)

    Google Scholar 

  9. Hamo, Y., Markovitch, S.: The COMPSET Algorithm for Subset Selection. In: Proceedings of The Nineteenth International Joint Conference for Artificial Intelligence, Edinburgh, Scotland, pp. 728–733 (2005)

    Google Scholar 

  10. Kirkpatrick, S., Gelatt, C.D., Vecci, M.P.: Optimisation by Simulated Annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  11. Kohavi, R., John, G.H.: Wrappers for Feature Subset Selection. Artificial Intelligence 97(1-2), 273–324 (1997)

    Article  MATH  Google Scholar 

  12. Liu, H., Motoda, H.: Instance Selection and Construction for Data Mining. Kluwer Academic Publisher, Dordrecht (2001)

    Google Scholar 

  13. Raman, B.: Enhancing learning using feature and example selection. Texas A&M University, College Station, TX, USA. (2003)

    Google Scholar 

  14. Rozsypal, A., Kubat, M.: Selecting Representative Examples and Attributes by a Genetic Algorithm. Intelligent Data Analysis 7(4), 291–304 (2003)

    MATH  Google Scholar 

  15. Quinlan, J.R.: C4.5: Programs for machine learning. Morgan Kaufmann Publishers, SanMateo (1993)

    Google Scholar 

  16. Skalak, D.B.: Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithm. In: Proceedings of the International Conference on Machine Learning, pp. 293–301 (1994)

    Google Scholar 

  17. Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18-59-96, Carnegie Mellon University, Pittsburgh (1996)

    Google Scholar 

  18. Wilson, D.R., Martinez, T.R.: Reduction Techniques for Instance-based Learning Algorithm. Machine Learning 33(3), 257–286 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czarnowski, I., Jędrzejowicz, P. (2010). An Agent-Based Simulated Annealing Algorithm for Data Reduction. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2010. Lecture Notes in Computer Science(), vol 6071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13541-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13541-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13540-8

  • Online ISBN: 978-3-642-13541-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics