Effective query generation and postprocessing strategies for prior art patent search

نویسندگان

  • Suleyman Cetintas
  • Luo Si
چکیده

idf 0.0484 0.0534 0.0565 0.055 0.0546 0.0551 0.0549 0.0549 0.0549 0.0549 log(tf)idf 0.0326 0.0531 0.0583 0.0569 0.0556 0.0551 0.0549 0.0549 0.0549 0.0549 tf 0.0011 0.0048 0.013 0.0247 0.0378 0.0439 0.0495 0.0534 0.0559 0.0584 Claims idf 0.0359 0.0478 0.0498 0.0533 0.0569 0.0619 0.0636 0.06 0.0583 0.0593 log(tf)idf 0.0515 0.064 0.0675 0.0668 0.0641 0.0629 0.0607 0.0606 0.0563 0.0566 tf 0.0012 0.0011 0.0014 0.0018 0.0045 0.0072 0.0076 0.0072 0.0106 0.0116 Description idf 0.031 0.0466 0.0498 0.0492 0.0479 0.0487 0.048 0.0468 0.0484 0.0497 log(tf)idf 0.0535 0.0687 0.0718 0.0696 0.0743 0.0747 0.0769 0.074 0.0733 0.0721 Note. Some of the best performances are shown in boldface. TABLE 4. Recall at 100 (R@100) results of several configurations for selecting query terms from the {Title, Abstract, Claims, Description} fields of the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategies for Effective Chemical Information Retrieval

We participated in the technology survey and prior art search subtasks of the TREC 2009 Chemical IR Track. This paper describes the methods developed for these two tasks. For the technology survey task, we propose a method that constructs highly structured queries to do retrieval on different fields of chemical patents and documents in a weighted way. The proposed method i) enriches these struc...

متن کامل

Report on the CLEF-IP 2011 Experiments: Exploring Patent Summarization

This technical report presents the work carried out for the Prior Art Candidate Search track of CLEF-IP 2011. In this search scenario, information need is expressed as a patent document (query topic). We compare two methods for estimating query model from the patent document to support summary-based query modeling and descriptionbased query modeling. The former approach utilizes a known text su...

متن کامل

Building Queries for Prior-Art Search

Prior-art search is a critical step in the examination procedure of a patent application. This study explores automatic query generation from patent documents to facilitate the time-consuming and labor-intensive search for relevant patents. It is essential for this task to identify discriminative terms in different sections of a query patent, which enable us to distinguish relevant patents from...

متن کامل

Query Enhancement for Patent Prior-Art-Search Based on Keyterm Dependency Relations and Semantic Tags

Prior art search is one of the most common forms of patent search, whose goal is to find patent documents that constitute prior art for a given patent being examined. Current patent search systems are mostly keyword-based, and due to the unique characteristics of patents and their usage, such as embedded structure and the length of patent documents, there are rooms for further improvements. In ...

متن کامل

Query Formulation for Prior Art Search - Georgetown University at CLEF-IP 2013

Our group participated in the CLEF-IP 2013 Passage Retrieval starting from Claims task. We focus on formulating representative queries from various metadata that is embedded in a patent document. We then submit the queries to a state-of-the-art search engine to perform document level retrieval. For passage level retrieval, we implement a TF-IDF algorithm that calculates the sum of query keyword...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JASIST

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2012