Efficient clustering of large uncertain graphs using neighborhood information

DOI10.1016/J.IJAR.2017.07.013MaRDI QIDQ1678437zbMATH OpenOpenAlexFDO

Authors Zahid Halim, Muhammad Waqas, Abdul Rauf Baig, Ahmar Rashid

Publication date 17 November 2017

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2017.07.013

zbMATH Keywords

clusteringgraph-based clusteringheuristic clustering algorithmuncertain graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Effective and efficient aggregation on uncertain graphs
• Clustering analysis in large graphs with rich attributes
• An information-theoretic approach to hierarchical clustering of uncertain data
• Clustering large attributed information networks: an efficient incremental computing approach
• Efficient pattern matching on big uncertain graphs

Cites work

• A survey of kernel and spectral methods for clustering
• Agglomerative clustering via maximum incremental path integral
• Aggregating inconsistent information
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Clustering Social Networks
• Fast unfolding of communities in large networks
• Graph-based hierarchical conceptual clustering
• On clustering validation techniques
• Overlapping community detection in networks

Cited in

(8)

• Multi-granularity principal curves extraction based on improved spectral clustering of complex distribution data
• Effective and efficient aggregation on uncertain graphs
• Method for similarity join on uncertain graph database
• Fuzzy random walkers with second order bounds: an asymmetric analysis
• Detecting strong cliques in co-authorship networks
• Clustering of propositions equipped with uncertainty
• Clustering analysis in large graphs with rich attributes
• Clustering probabilistic graphs using neighbourhood paths

This page was built for publication: Efficient clustering of large uncertain graphs using neighborhood information

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