Table of Links
-
Experiments
4.2. Properties
This part shows some general properties of the new formulation and theoretically demonstrates the inherent connection between structural entropy and graph clustering. We first give an arithmetic property regarding Definition 4.3 to support the following claim on graph clustering. The proofs of the lemma/theorems are detailed in Appendix A.
Authors:
(1) Li Sun, North China Electric Power University, Beijing 102206, China (ccesunli@ncepu.edu);
(2) Zhenhao Huang, North China Electric Power University, Beijing 102206, China;
(3) Hao Peng, Beihang University, Beijing 100191, China;
(4) Yujie Wang, North China Electric Power University, Beijing 102206, China;
(5) Chunyang Liu, Didi Chuxing, Beijing, China;
(6) Philip S. Yu, University of Illinois at Chicago, IL, USA.
This paper is
[story continues]
tags