The reviewed record of science sign in
Pith

arxiv: 2207.00718 · v2 · pith:C44MUT7B · submitted 2022-07-02 · cs.SI

Triangle-oriented Community Detection considering Node Features and Network Topology

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:C44MUT7Brecord.jsonopen to challenge →

classification cs.SI
keywords nodefeaturesnetworktopologycommunitiescommunitydetectiondetails
0
0 comments X
read the original abstract

The joint use of node features and network topology to detect communities is called community detection in attributed networks. Most of the existing work along this line has been carried out through objective function optimization and has proposed numerous approaches. However, they tend to focus only on lower-order details, i.e., capture node features and network topology from node and edge views, and purely seek a higher degree of optimization to guarantee the quality of the found communities, which exacerbates unbalanced communities and free-rider effect. To further clarify and reveal the intrinsic nature of networks, we conduct triangle-oriented community detection considering node features and network topology. Specifically, we first introduce a triangle-based quality metric to preserve higher-order details of node features and network topology, and then formulate so-called two-level constraints to encode lower-order details of node features and network topology. Finally, we develop a local search framework based on optimizing our objective function consisting of the proposed quality metric and two-level constraints to achieve both non-overlapping and overlapping community detection in attributed networks. Extensive experiments demonstrate the effectiveness and efficiency of our framework and its potential in alleviating unbalanced communities and free-rider effect.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.