Skip to main content

Some Elements of Machine Learning

Extended Abstract

  • Conference paper
  • First Online:

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

Abstract

This talk will revisit some important elements of ML lore, focusing on the design of classifier-learning systems. Within ML, the key desiderata for such systems have been predictive accuracy and interpretability. Although Provost, Fawcett and Kohavi (1998) have shown that accuracy alone is a poor metric for comparing learning systems, it is still important in most real-world applications. The quest for intelligibility, stressed from earliest days by Michie, Michalski and others, is now crucial for those data-mining applications whose main objective is insight. Scalability is also vital if the learning system is to be capable of analyzing the burgeoning numbers of instances and attributes in commercial and scientific databases.

This extended abstract also appears in the Proceedings of the Sixteenth International Conference on Machine Learning, published by Morgan Kaufmann.

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. Domingos, P. (1998) A process-oriented heuristic for model selection. Proceedings ICML’98, 127–135. San Francisco: Morgan Kaufmann.

    Google Scholar 

  2. Freund, Y., and Schapire, R.E. (1997) A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119–139.

    Article  MATH  MathSciNet  Google Scholar 

  3. Kearns, M., Mansour, Y., Ng, A.Y., and Ron, D. (1997) An experimental and theoretical comparison of model selection methods. Machine Learning, 27, 1, 7–50.

    Article  Google Scholar 

  4. Kohavi, R. (1996) Scaling up the accuracy of naive-Bayes classifiers: a decision-tree hybrid. Proceedings KDD-96.

    Google Scholar 

  5. Provost, F., Fawcett, T., and Kohavi, R. (1998) The case against accuracy estimation for comparing induction algorithms. Proceedings ICML’98, 445–453. San Francisco: Morgan Kaufmann.

    Google Scholar 

  6. Quinlan, J.R., and Cameron-Jones, R.M. (1995) Oversearchinhg and layered search in empirical learning. Proceedings IJCAI’95, 1019–1024. San Francisco: Morgan Kaufmann.

    Google Scholar 

  7. Webb, G. (1993) Systematic search for categorical attribute-value data-driven machine learning. Proceedings 6th Australian Joint Conference on Artificial Intelligence, 342–347. Singapore: World Scientific.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Quinlan, J.R. (1999). Some Elements of Machine Learning. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48751-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66109-2

  • Online ISBN: 978-3-540-48751-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics