Community Partitioning over Feature-Rich Networks Using an Extended K-Means Method

This paper proposes a meaningful and effective extension of the celebrated K-means algorithm to detect communities in feature-rich networks, due to our assumption of non-summability mode. We least-squares approximate given matrices of inter-node links and feature values, leading to a straightforward...

Descripción completa

Detalles Bibliográficos
Autores principales: Shalileh, Soroosh, Mirkin, Boris
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9142054/
https://www.ncbi.nlm.nih.gov/pubmed/35626512
http://dx.doi.org/10.3390/e24050626

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9142054/
https://www.ncbi.nlm.nih.gov/pubmed/35626512
http://dx.doi.org/10.3390/e24050626

Ejemplares similares