.png){kind=icon}
返回
Graph characterisation using graphlet-based entropies
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2021.03.031.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a general framework to estimate the network entropy that is represented by means of an undirected graph and subsequently employ this framework for graph classification tasks. The proposed framework is based on local information functionals which are defined using induced connected subgraphs of different sizes. These induced subgraphs are termed graphlets. Specifically, we extract the set of all graphlets of a specific sizes and compute the graph entropy using our proposed framework. To classify the network into different categories, we construct a feature vector whose components are obtained by computing entropies of different graphlet sizes. We apply the proposed framework to two different tasks, namely view-based object recognition and biomedical datasets with binary outcomes classification. Finally, we report and compare the classification accuracies of the proposed method and compare against some of the state-of-the-art methods. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Graph entropy
Graph characterisation
Information functional
Graphlets
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
.png){kind=icon}
查看更多内容