Query-Sensitive Similarity Measures for Information Retrieval

被引:0
|
作者
Anastasios Tombros
C.J. van Rijsbergen
机构
[1] University of Glasgow,Department of Computing Science
来源
关键词
Information retrieval; Document clustering; Similarity measures; Nearest neighbor searching;
D O I
暂无
中图分类号
学科分类号
摘要
The application of document clustering to information retrieval has been motivated by the potential effectiveness gains postulated by the cluster hypothesis. The hypothesis states that relevant documents tend to be highly similar to each other and therefore tend to appear in the same clusters. In this paper we propose an axiomatic view of the hypothesis by suggesting that documents relevant to the same query (co-relevant documents) display an inherent similarity to each other that is dictated by the query itself. Because of this inherent similarity, the cluster hypothesis should be valid for any document collection. Our research describes an attempt to devise means by which this similarity can be detected. We propose the use of query-sensitive similarity measures that bias interdocument relationships toward pairs of documents that jointly possess attributes expressed in a query. We experimentally tested three query-sensitive measures against conventional ones that do not take the query into account, and we also examined the comparative effectiveness of the three query-sensitive measures. We calculated interdocument relationships for varying numbers of top-ranked documents for six document collections. Our results show a consistent and significant increase in the number of relevant documents that become nearest neighbors of any given relevant document when query-sensitive measures are used. These results suggest that the effectiveness of a cluster-based information retrieval system has the potential to increase through the use of query-sensitive similarity measures.
引用
收藏
页码:617 / 642
页数:25
相关论文
共 50 条
  • [1] Query-sensitive similarity measures for information retrieval
    Tombros, A
    van Rijsbergen, CJ
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2004, 6 (05) : 617 - 642
  • [2] A proposed query-sensitive similarity measure for information retrieval
    Zolghadri-Jahromi, M.
    Valizadeh, M. R.
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B-ENGINEERING, 2006, 30 (B2): : 171 - 180
  • [3] Probabilistic co-relevance for query-sensitive similarity measurement in information retrieval
    Na, Seung-Hoon
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2013, 49 (02) : 558 - 575
  • [4] Query-sensitive similarity measure for content-based image retrieval
    Zhou, Zhi-Hua
    Dai, Hong-Bin
    [J]. ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2006, : 1211 - +
  • [5] Query-sensitive embeddings
    Athitsos, Vassilis
    Hadjieleftheriou, Marios
    Kollios, George
    Sclaroff, Stan
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2007, 32 (02):
  • [6] Probability model of sensitive similarity measures in information retrieval
    Gu, Xiaolong
    Zhang, Jie
    [J]. INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2020, 17 (01):
  • [7] Query-sensitive similarity measure for content-based image retrieval using meta-heuristic algorithm
    Alsmadi, Mutasem K.
    [J]. JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2018, 30 (03) : 373 - 381
  • [8] Query-sensitive ray shooting
    Mitchell, JSB
    Mount, DM
    Suri, S
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (04) : 317 - 347
  • [9] Query-sensitive feature selection for lazy learners
    Tong, Xin
    Gu, Mingyang
    [J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DATA MINING, VOLS 1 AND 2, 2007, : 59 - 65
  • [10] PICTURE INFORMATION MEASURES FOR SIMILARITY RETRIEVAL
    CHANG, SK
    YANG, CC
    [J]. COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 23 (03): : 366 - 375