• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Li Weijiang, Zhao Tiejun, Wang Xiangang. Context-Sensitive Query Expansion[J]. Journal of Computer Research and Development, 2010, 47(2): 300-304.
Citation: Li Weijiang, Zhao Tiejun, Wang Xiangang. Context-Sensitive Query Expansion[J]. Journal of Computer Research and Development, 2010, 47(2): 300-304.

Context-Sensitive Query Expansion

More Information
  • Published Date: February 14, 2010
  • The effectiveness of information retrieval (IR) systems is influenced by the degree of term overlap between user queries and relevant documents. Query-document term mismatch, whether partial or total, is a fact that must be dealt with by IR systems. query expansion (QE) is one method for dealing with term mismatch. Classical query expansion techniques such as the local context analysis make use of term co-occurrence statistics to incorporate additional contextual terms for enhancing passage retrieval. However, relevant contextual terms do not always co-occur frequently with the query terms and vice versa. Hence the use of such methods often brings in noise, which leads to reduced precision. On the basis of analyzing the process of producing query, the authors propose a new method of query expansion on the basis of context and global information. At the same time, the expansion terms are selected according to their relation with the whole query. Additionally, the position information between terms is considered. The experiment result on TREC data collection shows that the method proposed outperforms the language model without expansion by 5%~19%. Compared with the popular approach of query expansion, pseudo feedback, the method has the competitive average precision.
  • Related Articles

    [1]Wang Jieting, Qian Yuhua, Li Feijiang, Liu Guoqing. Support Vector Machine with Eliminating the Random Consistency[J]. Journal of Computer Research and Development, 2020, 57(8): 1581-1593. DOI: 10.7544/issn1000-1239.2020.20200127
    [2]Feng Chang, Liao Shizhong. Model Selection for Gaussian Kernel Support Vector Machines in Random Fourier Feature Space[J]. Journal of Computer Research and Development, 2016, 53(9): 1971-1978. DOI: 10.7544/issn1000-1239.2016.20150489
    [3]Hua Xiaopeng, Ding Shifei. Locality Preserving Twin Support Vector Machines[J]. Journal of Computer Research and Development, 2014, 51(3): 590-597.
    [4]Guo Husheng, Wang Wenjian. A Support Vector Machine Learning Method Based on Granule Shift Parameter[J]. Journal of Computer Research and Development, 2013, 50(11): 2315-2324.
    [5]Ding Lizhong and Liao Shizhong. Approximate Model Selection on Regularization Path for Support Vector Machines[J]. Journal of Computer Research and Development, 2012, 49(6): 1248-1255.
    [6]Xu Peng, Liu Qiong, and Lin Sen. Internet Traffic Classification Using Support Vector Machine[J]. Journal of Computer Research and Development, 2009, 46(3): 407-414.
    [7]Xiong Jinzhi, Yuan Huaqiang, Peng Hong. A General Formulation of Polynomial Smooth Support Vector Machines[J]. Journal of Computer Research and Development, 2008, 45(8): 1346-1353.
    [8]Li Yingxin and Ruan Xiaogang. Feature Selection for Cancer Classification Based on Support Vector Machine[J]. Journal of Computer Research and Development, 2005, 42(10): 1796-1801.
    [9]Liu Xiangdong, Luo Bin, and Chen Zhaoqian. Optimal Model Selection for Support Vector Machines[J]. Journal of Computer Research and Development, 2005, 42(4): 576-581.
    [10]Wu Gaowei, Tao Qing, Wang Jue. Support Vector Machines Based on Posteriori Probability[J]. Journal of Computer Research and Development, 2005, 42(2): 196-202.

Catalog

    Article views (1120) PDF downloads (639) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return