Skip to main content

Convex Hulls in Concept Induction

  • Conference paper
  • First Online:
Methodologies for Knowledge Discovery and Data Mining (PAKDD 1999)

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

Included in the following conference series:

  • 1021 Accesses

Abstract

This paper investigates modelling concepts as a few, large convex hulls rather than as many, small, axis-orthogonal divisions as is done by systems which currently dominate classification learning. It is argued that this approach produces classifiers which have less strong hypothesis language bias and which, because of the fewness of the concepts induced, are more understandable. The design of such a system is described and its performance is investigated.Convex hulls are shown to be a useful inductive generalisation technique offering rather different biases than well-known systems such as C4.5 and CN2. The types of domains where convex hulls can be usefully employed are described.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.W. Aha, D. Kibler, and M.K. Albert. Instance-based learning algorithms. Machine Learning 6:37–66, 1991.

    Google Scholar 

  2. C.B. Barber, D.P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. Submitted to ACM Trans. Mathematical Software, May 1995.

    Google Scholar 

  3. L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone. Classification and Regression Wadsworth Int. Group, Belmont, California, 1984. 306

    Google Scholar 

  4. C.E. Brodley and P.E. Utgoff. Multivariate decision trees. Machine Learning 19:45–77, 1995.

    MATH  Google Scholar 

  5. P. Clark and Tim Niblett. The cn2 inductio algorithm. Machine learning 3:261–284, 1989.

    Google Scholar 

  6. B. Grünbaum. Measures of symmetry for convex sets. In Proc. 7th Symposium in Pure Mathematics of the AMS pages 233–270, 1961.

    Google Scholar 

  7. D. Heath, S. Kasif, and S. Salzberg. Learning oblique decision trees. In Proc. 13th IJCALI pages 1002–1007, Morgan Kaufman, 1993

    Google Scholar 

  8. C. Matheus and L.A. Rendell. Constructive induction on decision trees. In Proceedings of IJCAI pages 645–650, 1989.

    Google Scholar 

  9. Michalski, R.S., Mozetic, I., Hong, and N.J. Lavrac. The multi-purpose incremental learning system aq15 and its testing and application to three medical domains. In Proceedings of the Fifth National Conference on Artificial Intelligence pages 1041–1045. Morgan Kaufman, 1986.

    Google Scholar 

  10. P.M. Murphy and D.W. Aha. The uci repository of machine learning databases, http://www.ics.uci.edu/mlearn/mlrepository.html.

  11. S.K. Murthy, S. Kasif, and S. Salzberg. A system for induction of oblique decision trees. Journal of Artificial Intelligence Research 2:1–32, 1994.

    Article  MATH  Google Scholar 

  12. D.A. Newlands. Convex Hulls in Concept Induction. PhD thesis, School of Computing and Mathematics, Deakin University, Geelong 3217, Victoria, Australia, 1997. Available from http://www3.cm.deakin.edu.au/doug.

    Google Scholar 

  13. D.A. Newlands and G.I. Webb. Polygonal inductive generalisation system. In Industrial and Engineering Applications of Artificial Intelligence and Expert Systems pages 587–592, 1995.

    Google Scholar 

  14. F.P. Preparata and M.I. Shamos. Computational Geometry. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1985.

    Google Scholar 

  15. J.R. Quinlan. C4.5 programs for Machine Learning. Morgan Kaufmann, San Mateo, California, 1995.

    Google Scholar 

  16. R.B. Rao, D. Gordon, and W. Spears. For every generalisation action, is there really an equal and opposite reaction? analysis of the conservation law for generalisation performance. In The 12th International Conference on Machine Learning pages 471–479, 1995.

    Google Scholar 

  17. C. Schaffer. A conservation law for generalisation performance. In Machine Learning: Proc. of the 11th International Conference. Morgan Kaufmann, San Francisco, 1993.

    Google Scholar 

  18. J. Schell and B. Leelarthaepin. Physical Fitness Assessment. Leelar Biomediscience Services, Box 283, Matraville 2036, NSW, Australia, 1994.

    Google Scholar 

  19. Software Development Group, Geometry Center, 1300 South Second Street, Suite 500, Minneapolis, MN 55454, USA. Geomview Manual.

    Google Scholar 

  20. P.E. Utgoff and C.E. Brodley. Linear machine decision trees. Technical report, U. Mass. at Amherst, 1991.

    Google Scholar 

  21. G.I. Webb. Recent progress in learning decision lists by prepending inferred rules. In Second Singapore International Conference on Intelligent Systems, pages B280–B285, 1994.

    Google Scholar 

  22. D.H. Wolpert. Off-training set error and a priori distinctions between learning algorithms. Technical Report SFI TR 95-01-00, Santa Fe Institute, 1995.

    Google Scholar 

  23. S.P. Yip. Empirical Attribute Space Refinement in Classification Learning. PhD thesis, Deaki University, Geelong, Victoria 3217, Australia, 1995.

    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

Newlands, D.A., Webb, G.I. (1999). Convex Hulls in Concept Induction. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-48912-6_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65866-5

  • Online ISBN: 978-3-540-48912-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics