Utilizing Sub-topic Units for Patent Prior-Art Search
Utilizing Sub-topic Units for Patent Prior-Art Search作者机构:Key Laboratory of Knowledge Processing and Networked Manufacturing & School of Computer Science and Engineering Hunan University of Science and Technology
出 版 物:《Chinese Journal of Electronics》 (电子学报(英文))
年 卷 期:2014年第23卷第3期
页 面:480-483页
核心收录:
学科分类:081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:supported by the National Natural Science Foundation of China(No.61300129,No.61272063 and No.61100054) the Project Sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars,State Education Ministry(No.1792) Excellent Youth Foundation of Hunan Scientific Committee(No.11JJ1011) Hunan Provincial Natural Science Foundation of China(No.12JJ6064 and 12JJB009) Scientific Research Fund of Hunan Provincial Education Department of China(No.11B048 and No.12K105)
主 题:Patent information retrieval Sub-topic units Multiple query representations Collaborative filtering Patent ranking
摘 要:One of the defining challenges in patent prior-art search is the problem of representing a long, technical document as a query. Previously work on this problem has concentrated on single query representations of the patent application. In the following paper, we describe an approach which uses multiple query representations generated from semantically coherent passages extracted from patent documents. We validate our technique in an experiment using the CLEF-IP 2011 patent search collection. Our system achieves statistically significant improvements over various state-of-art query generation techniques.