Variational community partition with novel network structure centrality prior
From MaRDI portal
Publication:1985111
Abstract: In this paper, we proposed a novel two-stage optimization method for network community partition, which is based on inherent network structure information. The introduced optimization approach utilizes the new network centrality measure of both links and vertices to construct the key affinity description of the given network, where the direct similarities between graph nodes or nodal features are not available to obtain the classical affinity matrix. Indeed, such calculated network centrality information presents the essential structure of network, hence, the proper measure for detecting network communities, which also introduces a `confidence' criterion for referencing new labeled benchmark nodes. For the resulted challenging combinatorial optimization problem of graph clustering, the proposed optimization method iteratively employs an efficient convex optimization algorithm which is developed based under a new variational perspective of primal and dual. Experiments over both artificial and real-world network datasets demonstrate that the proposed optimization strategy of community detection significantly improves result accuracy and outperforms the state-of-the-art algorithms in terms of accuracy and reliability.
Recommendations
- Total variation based community detection using a nonlinear optimization approach
- A method based on total variation for network modularity optimization using the MBO scheme
- Revealing network communities with a nonlinear programming method
- Optimization via low-rank approximation for community detection in networks
- Searching graph communities by modularity maximization via convex optimization
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- An effective region force for some variational models for learning and clustering
- Community structure in social and biological networks
- Emergence of Scaling in Random Networks
- Introduction to semi-supervised learning.
- Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
- Networks. An introduction.
This page was built for publication: Variational community partition with novel network structure centrality prior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985111)
