Similarity graphs

12Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the issue here is conceptual resemblance. The basis is a knowledge base defining major concepts of the domain and may include taxonomic and ontological domain knowledge. The challenge for support of queries in this context is an evaluation principle that on the one hand respects the formation rules for concepts in the concept language and on the other is sufficiently efficient to candidate as a realistic principle for query evaluation. We present and discuss principles where efficiency is obtained by reducing the matching problem - which basically is a matter of conceptual reasoning - to numerical similarity computation.

Cite

CITATION STYLE

APA

Knappe, R., Bulskov, H., & Andreasen, T. (2003). Similarity graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2871, pp. 668–672). Springer Verlag. https://doi.org/10.1007/978-3-540-39592-8_97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free