Mining Summaries for Knowledge Graph Search

Querying heterogeneous and large-scale knowledge graphs is expensive. This paper studies a graph summarization framework to facilitate knowledge graph search. (1) We introduce a class of reduced summaries . Characterized by approximate graph pattern matching, these summaries are capable of summarizi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on knowledge and data engineering Ročník 30; číslo 10; s. 1887 - 1900
Hlavní autori:	Song, Qi, Wu, Yinghui, Lin, Peng, Dong, Luna Xin, Sun, Hui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Data mining Feasibility studies Graph matching Graph summarization Graphs Knowledge based systems Motion pictures parallel algorithm Parallel algorithms Pattern matching pattern mining Query processing Scalability Summaries Time factors
ISSN:	1041-4347, 1558-2191
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!