Code and data for the paper

Pascal Welke, Florian Seiffarth, Michael Kamp and Stefan Wrobel: HOPS: Probabilistic Subtree Mining for Small and Large Graphs. KDD 2020

• bibtex
• official version
• free version
• short promo video

If you use this work, please cite our paper.

You can find the code for experiments and plot generation of Section 6.1: Approximate Counting in Large Graphs in the /largegraph/ folder. The code for experiments and plot generation of Section 6.2: Probabilistic Frequent Subtree Mining is located in the /smallgraphs/ folder.

The code has been tested on recent Ubuntu Linux distributions (18.04, 19.10).

Set up the experiments and evaluation:

1. (Clone the project)

2. Set up python3 conda environment for hops:

   • conda create -n hops python=3.7 joblib matplotlib
   • pip install tikzplotlib

3. Set up python2 for Ravkic algorithms:

   • install python2.7: sudo apt install python2.7 python-pip
   • sudo apt-get install python-tk

4. Set up experiments:

   • in run_exp.py set main_path=".../largegraph"
   • run run_exp.py with your favourite graph, pattern size and time limit

5. Set up evaluation:

   • in evaluate.py set path=".../largegraph/
   • run evaluate.py for evaluation

Set up the experiments and evaluation:

1. (Clone the project)
2. Download and unzip the graphs "com-amazon.ungraph", "com-orkut.ungraph", "com-lj.ungraph" from https://snap.stanford.edu/data/index.html into the folder snap_big_graphs
3. Adjust paths in main_snap.py
4. Install the required packages
5. run main_snap.py

1. (Clone the project)
2. Install gnu parallel: sudo apt install parallel
3. Run smallgraphs/runExperiments.sh
4. Inspect results in the subfolders