Skip to main content

Incremental Induction of Belief Decision Trees in Averaging Approach

  • Conference paper
Database and Expert Systems Applications (DEXA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8644))

Included in the following conference series:

Abstract

This paper extends the belief decision tree learning method to an incremental mode where the tree structure could change when new data come. This so-called incremental belief decision tree is a new classification method able to learn new instances incrementally, by updating and restructuring an existing belief decision tree. The induced decision tree is originally built in a batch mode under an uncertain framework, by means of the belief function theory, then updated by incorporating instances in a one-by-one basis once a new training set is available.

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. Elouedi, Z., Mellouli, K., Smets, P.: Belief decision trees: Theoretical foundations. International Journal of Approximate Reasoning, IJAR 28, 91–124 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Quinlan, J.R.: C4.5: Programs for Machine learning. Morgan Kaufman, San Mateo (1993)

    Google Scholar 

  3. Kalles, D., Morris, T.: Efficient Incremental Induction of Decision Trees. Machine Learning 1, 2–3 (1995)

    Google Scholar 

  4. Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  5. Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66, 191–236 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Utgoff, P.E.: ID5: An incremental ID3. In: Proceedings of the Fifth International Conference on Machine Learning, pp. 107–120. Morgan Kaufmann (1988)

    Google Scholar 

  7. Utgoff, P.E.: An improved algorithm for incremental induction of decision trees. In: Proceedings of the 11th International Conference on Machine Learning, pp. 318–325. Morgan Kaufmann (1994)

    Google Scholar 

  8. Wang, T., Li, Z., Yan, Y., Chen, H.: An incremental fuzzy decision tree classification method for mining data streams. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, pp. 91–103. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Wanke, C., Greenbaum, D.: Incremental, probabilistic decision making for en route traffic management. Air Traffic Control Quarterly 15, 299–319 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Trabelsi, S., Elouedi, Z., El Aroui, M. (2014). Incremental Induction of Belief Decision Trees in Averaging Approach. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8644. Springer, Cham. https://doi.org/10.1007/978-3-319-10073-9_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10073-9_39

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10072-2

  • Online ISBN: 978-3-319-10073-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics