Skip to main content

Introduction

  • Chapter

Part of the book series: Advances in Computer Vision and Pattern Recognition ((ACVPR))

Abstract

Data mining aims at generating abstraction from large datasets through efficient algorithms. Some approaches to achieve efficiency are to arrive at valid representative subsets of original data and feature sets. All further data mining analysis can be based only on these representative subsets leading to significant reduction in storage space and time. Another important direction is to compress the data by some manner and operate in the compressed domain directly. In this chapter, we present a discussion on major data mining tasks such as clustering, classification, dimensionality reduction, association rule mining, and data compression; all these tasks may be viewed as some kind of data abstraction or compaction tasks. We further discuss various aspects of compression schemes both in abstract sense and as practical implementation. We provide a brief summary of content of each chapter of the book and discuss its overall organization. We provide literature for further study at the end.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • J. Han, M. Kamber, J. Pei, Data Mining: Concepts and Techniques, 3rd edn. (Morgan Kaufmann, San Mateo, 2011)

    Google Scholar 

  • D.J. Hand, H. Mannila, P. Smyth, Principles of Data Mining (MIT Press, Cambridge, 2001)

    Google Scholar 

  • A. Rajaraman, J.D. Ullman, Mining Massive Datasets (Cambridge University Press, Cambridge, 2011)

    Google Scholar 

  • D. Salomon, G. Motta, D. Bryant, Handbook of Data Compression (Springer, Berlin, 2009)

    Google Scholar 

  • K. Sayood, Introduction to Data Compression, 2nd edn. (Morgan Kaufmann, San Mateo, 2000)

    Google Scholar 

  • P.-N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Pearson, Upper Saddle River, 2005)

    Google Scholar 

  • I.H. Witten, E. Frank, M.A. Hall, Data Mining: Practical Machine Learning Tools and Techniques, 3rd edn. (Morgan Kaufmann, San Mateo, 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Ravindra Babu, T., Narasimha Murty, M., Subrahmanya, S.V. (2013). Introduction. In: Compression Schemes for Mining Large Datasets. Advances in Computer Vision and Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-4471-5607-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5607-9_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5606-2

  • Online ISBN: 978-1-4471-5607-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics