Attributed graph clustering with subspace stochastic block model
From MaRDI portal
Publication:2023214
DOI10.1016/j.ins.2020.05.044zbMath1460.62095OpenAlexW3026890678MaRDI QIDQ2023214
Junming Shao, Zhongjing Yu, Qinli Yang, Hao Ran Chen
Publication date: 3 May 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.05.044
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Subspace clustering using a low-rank constrained autoencoder
- Modeling by shortest data description
- Lossy compression approach to subspace clustering
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Mixed membership stochastic blockmodels
- Mixture models and exploratory analysis in networks
- Projected gradient methods for linearly constrained problems
- Community structure in social and biological networks
- Stochastic Blockmodels for Directed Graphs