Dense community detection in multi-valued attributed networks

DOI10.1016/j.ins.2015.03.075zbMath1387.68184OpenAlexW2006530052MaRDI QIDQ1749201

Jeffrey Xu Yu, Xin Huang, Hong Cheng

Publication date: 16 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.03.075

zbMATH Keywords

community detectiondense subgraphattributed graphrandom walk with restart

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81)

Related Items

A generative model for exploring structure regularities in attributed networks ⋮ Community detection with structural and attribute similarities ⋮ Quantitative function and algorithm for community detection in bipartite networks ⋮ An efficient local search framework for the minimum weighted vertex cover problem

Uses Software

• SA-cluster
• SimRank
• Graclus

Cites Work

• A survey on enhanced subspace clustering
• Graph clustering
• Subspace clustering of high-dimensional data: a predictive approach
• Matrix multiplication via arithmetic progressions
• Computing Communities in Large Networks Using Random Walks