Using Classification Code Hierarchies for Patent Prior Art Searches

Autor:	Robert Arens, Padmini Srinivasan, Christopher G. Harris
Rok vydání:	2011
Předmět:	ComputingMilieux_GENERAL Set (abstract data type) Patent application Information retrieval Ranking Computer science Similarity (psychology) Code (cryptography) Search cost ComputingMilieux_LEGALASPECTSOFCOMPUTING International Patent Classification Patent classification
Zdroj:	Current Challenges in Patent Information Retrieval ISBN: 9783642192302 Current Challenges in Patent Information Retrieval
Popis:	Searches in patent collections to determine if a given patent application has related prior art patents is non-trivial and often requires extensive manpower. When time is constrained, an automatically generated, ranked list of prior art patents associated with a given patent application decreases search costs and improves search efficiency. One may view the discovery of this prior art patent set as a problem of finding patents ‘related’ to the patent application. To accomplish this, we examine whether semantic relations between patent classification codes can aid in the recognition of related prior art patents. We explore similarity measures for hierarchically ordered patent classes and subclasses for this purpose. Next, we examine various patent feature-weighting schemes to achieve the best similarities between our patent applications and related prior art patents. Finally, we provide a method and demonstrate that patent prior art searches can successfully be used as an aid in patent ranking.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6f5b3ddbb06e9bf32f6555e97688f99c https://doi.org/10.1007/978-3-642-19231-9_14 Zobrazit plný text záznamu