Skip to main content

Learning by Discovering Conflicts

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2003)

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

  • 1047 Accesses

Abstract

The paper describes a novel approach to inductive learning based on a ‘conflict estimation based learning’ (CEL) algorithm. CEL is a new learning strategy, and unlike conventional methods CEL does not construct explicit abstractions of the target concept. Instead, CEL classifies unknown examples by adding them to each class of the training examples and measuring how much noise is generated. The class that results in the least noise, i.e., the class that least conflicts with the given example is chosen as the output. In this paper, we describe the underlying principles behind the CEL algorithm, a methodology for its construction, and then summarize convincing empirical evidence that suggests that CEL can be a perfect solution in real-world decision making applications.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Quinland, J. Q., Induction of decision trees, Machine Learning, 1 (1986) 81–106.

    Google Scholar 

  2. Lippmann, R., Pattern Classification Using Neural Networks, IEEE Commun. Mag., Nov. (1989) 47–64.

    Google Scholar 

  3. Rivest, R., Learning decision lists, Machine Learning, 2 (1987) 229–246.

    Google Scholar 

  4. Aha, D., Kibler, D., and Albert, M., Instance-based learning algorithms, Machine Lerning 7 (1991) 37–66.

    Google Scholar 

  5. Lashkia, G., A Noise Filtering Method for Inductive Concept Learning, Proc. of Artificial Intelligence, AI’02, (2002) 79–89.

    Google Scholar 

  6. Wilson, D., and Martinez, T., Reduction techniques for instance-based learning algorithms, Machine Learning, 38 (2000) 257–286.

    Article  MATH  Google Scholar 

  7. Hand, D., Mannila, H., Smyth, P., Principles of data mining, The MIT Press (2001).

    Google Scholar 

  8. Vapnik, V., An overview of statistical learning theory, IEEE Trans. Neural Networks, Vol. 10, No. 5, (2001) 988–999.

    Article  Google Scholar 

  9. Gazula S., and Kabuka, M., Disign of Supervised Classifiers Using Boolean Neural Networks, IEEE Trans. PAMI, Vol. 17, No. 12 (1995) 1239–1245.

    Article  Google Scholar 

  10. Denceux, T., Analysis of Evidence-Theoretic Decision Rules for Pattern Classification, Pattern Recognition, Vol. 30, No. 7, (1997) 1095–1127.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lashkia, G.V., Anthony, L. (2003). Learning by Discovering Conflicts. In: Xiang, Y., Chaib-draa, B. (eds) Advances in Artificial Intelligence. Canadian AI 2003. Lecture Notes in Computer Science, vol 2671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44886-1_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-44886-1_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44886-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics