Using multiple query representations in patent prior-art search |
| |
| Authors: | Dong Zhou Mark Truran Jianxun Liu Sanrong Zhang |
| |
| Institution: | 1. Key Laboratory of Knowledge Processing and Networked Manufacturing & School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, Hunan, China
2. School of Computing, Teesside University, Middlesbrough, UK
|
| |
| Abstract: | Before a patent application is made, it is important to search the appropriate databases for prior-art (i.e., pre-existing patents that may affect the validity of the application). Previous work on prior-art search has concentrated on single query representations of the patent application. In the following paper, we describe an approach which uses multiple query representations. We evaluate our technique using a well-known test collection (CLEF-IP 2011). Our results suggest that multiple query representations significantly outperform single query representations. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
