Overview of Microsoft Academic Graph

More specifically, we allow one to visualise the results of graph classification: namely the misclassified graphs and the effective matching that is found by a given GED algorithm..

Serratosa, A general model to define the substitu- tion, insertion and deletion graph edit costs based on an embedded space, Pattern Recognition Let- ters 138 (2020) 115 –

In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless

1) Libraries maintenance: Java Libraries continuously evolve by releasing new versions with new functional- ity or enhanced performance. However, in some cases, clients decide not

A web graph of Web fragment is a directed graph without loops and multiple arcs, whose vertex set is represented by the target site set, and whose arc set is constructed as

Textual information is of great importance for paper similarity. However, an entity retrieval system for a bibliographic dataset should go beyond simple sim- ilar paper search. A

Next, after creating clusters according to the degree of entropy, we unified all word vectors in the same cluster to a cluster vector and constructed paragraph vectors based on

Bijection between plane trees of size n, having two stems per node, and the class of rooted planar triangulations with n + 2