Least-squares community extraction in feature-rich networks using similarity data.
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and int...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Public Library of Science (PLoS)
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/d93a00a917b64d39a6a3f6d18cadbc80 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|