Skip to main content

Dealing with Large Volumes of Data

  • Chapter
  • First Online:
Principles of Data Mining

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 359k Accesses

Abstract

This chapter is concerned with issues relating to large volumes of data, in particular the ability of classification algorithms to scale up to be usable for such volumes.

Some of the ways in which a classification task could be distributed over a local area network of personal computers are described and a case study using an extended version of the Prism rule induction algorithm known as PMCRI is presented. Techniques for evaluating a distributed system of this kind are then illustrated.

The issue of streaming data is also considered, leading to a discussion of a classification algorithm that lends itself well to an incremental approach: the Naïve Bayes classifier.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Irvine: University of California, Department of Information and Computer Science. http://www.ics.uci.edu/~mlearn/MLRepository.html .

    Google Scholar 

  2. Catlett, J. (1991). Megainduction: machine learning on very large databases. Sydney: University of Technology.

    MATH  Google Scholar 

  3. Provost, F. (2000). Distributed data mining: scaling up and beyond. In H. Kargupta & P. Chan (Eds.), Advances in distributed data mining. San Mateo: Morgan Kaufmann.

    Google Scholar 

  4. Stahl, F., Bramer, M., & Adda, M. (2009). PMCRI: a parallel modular classification rule induction framework. In LNAI: Vol. 5632. Machine learning and data mining in pattern recognition (pp. 148–162). Berlin: Springer.

    Chapter  Google Scholar 

  5. Shafer, J. C., Agrawal, R., & Mehta, M. (1996). SPRINT: a scalable parallel classifier for data mining. In Twenty-second international conference on very large data bases.

    Google Scholar 

  6. Stahl, F. T., Bramer, M. A., & Adda, M. (2010). J-PMCRI: a methodology for inducing pre-pruned modular classification rules. In Artificial intelligence in theory and practice III (pp. 47–56). Berlin: Springer.

    Chapter  Google Scholar 

  7. Stahl, F., & Bramer, M. (2013). Computationally efficient induction of classification rules with the PMCRI and J-PMCRI frameworks. Knowledge based systems. Amsterdam: Elsevier.

    Google Scholar 

  8. Nolle, L., Wong, K. C. P., & Hopgood, A. (2002). DARBS: a distributed blackboard system. In M. A. Bramer, F. Coenen, & A. Preece (Eds.), Research and development in intelligent systems XVIII. Berlin: Springer.

    Google Scholar 

  9. Bifet, A., Holmes, G., Kirkby, R., & Pfahringer, B. (2010). MOA: massive online analysis, a framework for stream classification and clustering. Journal of Machine Learning Research, 99, 1601–1604.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag London Ltd.

About this chapter

Cite this chapter

Bramer, M. (2016). Dealing with Large Volumes of Data. In: Principles of Data Mining. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-7307-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-7307-6_13

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-7306-9

  • Online ISBN: 978-1-4471-7307-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics