The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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 evaluates weighted queries and documents effectively, and avoids the problems of the previous methods. kb‐ebm provides high quality document rankings by using term dependence information from is‐a hierarchies The performance experiments show that the proposed method closely simulates human behaviour.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A spreading-activation theory of semantic processing.
Collins, A. M., & Loftus, E. F. (1975) · Psychological Review · doi:10.1037/0033-295x.82.6.407 · Cited by 8,141
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Moran, P. A. P., & Kendall, M. G. (1951) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2980903 · Cited by 2,573
Semantic Information Processing
Minsky, M. (1968) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,193
Development and application of a metric on semantic nets
Rada, R., Mili, H., Bicknell, E., & Blettner, M. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.24528 · Cited by 1,824
Minimization of Boolean Functions*
McCluskey, E. J. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03835.x · Cited by 1,230
Extended Boolean information retrieval
Salton, G., Fox, E. A., & Wu, H. (1983) · Communications of the ACM · doi:10.1145/182.358466 · Cited by 1,054
Information retrieval by constrained spreading activation in semantic networks
Cohen, P. R., & Kjeldsen, R. (1987) · Information Processing & Management · doi:10.1016/0306-4573(87)90017-3 · Cited by 308
A graphical thesaurus-based information retrieval system
McMath, C., Tamaru, R. S., & Rada, R. (1989) · International Journal of Man-Machine Studies · doi:10.1016/0020-7373(89)90024-2 · Cited by 46
Cited by
Using Information Content to Evaluate Semantic Similarity in a Taxonomy
Resnik, P. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9511007 · Cited by 3,193
Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy
Jiang, J. J., & Conrath, D. W. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9709008 · Cited by 2,743
Resnik, P. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.514 · Cited by 2,047
Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Budanitsky, A., & Hirst, G. (2006) · Computational Linguistics · doi:10.1162/089120106776173093 · Cited by 1,448
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Turney, P. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_42 · Cited by 1,285
Metadata
- Authors
- HO LEE, J., HO KIM, M., & JOON LEE, Y.
- Venue
- Journal of Documentation
- Publisher
- Emerald
- Published
- 1993-02-01
- Volume
- 49
- Issue
- 2
- Pages
- 188-207
- ISSN
- 0022-0418 (ISSN-L)
- OpenAlex
- W2082889357
- Cited by
- 276
- References
- 9
- FWCI
- 9.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.