loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)
Comparing the Conceptual Graphs Extracted from Patent Claims
June 11-June 13
ISBN: 978-0-7695-3158-8
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.
Index Terms:
maximal common subgraph, patent, conceptual graph
Citation:
Shih-Yao Yang, Von-Wun Soo, "Comparing the Conceptual Graphs Extracted from Patent Claims," sutc, pp.394-399, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.