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 with potent...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI AG
2021-11-01
|
| סדרה: | Mathematics |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/2227-7390/9/22/2841 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|