Evaluation of algebraic graph clustering algorithms for complex networks

Basit Öğe Kaydı
dc.authoridErciyes, Kayhan/0000-0001-9111-7156en_US
dc.contributor.authorErciyes, Kayhan
dc.date.accessioned2024-07-12T21:40:37Z
dc.date.available2024-07-12T21:40:37Z
dc.date.issued2021en_US
dc.department[Belirlenecek]en_US
dc.description2nd International Informatics and Software Engineering Conference (IISEC) - Artificial Intelligence for Digital Transformation -- DEC 16-17, 2021 -- Ankara, TURKEYen_US
dc.description.abstractWe 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 processingen_US
dc.description.sponsorshipIEEE Turkey Secten_US
dc.identifier.doi10.1109/IISEC54230.2021.9672390
dc.identifier.isbn978-1-6654-0759-5
dc.identifier.scopus2-s2.0-85125352202en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1109/IISEC54230.2021.9672390
dc.identifier.urihttps://hdl.handle.net/20.500.12415/7381
dc.identifier.wosWOS:000841548300026en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoenen_US
dc.publisherIeeeen_US
dc.relation.ispartof2nd International Informatics And Software Engineering Conference (Iisec)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKY08722
dc.subjectGraph Clusteringen_US
dc.subjectMst-Based Clusteringen_US
dc.subjectShared Nearest Neighbor Clusteringen_US
dc.subjectEdge-Betweenness Clusteringen_US
dc.titleEvaluation of algebraic graph clustering algorithms for complex networksen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu