Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control 2019
DOI: 10.1145/3386164.3389093
|View full text |Cite
|
Sign up to set email alerts
|

Using Graph Representations for Semantic Information Extraction from Chinese Patents

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Patent texts, as a type of semi-structured texts, usually have relatively regular structures about their paragraphs and sentences. Thus, TextRank [7] as a graph-based analysis model has been effectively used to extract patent keywords [8]. For existing TextRank methods, they use the PageRank [9] formula to calculate node rank values based on the cooccurrence relationship among all possible words.…”
Section: Introductionmentioning
confidence: 99%
“…Patent texts, as a type of semi-structured texts, usually have relatively regular structures about their paragraphs and sentences. Thus, TextRank [7] as a graph-based analysis model has been effectively used to extract patent keywords [8]. For existing TextRank methods, they use the PageRank [9] formula to calculate node rank values based on the cooccurrence relationship among all possible words.…”
Section: Introductionmentioning
confidence: 99%