Scalable classification for large dynamic networks


We examine the problem of node classification in large-scale and dynamically changing graphs. An entropy-based subgraph extraction method has been developed for extracting subgraphs surrounding the nodes to be classified. We introduce an online version of an existing graph kernel to incrementally compute the kernel matrix for a unbounded stream of these… (More)
DOI: 10.1109/BigData.2015.7363805


13 Figures and Tables