Community detection in hypernetwork via density-ordered tree partition

DOI10.1016/J.AMC.2015.12.039MaRDI QIDQ671039zbMATH OpenOpenAlexFDO

Authors Qing Cheng, Zhong Liu, Jin Cai Huang, Guangquan Cheng

Publication date 20 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.12.039

zbMATH Keywords

anomaly detectioncommunity detectiondensity-ordered treevisual inspection

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• Nonnegative matrix factorization with mixed hypergraph regularization for community detection
• Flow-Based Community Detection in Hypergraphs
• Detecting communities in K-partite K-uniform (hyper)networks
• Finding network communities using modularity density
• Testing community structure for hypergraphs

Cites work

• Detecting communities in K-partite K-uniform (hyper)networks
• scientific article; zbMATH DE number 3829300 (Why is no real title available?)
• Modelling systems by hypergraphs
• Networks of networks -- an introduction
• Predicting missing links via local information

Cited in

(5)

• Traveling salesman problems with PageRank distance on complex networks reveal community structure
• Dynamic evolution of shipping network based on hypergraph
• Detecting communities in K-partite K-uniform (hyper)networks
• Flow-Based Community Detection in Hypergraphs
• Study on information transmission model of enterprise informal organizations based on the hypernetwork

This page was built for publication: Community detection in hypernetwork via density-ordered tree partition

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