Graph characterisation using graphlet-based entropies

doi:10.1016/j.patrec.2021.03.031

Return

Graph characterisation using graphlet-based entropies

2021-07-01

DOI：10.1016/j.patrec.2021.03.031

Original

Save

View PDF

Abstract

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.

Keywords:

Graph entropy

Graph characterisation

Information functional

Graphlets

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.