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

^*此作品的通信作者

National Tsing Hua University

研究成果: 圖書/報告稿件的類型 › 會議稿件 › 同行評審

6 引文斯高帕斯（Scopus）

摘要

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.

原文	英語
主出版物標題	2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008
頁面	394-399
頁數	6
DOIs	https://doi.org/10.1109/SUTC.2008.87
出版狀態	已出版 - 2008
對外發佈	是
事件	2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 - Taichung, 台灣持續時間: 11 06 2008 → 13 06 2008

出版系列

名字	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
國家/地區	台灣
城市	Taichung
期間	11/06/08 → 13/06/08

存取文件

10.1109/SUTC.2008.87

其它文件與鏈接

Link to publication in Scopus

引用此

Yang, S. Y., & Soo, V. W. (2008). Comparing the conceptual graphs extracted from patent claims. 於 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 (頁 394-399). 文章 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. 於 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, 頁 394-399, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008, Taichung, 台灣, 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).

研究成果: 圖書/報告稿件的類型 › 會議稿件 › 同行評審

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 - https://www.scopus.com/pages/publications/50949086975

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

摘要

出版系列

Conference

存取文件

其它文件與鏈接

指紋

引用此