Comparing the conceptual graphs extracted from patent claims

Shih Yao Yang; Von Wun Soo

doi:10.1109/SUTC.2008.87

Comparing the conceptual graphs extracted from patent claims

Shih Yao Yang^*, Von Wun Soo

^*Corresponding author for this work

National Tsing Hua University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

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.

Original language	English
Title of host publication	2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008
Pages	394-399
Number of pages	6
DOIs	https://doi.org/10.1109/SUTC.2008.87
State	Published - 2008
Externally published	Yes
Event	2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 - Taichung, Taiwan Duration: 11 06 2008 → 13 06 2008

Publication series

Name	Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

Conference

Conference	2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008
Country/Territory	Taiwan
City	Taichung
Period	11/06/08 → 13/06/08

Access to Document

10.1109/SUTC.2008.87

Cite this

Yang, S. Y., & Soo, V. W. (2008). Comparing the conceptual graphs extracted from patent claims. In 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 (pp. 394-399). Article 4545791 (Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing). https://doi.org/10.1109/SUTC.2008.87

@inproceedings{1f68bc227778464c982ef9bb10218e3e,

title = "Comparing the conceptual graphs extracted from patent claims",

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.",

author = "Yang, {Shih Yao} and Soo, {Von Wun}",

year = "2008",

doi = "10.1109/SUTC.2008.87",

language = "英语",

isbn = "9780769531588",

series = "Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing",

pages = "394--399",

booktitle = "2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008",

note = "2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 ; Conference date: 11-06-2008 Through 13-06-2008",

}

Yang, SY & Soo, VW 2008, Comparing the conceptual graphs extracted from patent claims. in 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008., 4545791, Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 394-399, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008, Taichung, Taiwan, 11/06/08. https://doi.org/10.1109/SUTC.2008.87

Comparing the conceptual graphs extracted from patent claims. / Yang, Shih Yao; Soo, Von Wun.
2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008. 2008. p. 394-399 4545791 (Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Comparing the conceptual graphs extracted from patent claims

AU - Yang, Shih Yao

AU - Soo, Von Wun

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50949086975&partnerID=8YFLogxK

U2 - 10.1109/SUTC.2008.87

DO - 10.1109/SUTC.2008.87

M3 - 会议稿件

AN - SCOPUS:50949086975

SN - 9780769531588

T3 - Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

SP - 394

EP - 399

BT - 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008

T2 - 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008

Y2 - 11 June 2008 through 13 June 2008

ER -

Comparing the conceptual graphs extracted from patent claims

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this