TY - GEN
T1 - HiDDen
T2 - 17th SIAM International Conference on Data Mining, SDM 2017
AU - Zhang, Si
AU - Zhou, Dawei
AU - Yildirim, Mehmet Yigit
AU - Alcorn, Scott
AU - He, Jingrui
AU - Davulcu, Hasan
AU - Tong, Hanghang
N1 - Funding Information:
This work is supported by NSF grants IIP-1430144, IIS-1552654 and IIS-1651203, ONR grant N00014-15-1-2821, DTRA grant HDTRA1-16-0017, ARO grant W911NF-16-1-0168, NIH grant R01LM011986, an IBM Faculty Award and a Baidu gift. The views and conclusions are those of the authors and should not be interpreted as representing the official policies of the funding agencies or the government. References
Publisher Copyright:
Copyright © by SIAM.
PY - 2017
Y1 - 2017
N2 - Dense subgraphs are fundamental patterns in graphs, and dense subgraph detection is often the key step of numerous graph mining applications. Most of the existing methods aim to find a single subgraph with a high density. However, dense subgraphs at different granularities could reveal more intriguing patterns in the underlying graph. In this paper, we propose to hierarchically detect dense subgraphs. The key idea of our method (HiDDen) is to envision the density of subgraphs as a relative measure to its background (i.e., the subgraph at the coarse granularity). Given that the hierarchical dense subgraph detection problem is essentially a nonconvex quadratic programming problem, we propose effective and efficient alternative projected gradient based algorithms to solve it. The experimental evaluations on real graphs demonstrate that (1) our proposed algorithms find subgraphs with an up to 40% higher density in almost every hierarchy; (2) the densities of different hierarchies exhibit a desirable variety across different granularities; (3) our projected gradient descent based algorithm scales linearly w.r.t the number of edges of the input graph; and (4) our methods are able to reveal interesting patterns in the underlying graphs (e.g., synthetic ID in financial fraud detection).
AB - Dense subgraphs are fundamental patterns in graphs, and dense subgraph detection is often the key step of numerous graph mining applications. Most of the existing methods aim to find a single subgraph with a high density. However, dense subgraphs at different granularities could reveal more intriguing patterns in the underlying graph. In this paper, we propose to hierarchically detect dense subgraphs. The key idea of our method (HiDDen) is to envision the density of subgraphs as a relative measure to its background (i.e., the subgraph at the coarse granularity). Given that the hierarchical dense subgraph detection problem is essentially a nonconvex quadratic programming problem, we propose effective and efficient alternative projected gradient based algorithms to solve it. The experimental evaluations on real graphs demonstrate that (1) our proposed algorithms find subgraphs with an up to 40% higher density in almost every hierarchy; (2) the densities of different hierarchies exhibit a desirable variety across different granularities; (3) our projected gradient descent based algorithm scales linearly w.r.t the number of edges of the input graph; and (4) our methods are able to reveal interesting patterns in the underlying graphs (e.g., synthetic ID in financial fraud detection).
KW - Financial fraud detection
KW - Graph mining
KW - Hierarchical dense subgraph detection
UR - http://www.scopus.com/inward/record.url?scp=85027832927&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027832927&partnerID=8YFLogxK
U2 - 10.1137/1.9781611974973.64
DO - 10.1137/1.9781611974973.64
M3 - Conference contribution
AN - SCOPUS:85027832927
T3 - Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017
SP - 570
EP - 578
BT - Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017
A2 - Chawla, Nitesh
A2 - Wang, Wei
PB - Society for Industrial and Applied Mathematics Publications
Y2 - 27 April 2017 through 29 April 2017
ER -