Loading...

Fast algorithm for k-truss discovery on public-private graphs

Ebadian, S ; Sharif University of Technology | 2019

37 Viewed
  1. Type of Document: Article
  2. Publisher: International Joint Conferences on Artificial Intelligence , 2019
  3. Abstract:
  4. 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. © 2019 International Joint Conferences on Artificial Intelligence. All rights reserved
  5. Keywords:
  7. Source: 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, 10 August 2019 through 16 August 2019 ; Volume 2019-August , 2019 , Pages 2258-2264 ; 10450823 (ISSN); 9780999241141 (ISBN)
  8. URL: https://www.ijcai.org/Proceedings/2019/0313.pdf