Cohesive Subgraph Detection in Large Bipartite Networks
暂无分享,去创建一个
Chen Chen | Yang Hao | Mengqi Zhang | Xiaoyang Wang | Y. Hao | Xiaoyang Wang | Chen Chen | Mengqi Zhang
[1] Ali Pinar,et al. Peeling Bipartite Networks for Dense Subgraph Discovery , 2016, WSDM.
[2] Gao Cong,et al. COM: a generative model for group recommendation , 2014, KDD.
[3] Vadim V. Lozin,et al. Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths , 2012, SWAT.
[4] Reynold Cheng,et al. Efficient Algorithms for Densest Subgraph Discovery , 2019, Proc. VLDB Endow..
[5] Hans-Peter Kriegel,et al. "Strength Lies in Differences": Diversifying Friends for Recommendations through Subspace Clustering , 2014, CIKM.
[6] Xuemin Lin,et al. Efficient (α, β)-core Computation: an Index-based Approach , 2019, WWW.
[7] Hui Li,et al. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core , 2017, CIKM.