Selecting informative features for post-hoc community explanation

DOI10.1007/978-3-030-93409-5_25zbMATH Open1506.91139OpenAlexW4205312302MaRDI QIDQ2086604FDOQ2086604

Authors: Sophie Sadler, Derek Greene, Daniel Archambault 

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_25

Recommendations

• COMMUNITY FINDING IN COMPLEX NETWORKS
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm
• A deep stochastic model for detecting community in complex networks
• A survey of community detection methods in multilayer networks
• Formalising and detecting community structures in real world complex networks

zbMATH Keywords

community detectionnetwork analysisexplainability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Random forests
• Fast unfolding of communities in large networks
• Collective dynamics of `small-world' networks

Uses Software

• NetworkX

This page was built for publication: Selecting informative features for post-hoc community explanation

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