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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 30; H. 10; S. 1887 - 1900
Hauptverfasser:	Song, Qi, Wu, Yinghui, Lin, Peng, Dong, Luna Xin, Sun, Hui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!