Skip to main content
SpringerLink
Log in

Data Reduction for Instance-Based Learning Using Entropy-Based Partitioning

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

Abstract

Instance-based learning methods such as the nearest neighbor classifier have proven to perform well in pattern classification in several fields. Despite their high classification accuracy, they suffer from a high storage requirement, computational cost, and sensitivity to noise. In this paper, we present a data reduction method for instance-based learning, based on entropy-based partitioning and representative instances. Experimental results show that the new algorithm achieves a high data reduction rate as well as classification accuracy.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, H., Hussain, F., Tan, C.L., Dash, M.: Discretization: an enabling technique. Data Mining Knowledge Discovery 6, 393–423 (2002)

    Article  MathSciNet  Google Scholar 

  2. Cano, J.R., Herrera, F., Lozano, M.: On the combination of evolutionary algorithms and strafitied strategies for training set selection in data mining. Applied Soft Computing (2005) (In Press, Correted Proof)

    Google Scholar 

  3. Datta, P., Kibler, D.: Learning prototypical concept description. In: Proceedings of the 12th International Conference on Machine Learning, pp. 158–166 (1995)

    Google Scholar 

  4. Datta, P., Kibler, D.: Symbolic nearest mean classifier. In: Proceedings of the 14th National Conference of Artificial Intelligence, pp. 82–87 (1997)

    Google Scholar 

  5. Lam, W., Keung, C.L., Ling, C.X.: Learning good prototypes for classification using filtering and abstraction of instances. Pattern Recognition 35, 1491–1506 (2002)

    Article  MATH  Google Scholar 

  6. Sanchez, J.S.: High training set size reduction by space partitioning and prototype abstraction. Pattern Recognition 37, 1561–1564 (2004)

    Article  Google Scholar 

  7. Dasarath, B.V.: Nearest Neighbor Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  8. Wilson, D.R., Martinez, T.R.: Reduction Techniques for instance-based learning algorithms. Mach. Learning. 38, 257–286 (2000)

    Article  MATH  Google Scholar 

  9. Cano, J.R., Herrera, F., Lozano, M.: Using evolutionary algorithms as instance selection for data reduction in kdd: an experimental study. IEEE Transactions on Evolutionary Computation 7(6), 561–575 (2003)

    Article  Google Scholar 

  10. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  11. Merz, C.J., Murphy, P.M.: UCI Repository of Machine Learning Databases, Internet http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Hanyang University, 17 Haengdang-Dong, Sungdong-Ku, Seoul, 133-791, South Korea

    Seung-Hyun Son & Jae-Yearn Kim

Authors
  1. Seung-Hyun Son
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jae-Yearn Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Son, SH., Kim, JY. (2006). Data Reduction for Instance-Based Learning Using Entropy-Based Partitioning. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_63

Download citation

  • DOI: https://doi.org/10.1007/11751595_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation