1993
DOI: 10.1108/eb026913
|View full text |Cite
|
Sign up to set email alerts
|

Information Retrieval Based on Conceptual Distance in Is‐a Hierarchies

Abstract: There have been several document ranking methods to calculate the conceptual distance or closeness between a Boolean query and a document. Though they provide good retrieval effectiveness in many cases, they do not support effective weighting schemes for queries and documents and also have several problems resulting from inappropriate evaluation of Boolean operators. We propose a new method called Knowledge‐Based Extended Boolean Model (kb‐ebm) in which Salton's extended Boolean model is incorporated. kb‐ebm e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 198 publications
(13 citation statements)
references
References 17 publications
0
13
0
Order By: Relevance
“…Roughly, these relations denote domain, generalization, specialization and composition links. This approach could be generalized to all ontology having in its structure a semantic network as defined by [7]: broadly a set of concepts and semantic relations between these concepts. …”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Roughly, these relations denote domain, generalization, specialization and composition links. This approach could be generalized to all ontology having in its structure a semantic network as defined by [7]: broadly a set of concepts and semantic relations between these concepts. …”
Section: Resultsmentioning
confidence: 99%
“…proposed [11], [12], [13], [7] for disambiguating words in text. In our case, the finality is not mainly Word Sense Disambiguation (WSD) -for a complete survey of WSD, we refer the interested reader to the Senseval home page (http://www.senseval.org) -, however, we got inspired by the Pederson's approach described in [13] which uses an adapted Lesk [14] algorithm based on gloss overlaps between concepts (WordNet Synsets) for computing semantic similarity between concepts-senses.…”
Section: The Use Of Semantics In Information Retrievalmentioning
confidence: 99%
See 1 more Smart Citation
“…Most simply, two sets of GO terms can be compared by head to head matching where the similarity can be determined by the number of common annotations from both the sets [47]. Based on the GO hierarchy, the similarity of two GO terms can be defined as the minimum path length between them on the GO DAG [47,48]. A better alternative to the minimum path is to consider the Lowest Common Ancestor (LCA) for a pair of GO terms in the hierarchy, for which the Information Content (IC) is computed [49-51].…”
Section: Introductionmentioning
confidence: 99%
“…302 Hybrid methods: These approaches combine the information 303 gathering from ontology and statistical analysis results from 304 the corpus like in [28]. Also there is a recent survey in [26] 305 about these studies. The study in [22] is also used WordNet to build a semantic 369 proximity matrix based on Omiotis [23], which is a where j 0 is the gram or kernel matrix of the corpus in BOW repre-384 sentation and k is the decay factor.…”
mentioning
confidence: 98%