DESTINE: Dense Subgraph Detection on Multi-Layered Networks

Dense subgraph detection is a fundamental building block for a variety of applications. Most of the existing methods aim to discover dense subgraphs within either a single network or a multi-view network while ignoring the informative node dependencies across multiple layers of networks in a complex system. To date, it largely remains a daunting task to detect dense subgraphs on multi-layered networks. In this paper, we formulate the problem of dense subgraph detection on multi-layered networks based on cross-layer consistency principle. We further propose a novel algorithm DESTINE based on projected gradient descent with the following advantages. First, armed with the cross-layer dependencies, DESTINE is able to detect significantly more accurate and meaningful dense subgraphs at each layer. Second, it scales linearly w.r.t. the number of links in the multi-layered network. Extensive experiments demonstrate the efficacy of the proposed DESTINE algorithm in various cases.

[1]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[2]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[3]  Fred Y. Ye,et al.  Extracting a core structure from heterogeneous information network using h-subnet and meta-path strength , 2021, J. Informetrics.

[4]  Lei Xie,et al.  FASCINATE: Fast Cross-Layer Dependency Inference on Multi-layered Networks , 2016, KDD.

[5]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[6]  Mauro Brunato,et al.  On Effectively Finding Maximal Quasi-cliques in Graphs , 2008, LION.

[7]  Nirmalya Chowdhury,et al.  $k$ -Context Technique: A Method for Identifying Dense Subgraphs in a Heterogeneous Information Network , 2019, IEEE Transactions on Computational Social Systems.

[8]  Yizhou Sun,et al.  Mining Heterogeneous Information Networks: Principles and Methodologies , 2012, Mining Heterogeneous Information Networks: Principles and Methodologies.

[9]  Charalampos E. Tsourakakis,et al.  Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.

[10]  Pascal Frossard,et al.  Clustering With Multi-Layer Graphs: A Spectral Perspective , 2011, IEEE Transactions on Signal Processing.

[11]  Nicolas Gillis,et al.  Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation , 2017, J. Optim. Theory Appl..

[12]  Hyun Ah Song,et al.  FRAUDAR: Bounding Graph Fraud in the Face of Camouflage , 2016, KDD.

[13]  Hanghang Tong,et al.  Inside the atoms: ranking on a network of networks , 2014, KDD.

[14]  G. Vriend,et al.  A text-mining analysis of the human phenome , 2006, European Journal of Human Genetics.

[15]  Charu C. Aggarwal,et al.  Community Detection with Edge Content in Social Media Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[16]  Thomas C. Wiegers,et al.  The Comparative Toxicogenomics Database: update 2017 , 2016, Nucleic Acids Res..

[17]  Chris H. Q. Ding,et al.  Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[18]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[19]  Srinivasan Parthasarathy,et al.  Efficient community detection in large networks using content and links , 2012, WWW.

[20]  Ian M. Donaldson,et al.  iRefIndex: A consolidated protein interaction database with provenance , 2008, BMC Bioinformatics.

[21]  Liang Xiong,et al.  Ranking on Network of Heterogeneous Information Networks , 2020, 2020 IEEE International Conference on Big Data (Big Data).

[22]  Jingrui He,et al.  HiDDen: Hierarchical Dense Subgraph Detection with Application to Financial Fraud Detection , 2017, SDM.

[23]  H. Weyl.  Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung) , 1912 .

[24]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[25]  Min Wu,et al.  A core-attachment based method to detect protein complexes in PPI networks , 2009, BMC Bioinformatics.

[26]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[27]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.