Fast Algorithm for K-Truss Discovery on Public-Private Graphs

In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owner, e.g., hidden friend lists on Facebook and secret following on Sina Weibo. However, existing public-private analytic algorithms have not yet investigated the dense subgraph discovery of k-truss, where each edge is contained in at least k-2 triangles. This paper aims at finding k-truss efficiently in public-private graphs. The core of our solution is a novel algorithm to update k-truss with node insertions. We develop a classification-based hybrid strategy of node insertions and edge insertions to incrementally compute k-truss in public-private graphs. Extensive experiments validate the superiority of our proposed algorithms against state-of-the-art methods on real-world datasets.

[1]  Kazumi Saito,et al.  Extracting Communities from Complex Networks by the k-dense Method , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[2]  E. Silerova,et al.  Knowledge and information systems , 2018 .

[3]  Jia Wang,et al.  Truss Decomposition in Massive Networks , 2012, Proc. VLDB Endow..

[4]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[5]  Bing Liu,et al.  Correlation Clustering , 2009, Encyclopedia of Database Systems.

[6]  Hong Cheng,et al.  VizCS: Online Searching and Visualizing Communities in Dynamic Graphs , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

[7]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[8]  Laks V. S. Lakshmanan,et al.  Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms , 2016, SIGMOD Conference.

[9]  Keith W. Ross,et al.  Facebook users have become much more private: A large-scale study , 2012, 2012 IEEE International Conference on Pervasive Computing and Communications Workshops.

[10]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[11]  Yuichi Yoshida,et al.  Cycle and flow trusses in directed networks , 2016, Royal Society Open Science.

[12]  Morteza Zadimoghaddam,et al.  Fast Distributed Submodular Cover: Public-Private Data Summarization , 2016, NIPS.

[13]  Ge Zhang,et al.  Finding Communities with Hierarchical Semantics by Distinguishing General and Specialized topics , 2018, IJCAI.

[14]  Yuan-Shun Dai,et al.  A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis , 2017, AAAI.

[15]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[16]  Chiara Orsini,et al.  k-dense communities in the internet AS-level topology , 2011, 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011).

[17]  Edith Cohen,et al.  Summarizing data using bottom-k sketches , 2007, PODC '07.

[18]  Srinivasan Parthasarathy,et al.  Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[19]  Jeffrey Xu Yu,et al.  Querying k-truss community in large and dynamic graphs , 2014, SIGMOD Conference.

[20]  Yanchun Zhang,et al.  Community Detection in Attributed Graphs: An Embedding Approach , 2018, AAAI.

[21]  Alice M. Obenchain-Leeson,et al.  Volume 6 , 1998 .

[22]  Jianliang Xu,et al.  PP-DBLP: Modeling and Generating Attributed Public-Private Networks with DBLP , 2018, 2018 IEEE International Conference on Data Mining Workshops (ICDMW).

[23]  Anthony K. H. Tung,et al.  Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis , 2012, Proc. VLDB Endow..

[24]  Fan Zhang,et al.  Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem , 2017, AAAI.

[25]  Jian Pei,et al.  Mining cross-graph quasi-cliques in gene expression and protein interaction data , 2005, 21st International Conference on Data Engineering (ICDE'05).

[26]  Nicole Immorlica,et al.  Maximizing Influence in an Unknown Social Network , 2018, AAAI.

[27]  R. J. Mokken,et al.  Cliques, clubs and clans , 1979 .

[28]  Ying Zhang,et al.  Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems , 2020, IEEE Transactions on Knowledge and Data Engineering.