Tensor Spectral Clustering. This is the code used in the paper:

Austin R. Benson, David F. Gleich, and Jure Leskovec. "Tensor Spectral Clustering for Partitioning Higher-order Network Structures". In Proceedings of the 2015 SIAM International Conference on Data Mining (SDM), 2015.

The full version of the paper is available here.

The code is released under the simplified BSD license. Please see the LICENSE file.

For help using the code, please contact Austin: arbenson AT stanford DOT edu.

What you need:

• Compiler supporting C++11
• SNAP for C++

Edit the Makefile for your compiler and the location of SNAP.

First, build the example:

make layered_flow

Run the algorithms:

./layered_flow

Look at the communities for tensor spectral clustering, the directed Laplacian, and the subgraph directed Laplacian:

cat layered_flow_tsc_comms.txt
cat layered_flow_dl_comms.txt
cat layered_flow_subdl_comms.txt

First, build the example:

make anomaly

Run the algorithms:

./anomaly

Look at the communities for tensor spectral clustering, the directed Laplacian, and the subgraph directed Laplacian:

cat anomaly_tsc_comms.txt
cat anomaly_dl_comms.txt
cat anomaly_subdl_comms.txt

We will now go through the steps for running the directed 3-cycle cut algorithms on wiki-Vote, one of the SNAP networks. First, download the data:

wget http://snap.stanford.edu/data/wiki-Vote.txt.gz
gunzip wiki-Vote.txt.gz
mv wiki-Vote.txt data/

Now, filter the graph:

bash scripts/filter_data.sh wiki-Vote

Build the partitioning code:

make d3c_test

Run the algorithm:

./d3c_test 0

Visualize the number of directed 3-cycles cut as a function of the smaller partition size:

python scripts/d3c_plot.py wiki-Vote-filter num_cut