Skip to main content
SpringerLink
Log in

CBET: A Case Base Exploration Tool

  • Machine Learning 3
  • Conference paper
  • First Online:
AI*IA 97: Advances in Artificial Intelligence (AI*IA 1997)

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

Included in the following conference series:

Abstract

CBET is a software tool for the interactive exploration of a case base. CBET is an integrated environment that provides a range of browsing and display functions that make possible knowledge extraction from a set of cases. CBET is motivated by an application to training firemen. Here cases describe past forest fire fighting interventions and CBET is used to detect dependencies between data, acquire practical planning competences, visualize complex data, clustering similar cases. In CBET well rooted Machine Learning techniques for selecting relevant features, clustering cases and forecasting unknown values have been adapted and reused for case base exploration.

This work has been partially supported by the EspritIV project CARICA #20401 (Cases Acquisition and Replay in Fire Campaign Ambiance).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agnar Aamodt and Enric Plaza. Case-based reasoning: foundational issues, methodological variations, and system approaches. AI Communications, 7(1):39–59, 1994.

    Google Scholar 

  2. David W. Aha, Dennis Kibler, and Mark K. Albert. Instance-based learning algorithms. Machine Learning, 6:37–66, 1991.

    Google Scholar 

  3. L. K. Branting. Techniques for the retrieval of structured cases. In Working Notes of the AAAI Spring Symposium on Case-Based Reasoning, Palo Alto, CA, 1990.

    Google Scholar 

  4. B. V. Dasarathy, editor. Nearest neighbor (NN) norms: NN pattern classification techniques. IEEE Computer Society Press, Los Alamitos, CA, 1991.

    Google Scholar 

  5. Usama Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth. From data mining to knowledge discovery in databases. AI Magazine, pages 37–54, fall 1996.

    Google Scholar 

  6. Douglas H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139–172, 1987.

    Google Scholar 

  7. G. John, R. Kohavi, and K. Pfleger. Irrelevant features and the subset selection problem. In Proceedings of the Eleventh International Machine Learning Conference, pages 121–129, New Brunswick, NJ, 1994. Morgan Kaufmann.

    Google Scholar 

  8. Anna Perini and Francesco Ricci. An interactive planning architecture. In M. Ghallab and A. Milani, editors, New directions in AI Planning, pages 273–283. IOS Press, 1996.

    Google Scholar 

  9. J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann, San Mateo, CA, 1993.

    Google Scholar 

  10. B. D. Ripley. Pattern recognition and neural networks. Cambridge U.P., 1996.

    Google Scholar 

  11. E.L. Rissland and J.J. Daniels. Using cbr to drive ir. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 400–407, Montreal, Canada, 1995.

    Google Scholar 

  12. David B. Skalak. Prototype and feature selection by sampling and random mutation hill climbing algorithms. In Proceedings of the Eleventh International Machine Learning Conference, pages 293–301, New Brunswick, NJ, 1994. Morgan Kaufmann.

    Google Scholar 

  13. Craig Stanfill and David Waltz. Toward memory-based reasoning. Communication of ACM, 29:1213–1229, 1986.

    Google Scholar 

  14. Sholomon M. Weiss and Casimir A. Kulikowski. Computer Systems that Learn. Morgan Kaufmann, 1991.

    Google Scholar 

  15. Dietrich Wettschereck, Takao Mohri, and David W. Aha. A review and comparative evaluation of feature weighting methods for lazy learning algorithms. AI Review Journal, 11:273–314, 1997.

    Google Scholar 

  16. D. Randall Wilson and Tony R. Martinez. Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 11:1–34, 1997.

    Google Scholar 

  17. Lei Xu, Adam Krzyzak, and Erkki Oja. Rival penalized competitive learning for cluster analysis, RBF net, and curve detection. IEEE Transaction on Neural Networks, 4(4):636–649, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto per la Ricerca Scientifica e Tecnologica, Via Sommarive, 38050, Povo (TN), Italy

    Paolo Avesani, Anna Perini & Francesco Ricci

Authors
  1. Paolo Avesani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Perini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Ricci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurizio Lenzerini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avesani, P., Perini, A., Ricci, F. (1997). CBET: A Case Base Exploration Tool. In: Lenzerini, M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science, vol 1321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63576-9_126

Download citation

  • DOI: https://doi.org/10.1007/3-540-63576-9_126

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69601-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation