Proposal of two-stage patent retrieval method considering the claim structure
The importance of patents is increasing in global society. In preparing a patent application, it is essential to search for related patents that may invalidate the invention. However, it is time-consuming to identify them among the millions of patents. This article proposes a patent-retrieval method...
Gespeichert in:
Veröffentlicht in: | ACM transactions on Asian language information processing 2005-06, Vol.4 (2), p.190-206 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 206 |
---|---|
container_issue | 2 |
container_start_page | 190 |
container_title | ACM transactions on Asian language information processing |
container_volume | 4 |
creator | Mase, Hisao Matsubayashi, Tadataka Ogawa, Yuichi Iwayama, Makoto Oshio, Tadaaki |
description | The importance of patents is increasing in global society. In preparing a patent application, it is essential to search for related patents that may invalidate the invention. However, it is time-consuming to identify them among the millions of patents. This article proposes a patent-retrieval method that considers a claim structure for a more accurate search for invalidity. This method uses a claim text as input; it consists of two retrieval stages. In stage 1, general text analysis and retrieval methods are applied to improve recall. In stage 2, the top N documents retrieved in stage 1 are rearranged to improve precision by applying text analysis and retrieval methods using the claim structure. Our two-stage retrieval introduces five precision-oriented analysis and retrieval methods: query-term extraction from a portion of a claim text that describes the characteristics of a claim; query term-weighting without term frequency; query term-weighting with “measurement terms”; text retrieval using only claims as a target; and calculating the relevant score by “partially” adding scores in stage 2 to those in stage 1. Evaluation results using test sets of the NTCIR4 Patent Retrieval Task show that our methods are effective, though the degree of the effectiveness varies depending on the test sets. |
doi_str_mv | 10.1145/1105696.1105702 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29004387</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29004387</sourcerecordid><originalsourceid>FETCH-LOGICAL-c214t-d62358ec04c408fbb3cfacb7b85ab5fdfca879e8a24655ef79a60bf16b2d99a43</originalsourceid><addsrcrecordid>eNpdkDtPwzAUhS0EEqUws1oMbGmvn3FGVPGSQDDAbDmO3aZK4mA7IP49rdqJ6VzpfLo6-hC6JrAghIslISBkJRf7LIGeoBkRQhWMMzjd3wwKoFSeo4uUtgBESEJn6PU9hjEk0-Hgcf4JRcpm7fBoshsyji7H1n3v2t7lTWiwDUNqGxfbYY3zxmHbmbbHKcfJ5im6S3TmTZfc1THn6PPh_mP1VLy8PT6v7l4KSwnPRSMpE8pZ4JaD8nXNrDe2LmslTC18461RZeWUoVwK4XxZGQm1J7KmTVUZzubo9vB3jOFrcinrvk3WdZ0ZXJiSphUAZ6rcgTf_wG2Y4rDbpilltASmYActD5CNIaXovB5j25v4qwnovVt9dKuPbtkftsxstw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>223270380</pqid></control><display><type>article</type><title>Proposal of two-stage patent retrieval method considering the claim structure</title><source>ACM Digital Library Complete</source><creator>Mase, Hisao ; Matsubayashi, Tadataka ; Ogawa, Yuichi ; Iwayama, Makoto ; Oshio, Tadaaki</creator><creatorcontrib>Mase, Hisao ; Matsubayashi, Tadataka ; Ogawa, Yuichi ; Iwayama, Makoto ; Oshio, Tadaaki</creatorcontrib><description>The importance of patents is increasing in global society. In preparing a patent application, it is essential to search for related patents that may invalidate the invention. However, it is time-consuming to identify them among the millions of patents. This article proposes a patent-retrieval method that considers a claim structure for a more accurate search for invalidity. This method uses a claim text as input; it consists of two retrieval stages. In stage 1, general text analysis and retrieval methods are applied to improve recall. In stage 2, the top N documents retrieved in stage 1 are rearranged to improve precision by applying text analysis and retrieval methods using the claim structure. Our two-stage retrieval introduces five precision-oriented analysis and retrieval methods: query-term extraction from a portion of a claim text that describes the characteristics of a claim; query term-weighting without term frequency; query term-weighting with “measurement terms”; text retrieval using only claims as a target; and calculating the relevant score by “partially” adding scores in stage 2 to those in stage 1. Evaluation results using test sets of the NTCIR4 Patent Retrieval Task show that our methods are effective, though the degree of the effectiveness varies depending on the test sets.</description><identifier>ISSN: 1530-0226</identifier><identifier>ISSN: 2375-4699</identifier><identifier>EISSN: 1558-3430</identifier><identifier>EISSN: 2375-4702</identifier><identifier>DOI: 10.1145/1105696.1105702</identifier><language>eng</language><publisher>New York: Association for Computing Machinery</publisher><subject>Guidelines ; Information retrieval ; Studies ; Text analysis</subject><ispartof>ACM transactions on Asian language information processing, 2005-06, Vol.4 (2), p.190-206</ispartof><rights>Copyright Association for Computing Machinery Jun 2005</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c214t-d62358ec04c408fbb3cfacb7b85ab5fdfca879e8a24655ef79a60bf16b2d99a43</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Mase, Hisao</creatorcontrib><creatorcontrib>Matsubayashi, Tadataka</creatorcontrib><creatorcontrib>Ogawa, Yuichi</creatorcontrib><creatorcontrib>Iwayama, Makoto</creatorcontrib><creatorcontrib>Oshio, Tadaaki</creatorcontrib><title>Proposal of two-stage patent retrieval method considering the claim structure</title><title>ACM transactions on Asian language information processing</title><description>The importance of patents is increasing in global society. In preparing a patent application, it is essential to search for related patents that may invalidate the invention. However, it is time-consuming to identify them among the millions of patents. This article proposes a patent-retrieval method that considers a claim structure for a more accurate search for invalidity. This method uses a claim text as input; it consists of two retrieval stages. In stage 1, general text analysis and retrieval methods are applied to improve recall. In stage 2, the top N documents retrieved in stage 1 are rearranged to improve precision by applying text analysis and retrieval methods using the claim structure. Our two-stage retrieval introduces five precision-oriented analysis and retrieval methods: query-term extraction from a portion of a claim text that describes the characteristics of a claim; query term-weighting without term frequency; query term-weighting with “measurement terms”; text retrieval using only claims as a target; and calculating the relevant score by “partially” adding scores in stage 2 to those in stage 1. Evaluation results using test sets of the NTCIR4 Patent Retrieval Task show that our methods are effective, though the degree of the effectiveness varies depending on the test sets.</description><subject>Guidelines</subject><subject>Information retrieval</subject><subject>Studies</subject><subject>Text analysis</subject><issn>1530-0226</issn><issn>2375-4699</issn><issn>1558-3430</issn><issn>2375-4702</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpdkDtPwzAUhS0EEqUws1oMbGmvn3FGVPGSQDDAbDmO3aZK4mA7IP49rdqJ6VzpfLo6-hC6JrAghIslISBkJRf7LIGeoBkRQhWMMzjd3wwKoFSeo4uUtgBESEJn6PU9hjEk0-Hgcf4JRcpm7fBoshsyji7H1n3v2t7lTWiwDUNqGxfbYY3zxmHbmbbHKcfJ5im6S3TmTZfc1THn6PPh_mP1VLy8PT6v7l4KSwnPRSMpE8pZ4JaD8nXNrDe2LmslTC18461RZeWUoVwK4XxZGQm1J7KmTVUZzubo9vB3jOFrcinrvk3WdZ0ZXJiSphUAZ6rcgTf_wG2Y4rDbpilltASmYActD5CNIaXovB5j25v4qwnovVt9dKuPbtkftsxstw</recordid><startdate>20050601</startdate><enddate>20050601</enddate><creator>Mase, Hisao</creator><creator>Matsubayashi, Tadataka</creator><creator>Ogawa, Yuichi</creator><creator>Iwayama, Makoto</creator><creator>Oshio, Tadaaki</creator><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20050601</creationdate><title>Proposal of two-stage patent retrieval method considering the claim structure</title><author>Mase, Hisao ; Matsubayashi, Tadataka ; Ogawa, Yuichi ; Iwayama, Makoto ; Oshio, Tadaaki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c214t-d62358ec04c408fbb3cfacb7b85ab5fdfca879e8a24655ef79a60bf16b2d99a43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Guidelines</topic><topic>Information retrieval</topic><topic>Studies</topic><topic>Text analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Mase, Hisao</creatorcontrib><creatorcontrib>Matsubayashi, Tadataka</creatorcontrib><creatorcontrib>Ogawa, Yuichi</creatorcontrib><creatorcontrib>Iwayama, Makoto</creatorcontrib><creatorcontrib>Oshio, Tadaaki</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on Asian language information processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mase, Hisao</au><au>Matsubayashi, Tadataka</au><au>Ogawa, Yuichi</au><au>Iwayama, Makoto</au><au>Oshio, Tadaaki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Proposal of two-stage patent retrieval method considering the claim structure</atitle><jtitle>ACM transactions on Asian language information processing</jtitle><date>2005-06-01</date><risdate>2005</risdate><volume>4</volume><issue>2</issue><spage>190</spage><epage>206</epage><pages>190-206</pages><issn>1530-0226</issn><issn>2375-4699</issn><eissn>1558-3430</eissn><eissn>2375-4702</eissn><abstract>The importance of patents is increasing in global society. In preparing a patent application, it is essential to search for related patents that may invalidate the invention. However, it is time-consuming to identify them among the millions of patents. This article proposes a patent-retrieval method that considers a claim structure for a more accurate search for invalidity. This method uses a claim text as input; it consists of two retrieval stages. In stage 1, general text analysis and retrieval methods are applied to improve recall. In stage 2, the top N documents retrieved in stage 1 are rearranged to improve precision by applying text analysis and retrieval methods using the claim structure. Our two-stage retrieval introduces five precision-oriented analysis and retrieval methods: query-term extraction from a portion of a claim text that describes the characteristics of a claim; query term-weighting without term frequency; query term-weighting with “measurement terms”; text retrieval using only claims as a target; and calculating the relevant score by “partially” adding scores in stage 2 to those in stage 1. Evaluation results using test sets of the NTCIR4 Patent Retrieval Task show that our methods are effective, though the degree of the effectiveness varies depending on the test sets.</abstract><cop>New York</cop><pub>Association for Computing Machinery</pub><doi>10.1145/1105696.1105702</doi><tpages>17</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1530-0226 |
ispartof | ACM transactions on Asian language information processing, 2005-06, Vol.4 (2), p.190-206 |
issn | 1530-0226 2375-4699 1558-3430 2375-4702 |
language | eng |
recordid | cdi_proquest_miscellaneous_29004387 |
source | ACM Digital Library Complete |
subjects | Guidelines Information retrieval Studies Text analysis |
title | Proposal of two-stage patent retrieval method considering the claim structure |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T17%3A25%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Proposal%20of%20two-stage%20patent%20retrieval%20method%20considering%20the%20claim%20structure&rft.jtitle=ACM%20transactions%20on%20Asian%20language%20information%20processing&rft.au=Mase,%20Hisao&rft.date=2005-06-01&rft.volume=4&rft.issue=2&rft.spage=190&rft.epage=206&rft.pages=190-206&rft.issn=1530-0226&rft.eissn=1558-3430&rft_id=info:doi/10.1145/1105696.1105702&rft_dat=%3Cproquest_cross%3E29004387%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=223270380&rft_id=info:pmid/&rfr_iscdi=true |