Evaluation of algebraic graph clustering algorithms for complex networks
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ieee
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
We review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processing
Açıklama
2nd International Informatics and Software Engineering Conference (IISEC) - Artificial Intelligence for Digital Transformation -- DEC 16-17, 2021 -- Ankara, TURKEY
Anahtar Kelimeler
Graph Clustering, Mst-Based Clustering, Shared Nearest Neighbor Clustering, Edge-Betweenness Clustering
Kaynak
2nd International Informatics And Software Engineering Conference (Iisec)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
