Abstract
Graph entropy measures have recently gained wide attention for identifying and discriminating various networks in biology, society, transportation, etc. However, existing methods cannot sufficiently explore the structural contents by merely considering the elementary invariants of a graph, ignoring the underlying patterns in higher-order features. In this paper, we propose a general <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">entropy-based graph representation framework</i> ( <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Greet</small> ) based on four pertinent properties of graphlet topology from urelement to higher-order statistics. Specifically, we introduce an unbiased graphlet estimation strategy for obtaining both urelement and higher-order statistics. Additionally, we define a novel family of information functions based on hierarchical topological features to compute the graph entropy, then construct a graph information entropy (GIE) vector using the obtained local and global structural statistics to facilitate downstream tasks. Furthermore, there are some advantages that our <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Greet</small> exhibits over other methods: (a) high accuracy with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$< 1\%$</tex-math></inline-formula> relative error; (b) scalable for even larger vertex graphlets; (c) efficient calculation procedure with feasible speedup. Extensive experiments show that <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Greet</small> exhibits superior performance on graph classification and clustering tasks, achieving remarkable improvements compared to several baselines. Altogether these findings pave the way for a wide range of applications of graphlet-based entropy as a complexity metric in graph analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Network Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
