Title :
Comparing the Conceptual Graphs Extracted from Patent Claims
Author :
Yang, Shih-Yao ; Soo, Von-Wun
Author_Institution :
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu
Abstract :
A patent claim defines the protection of the invention. It is usually very time consuming and laborious to manually conduct analysis on patents in any domain of interest. A maximal common edge subgraph (MCES) is a subgraph consisting of the largest number of edges common between two graphs G and G´. This paper automatically compares conceptual graphs, extracted from patent claims by an NLP parser, using anchored relaxation labeling.
Keywords :
graph theory; natural language processing; patents; text analysis; NLP parser; anchored relaxation labeling; conceptual graphs; invention protection; maximal common edge subgraph; patent analysis; patent claims; Bipartite graph; Computer networks; Computer science; Convergence; Filters; Knowledge representation; Labeling; Ontologies; Pervasive computing; Protection; conceptual graph; maximal common subgraph; patent;
Conference_Titel :
Sensor Networks, Ubiquitous and Trustworthy Computing, 2008. SUTC '08. IEEE International Conference on
Conference_Location :
Taichung
Print_ISBN :
978-0-7695-3158-8
Electronic_ISBN :
978-0-7695-3158-8
DOI :
10.1109/SUTC.2008.87
