Clustering probabilistic graphs using neighbourhood paths

DOI10.1016/J.INS.2021.03.057MaRDI QIDQ6086329zbMATH OpenOpenAlexFDO

Authors Syed Fawad Hussain, Iffat Maab

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

clusteringco-similaritygenetic algorithmprobabilistic graphs

Mathematics Subject Classification ID

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

Recommendations

• Efficient clustering of large uncertain graphs using neighborhood information
• Probabilistic SimRank computation over uncertain graphs
• scientific article; zbMATH DE number 2089226
• A graph clustering algorithm based on a clustering coefficient for weighted graphs
• A novel probabilistic clustering model for heterogeneous networks

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 3902711 (Why is no real title available?)
• Stable structural clustering in uncertain graphs

This page was built for publication: Clustering probabilistic graphs using neighbourhood paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086329)