Clustering Vertex-Weighted Graphs by Spectral Methods
Spectral techniques are often used to partition the set of vertices of a graph, or to form clusters. They are based on the Laplacian matrix. These techniques allow easily to integrate weights on the edges. In this work, we introduce a <i>p</i>-Laplacian, or a generalized Laplacian matrix...
Enregistré dans:
Auteurs principaux: | , |
---|---|
Format: | article |
Langue: | EN |
Publié: |
MDPI AG
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/c7d3a8b84b244797b620fbfb5420e7e8 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!