L-MEGA: Local Motif Clustering on Time-Evolving Graphs

This repository is for the KDD' 2020 paper "Local Motif Clustering on Time-Evolving Graphs" (Link) .

Functionality

Given a seed node, a user-specified motif, and necessary hyperparameters, L-MEGA is able to produce a local cluster near the given seed node and densely connected by the given motifs.

Reference

If you use the materials from this repositiory, please refer to our paper.

@inproceedings{DBLP:conf/kdd/FuZH20,
  author    = {Dongqi Fu and
               Dawei Zhou and
               Jingrui He},
  title     = {Local Motif Clustering on Time-Evolving Graphs},
  booktitle = {{KDD} '20: The 26th {ACM} {SIGKDD} Conference on Knowledge Discovery
               and Data Mining, Virtual Event, CA, USA, August 23-27, 2020},
  pages     = {390--400},
  publisher = {{ACM}},
  year      = {2020},
  url       = {https://dl.acm.org/doi/10.1145/3394486.3403081},
  timestamp = {Mon, 24 Aug 2020 14:13:33 +0200},
  biburl    = {https://dblp.org/rec/conf/kdd/FuZH20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}