.png){kind=icon}
Return
Deep Renyi entropy graph kernel
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2020.107668.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph kernels are applied heavily for the classification of structured data. In this paper, we propose a deep Renyi entropy graph kernel for this purpose. We gauge the deep information through a family of h-layer expansion subgraphs rooted at a vertex, and define a h-layer depth-based second-order Renyi entropy representation for each vertex. The second-order Renyi entropy representation is used together with Euclidean distance to build a deep second-order Renyi entropy graph kernel (SREGK). For graphs with n vertices, the time complexity for our kernel is O(n(3)). This low-order polynomial complexity enables our subgraph kernels to easily scale up to graphs of reasonably large sizes and thus overcome the size limits arising in state-of-the-art graph kernels. Experimental results on fourteen real world graph datasets are shown to demonstrate the overall superior performance of our approach over a number of state-of-the-art methods. (C) 2020 Elsevier Ltd. All rights reserved.
Keywords:
Shannon entropy
Renyi entropy
Deep representation
Graph kernel
Graph classification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
View more organizations
Cited Papers
ShareSaveSpectral Quasi-Linearization Method for Non-Darcy Porous Medium with Convective Boundary Condition.png)
Entropy
OAAI
EntropyIF0
OAAIShareSaveShareSaveEvidential reasoning approach with multiple kinds of attributes and entropy-based weight assignmentOAAI
OAAIShareSaveShareSaveLimited Substrate Specificity of PS/γ-Secretase Is Supported by Novel Multiplexed FRET Analysis in Live CellsBiosensors
OAAI
BiosensorsIF0
OAAIShareSave View more