Fast community detection in complex networks with a K-depths classifier

DOI10.1007/978-3-319-41573-4_8MaRDI QIDQ4595753zbMATH OpenOpenAlexFDO

Authors Yahui Tian, Yulia R. Gel

Publication date 6 December 2017

Published in Contributions to Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41573-4_8

zbMATH Keywords

networksdata depthFlickrDavis-Kahan bound

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30)

Recommendations

• Fusing data depth with complex networks: community detection with prior information
• Detecting network communities: a new systematic and efficient algorithm
• Fast unfolding of communities in large networks
• A constrained power method for community detection in complex networks
• A deep stochastic model for detecting community in complex networks

Cited in

(8)

• Fast Network Community Detection With Profile-Pseudo Likelihood Methods
• Fusing data depth with complex networks: community detection with prior information
• The k-Dense Method to Extract Communities from Complex Networks
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Community detection in complex networks: from statistical foundations to data science applications
• Depth-based classification for relational data with multiple attributes
• Local half-region depth for functional data
• Fast community detection by SCORE

This page was built for publication: Fast community detection in complex networks with a \(K\)-depths classifier

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