The Community for Technology Leaders
Green Image
Issue No. 06 - June (2013 vol. 25)
ISSN: 1041-4347
pp: 1439-1443
Guoliang Li , Tsinghua Univsersity, Beijing
Ju Fan , Tsinghua University, Beijing
Yang Cao , State Intellectual Property Office of the PRC, Beijing
ABSTRACT
As an important operation for finding existing relevant patents and validating a new patent application, patent search has attracted considerable attention recently. However, many users have limited knowledge about the underlying patents, and they have to use a try-and-see approach to repeatedly issue different queries and check answers, which is a very tedious process. To address this problem, in this paper, we propose a new user-friendly patent search paradigm, which can help users find relevant patents more easily and improve user search experience. We propose three effective techniques, error correction, topic-based query suggestion, and query expansion, to improve the usability of patent search. We also study how to efficiently find relevant answers from a large collection of patents. We first partition patents into small partitions based to their topics and classes. Then, given a query, we find highly relevant partitions and answer the query in each of such highly relevant partitions. Finally, we combine the answers of each partition and generate top-$(k)$ answers of the patent-search query.
INDEX TERMS
Patents, Search problems, Mathematical model, Context, Indexes, Equations, Computational modeling, query expansion, Patent search, error correction, query suggestion
CITATION
Guoliang Li, Ju Fan, Yang Cao, "A User-Friendly Patent Search Paradigm", IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 1439-1443, June 2013, doi:10.1109/TKDE.2012.63
96 ms
(Ver 3.3 (11022016))