Using query logs of USPTO patent examiners for automatic query expansion in patent searching

被引:1
|
作者
Wolfgang Tannebaum
Andreas Rauber
机构
[1] Vienna University of Technology,Institute of Software Technology and Interactive Systems
来源
Information Retrieval | 2014年 / 17卷
关键词
Patent searching; Query expansion; Query log analysis;
D O I
暂无
中图分类号
学科分类号
摘要
In the patent domain significant efforts are invested to assist researchers in formulating better queries, preferably via automated query expansion. Currently, automatic query expansion in patent search is mostly limited to computing co-occurring terms for the searchable features of the invention. Additional query terms are extracted automatically from patent documents based on entropy measures. Learning synonyms in the patent domain for automatic query expansion has been a difficult task. No dedicated sources providing synonyms for the patent domain, such as patent domain specific lexica or thesauri, are available. In this paper we focus on the highly professional search setting of patent examiners. In particular, we use query logs to learn synonyms for the patent domain. For automatic query expansion, we create term networks based on the query logs specifically for several USPTO patent classes. Experiments show good performance in automatic query expansion using these automatically generated term networks. Specifically, with a larger number of query logs for a specific patent US class available the performance of the learned term networks increases.
引用
收藏
页码:452 / 470
页数:18
相关论文
共 50 条
  • [21] Query recommendation using query logs in search engines
    BaezaYates, R
    Hurtado, C
    Mendoza, M
    CURRENT TRENDS IN DATABASE TECHNOLOGY - EDBT 2004 WORKSHOPS, PROCEEDINGS, 2004, 3268 : 588 - 596
  • [22] Query clustering using user-query logs
    Jia, Rongfei
    Jin, Maozhong
    Wang, Xiaobo
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2010, 36 (04): : 500 - 503
  • [23] Query recommendation using query logs in search engines
    Baeza-Yates, Ricardo
    Hurtado, Carlos
    Mendoza, Marcelo
    De Chile, Universidad
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3268 : 588 - 596
  • [24] A Framework for Automatic Query Expansion
    Imran, Hazra
    Sharan, Aditi
    WEB INFORMATION SYSTEMS AND MINING, 2010, 6318 : 386 - +
  • [25] A Probabilistic Query Suggestion Approach Without Using Query Logs
    Shaikh, Meher T.
    Pera, Maria S.
    Ng, Yiu-Kai
    2013 IEEE 25TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2013, : 633 - 639
  • [26] Automatic Discovery of Attribute Synonyms Using Query Logs and Table Corpora
    He, Yeye
    Chakrabarti, Kaushik
    Cheng, Tao
    Tylenda, Tomasz
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16), 2016, : 1429 - 1439
  • [27] Using multiple query representations in patent prior-art search
    Zhou, Dong
    Truran, Mark
    Liu, Jianxun
    Zhang, Sanrong
    INFORMATION RETRIEVAL, 2014, 17 (5-6): : 471 - 491
  • [28] Using multiple query representations in patent prior-art search
    Dong Zhou
    Mark Truran
    Jianxun Liu
    Sanrong Zhang
    Information Retrieval, 2014, 17 : 471 - 491
  • [29] Can firms avoid tough patent examiners through examiner-shopping? Strategic timing of citations in USPTO patent applications
    Barber, Benjamin
    Diestre, Luis
    STRATEGIC MANAGEMENT JOURNAL, 2022, 43 (09) : 1854 - 1871
  • [30] Managing patent examiners' workload by using patent application volume data
    Golodne, Daniel Marques
    da Silva, Alexandre Sousa
    WORLD PATENT INFORMATION, 2022, 68