Local Partition in Rich Graphs

03/14/2018
by   Scott Freitas, et al.
0

Local graph partitioning is a key graph mining tool that allows researchers to identify small groups of interrelated nodes (e.g. people) and their connective edges (e.g. interactions). Because local graph partitioning is primarily focused on the network structure of the graph (vertices and edges), it often fails to consider the additional information contained in the attributes. In this paper we propose---(i) a scalable algorithm to improve local graph partitioning by taking into account both the network structure of the graph and the attribute data and (ii) an application of the proposed local graph partitioning algorithm (AttriPart) to predict the evolution of local communities (LocalForecasting). Experimental results show that our proposed AttriPart algorithm finds up to 1.6× denser local partitions, while running approximately 43× faster than traditional local partitioning techniques (PageRank-Nibble). In addition, our LocalForecasting algorithm shows a significant improvement in the number of nodes and edges correctly predicted over baseline methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2020

2PS: High-Quality Edge Partitioning with Two-Phase Streaming

Graph partitioning is an important preprocessing step to distributed gra...
research
07/15/2019

Partitioning Graphs for the Cloud using Reinforcement Learning

In this paper, we propose Revolver, a parallel graph partitioning algori...
research
11/17/2017

Loom: Query-aware Partitioning of Online Graphs

As with general graph processing systems, partitioning data over a clust...
research
12/22/2017

ADWISE: Adaptive Window-based Streaming Edge Partitioning for High-Speed Graph Processing

In recent years, the graph partitioning problem gained importance as a m...
research
02/18/2021

Buffered Streaming Graph Partitioning

Partitioning graphs into blocks of roughly equal size is a widely used t...
research
04/02/2019

Towards a practical k-dimensional Weisfeiler-Leman algorithm

The k-dimensional Weisfeiler-Leman algorithm is a well-known heuristic f...
research
05/11/2022

Local Motif Clustering via (Hyper)Graph Partitioning

A widely-used operation on graphs is local clustering, i.e., extracting ...

Please sign up or login with your details

Forgot password? Click here to reset