Skip to main content

Abstract

Case-based reasoning is a knowledge processing concept that has shown success in various problem classes. One key challenge in CBR is the construction of a measure that adequately models the similarity between two cases. Typically, a similarity measure consists of a set of feature-specific distance functions coupled with an underlying feature weighting (importance) scheme. While the definition of the distance functions is often straightforward, the estimation of the weighting scheme requires a deep understanding of the domain and the underlying connections.

The paper in hand addresses this problem. It shows how discrimination knowledge, which is coded within an already solved classification problem, can be transformed towards a similarity measure. Moreover, it demonstrates our approach at the problem of diagnosing heart diseases.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

  • Aha, D. (1992): Tolerating noisy, irrelevant, and novel attributes in instancebased learning algorithms. International Journal of Man-Machine Studies.

    Google Scholar 

  • Aha, D. W. (1991): Case-Based Learning Algorithms. Proceedings of the 1991 DARPA Case-Based Reasoning Workshop, Morgan Kaufmann.

    Google Scholar 

  • Aha, D. W. and Bankert, R. L. (1994): Feature Selection for Case-Based Classification of Cloud Types: An Empirical Comparison. Proceedings of the AAAI-94 Workshop on Case-Based Reasoning, AAAI Press, Seattle, WA, pp. 106–112.

    Google Scholar 

  • Aha, D. W. and Goldstone, R. (1992): Concept learning and flexible weighting. Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society.

    Google Scholar 

  • Aha, D. W., Kibler, D., and Albert, M. K. (1991): Instance-Based Learning Algorithms. Machine Learning, 6, 37–66.

    Google Scholar 

  • Bonzano, A., Cunningham, P., and Smyth, B. (1997): Using introspective learning to improve retrieval in cbr: A case study in air traffic control. Proceedings of the Second ICCBR Conference.

    Google Scholar 

  • Dash, M. and Liu, H. (1997): Feature Selection for Classification. Intelligent Data Analysis.

    Google Scholar 

  • Giraud-Carrier, C. and Martinez, T. (1995): An Efficient Metric for Heterogeneous Inductive Learning Applications in the Attribute-Value Language. Intelligent Systems, pp. 241–250.

    Google Scholar 

  • Hosmer, D. W. and Lemeshow, S. (1989): Applied Logistic Regression. John Wiley & Sons, New York.

    Google Scholar 

  • Kira, K. and Rendell, L. (1992): A practical approach to feature selection. Proceedings of the Ninth International Conference on Machine Learning.

    Google Scholar 

  • Kolodner, J. (1994): Case-Based Reasoning. Morgan Kaufmann.

    Google Scholar 

  • Michalski, R., Carbonell, J. G., and Mitchell, T. (Eds.) (1983): Machine Learning: An Artificial Intelligence Approach. Vol. 1, Tioga, Palo Alto, California.`

    Google Scholar 

  • Mitchell, T. M. (1982): Generalization as search. Artificial Intelligence, 18 (2), 203–226.

    Article  Google Scholar 

  • Myers, R. H. (1986): Classical and Modern Regression with Applications. Duxbury Press, Boston.

    Google Scholar 

  • Pao, Y.-H. (1989): Adaptive Pattern Recognition and Neural Networks. Addison-Wesley, Reading, MA.

    Google Scholar 

  • Quinlan, J. R. (1986): Induction of Decision Trees. Machine Learning, 1(1), 81–106.

    Google Scholar 

  • Richter, M. M. (1995): The Knowledge Contained in Similarity Measures. Some remarks on the invited talk given at ICCBR’95 in Sesimbra, Portugal.

    Google Scholar 

  • Salzberg, S. L. (1991): A nearest hyperrectangle learning method. Machine Learning.

    Google Scholar 

  • Sarle, W. S. (1994): Neural Networks and Statistical Models. Proceedings of the Nineteenth Annual SAS Users Group International Conference, SAS Institute Inc., Cary, NC, USA, pp. 1538–1550.

    Google Scholar 

  • Weisberg, S. (1985): Applied Linear Regression. John Wiley & Sons, New York.

    Google Scholar 

  • Wess, S. and Globig, C. (1994): Case-Based and Symbolic Classification — A Case Study. In: S. Wess, K.-D. Althoff, and M. M. Richter (Eds.): Topics in Case-Based Reasoning, LNAI 837, Springer.

    Google Scholar 

  • Wilson, D. R. and Martinez, T. R. (1997): Improved Heterogeneous Distance Functions. Journal of Artificial Intelligence Research.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stein, B., Niggemann, O., Husemeyer, U. (2000). Learning Complex Similarity Measures. In: Decker, R., Gaul, W. (eds) Classification and Information Processing at the Turn of the Millennium. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57280-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57280-7_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67589-1

  • Online ISBN: 978-3-642-57280-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics