Detecting Statistically Significant Events in Large Heterogeneous Attribute Graphs via Densest Subgraphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yuan Li, Xiaolin Fan, Jing Sun, Yuhai Zhao, Guoren Wang. Detecting Statistically Significant Events in Large Heterogeneous Attribute Graphs via Densest Subgraphs. In Gang Li 0009, Heng Tao Shen, Ye Yuan, Xiaoyang Wang 0002, Huawen Liu, Xiang Zhao 0002, editors, Knowledge Science, Engineering and Management - 13th International Conference, KSEM 2020, Hangzhou, China, August 28-30, 2020, Proceedings, Part I. Volume 12274 of Lecture Notes in Computer Science, pages 107-120, Springer, 2020. [doi]

The following publications are possibly variants of this publication:

Densest Periodic Subgraph Mining on Large Temporal GraphsHongchao Qin, Rong-Hua Li, Ye Yuan 0001, Yongheng Dai, Guoren Wang. tkde, 35(11):11259-11273, November 2023. [doi]

A truss-based approach for densest homogeneous subgraph mining in node-attributed graphsHeli Sun, Yawei Zhang, Xiaolin Jia, Pei Wang, Ruodan Huang, Jianbin Huang, Liang He, Zhongbin Sun. ci, 37(2):995-1010, 2021. [doi]

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large GraphsBintao Sun, Maximilien Dansich, Hubert Chan, Mauro Sozio. pvldb, 13(10):1628-1640, 2020. [doi]

runs on WebDSL