Search
1 article for “Silhouette score”
-
Intrinsic Evaluation of Graph Embeddings: Assessing Clustering and Community Detection Performance
Abstract: This paper presents an intrinsic evaluation of some graph embedding techniques on clustering and community detection tasks. We analyze a diverse set of embedding methods, ranging from traditional techniques such as Laplacian eigenmaps to more recent approaches like graph autoencoders, high-order proximity preserved embedding (HOPE), and graph attention network (GAT), using two widely studied datasets, Cora and CiteSeer. Our evaluation relies on two main metrics: Silhouette score with respect to …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 3, Issue 1, 2025 · pp. 40–48 Read article