Clustering probabilistic graphs using neighbourhood paths

DOI10.1016/j.ins.2021.03.057zbMath1527.68181OpenAlexW3145158775MaRDI QIDQ6086329

Iffat Maab, Syed Fawad Hussain

Publication date: 9 November 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.03.057

zbMATH Keywords

clusteringgenetic algorithmprobabilistic graphsco-similarity

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Stable structural clustering in uncertain graphs

Cites Work

• A social learning particle swarm optimization algorithm for scalable optimization
• Efficient clustering of large uncertain graphs using neighborhood information
• Improved Graph Clustering
• A Survey of Recent Advances in Hierarchical Clustering Algorithms