collection of data mining algorithms on big graphs and time series
Welcome to spartan2
Graphs and time series are fundamental representations of many key applications in a wide range of users' online behaviors (e.g. social media, shopping, Apps), finance (e.g. stock tradings, bank transfers), IoT networks (e.g. sensor readings, smart power grid), and healthcare (e.g. electrocardiogram, photoplethysmogram, respiratory inductance plethysmography). In practice, we find that thinking graphs and time series as matrices or tensors can enable us to find efficient (near linear), interpretable, yet accurate solutions in many applications.
Therefore, our goal is developping a collectioin of algorithms on graphs and time series based on tensors (matrix is a 2-mode tensor).
In real world, those tensors are sparse, and we are required to make use of the sparsity to develop efficient algorithms. That is why we name the backend package and a private UI interface as
SparTAn: Sparse Tensor Analytics.
spartan2 is the backend name. The package named spartan can be imported and run independently as a usual python package. Everything in package spartan is viewed as a tensor (sparse).
This project requires Python 3.7 and upper. We suggest recreating the experimental environment using Anaconda through the following steps.
Install the appropriate version for Anaconda from here - https://www.anaconda.com/distribution/
Create a new conda environment named "spartan"
conda create -n spartan python=3.7 conda activate spartan
- If you are a normal USER,
download the package from pip
pip install spartan2
- If you are a DEVELOPER and contribute to the project, or prefer to run directly on the code,
please do the following setup
4.1 Clone the project from github
git clone <this repository link>/spartan2.git
4.2 Install requirements.
# [not recommended]# pip install --user --requirement requirements # using conda tool conda install --force-reinstall -y --name spartan -c conda-forge --file requirements
or use the following way
# this may not work in ubuntu 18.04 python setup.py install
4.3 Install code in development mode
# in parent directory of spartan2 pip install -e spartan2
4.4 Since you install your package to a location other than the user site-packages directory, you will need to add environment variable PYTHONPATH in ~/.bashrc
export PYTHONPATH=/<dir to spartan2>/spartan2:$PYTHONPATH
or prepend the path to that directory to your PYTHONPATH environment variable.
import sys sys.path.append("/<dir to spartan2>/spartan2")
or do as follows
#find directory of site-packages python -c 'import site; print(site.getsitepackages())' #add \<name\>.pth file in your site-packages directory with string '/<dir to spartan2>/spartan2'
- start jupyter notebook, and try live tutorials for demos:
Table of Contents
All contents are collected in another repository spartan-tutorials, you can clone that repository to get all the notebooks and example data to run on your own.
Part 1: Basic
Part 2: Big Graphs
- Graph start
- SpokEn: an implementation of EigenSpokes by SVD.
- Fraudar: a wrapper of Fraudar algorithm.
- Holoscope: based on HoloScope
Part 3: Time Series
For more details to use spartan2, please see the api docs readthedocs.
- Shenghua Liu, Bryan Hooi, Christos Faloutsos, A Contrast Metric for Fraud Detection in Rich Graphs, IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol 31, Issue 12, Dec. 1 2019, pp. 2235-2248.
- Shenghua Liu, Bryan Hooi, and Christos Faloutsos, "HoloScope: Topology-and-Spike Aware Fraud Detection," In Proc. of ACM International Conference on Information and Knowledge Management (CIKM), Singapore, 2017, pp.1539-1548.
- Prakash, B. Aditya, Ashwin Sridharan, Mukund Seshadri, Sridhar Machiraju, and Christos Faloutsos. "Eigenspokes: Surprising patterns and scalable community chipping in large graphs." In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 435-448. Springer, Berlin, Heidelberg, 2010.
- Wenjie Feng, Shenghua Liu, Christos Faloutsos, Bryan Hooi, Huawei Shen, Xueqi Cheng, EagleMine: Vision-Guided Mining in Large Graphs, ACM SIGKDD 2018, ODD Workshop on Outlier Detection De-constructed, August 20th, London UK.
- Bryan Hooi, Shenghua Liu, Asim Smailagic, and Christos Faloutsos, “BEATLEX: Summarizing and Forecasting Time Series with Patterns,” The European Conference on Machine Learning & Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD), Skopje, Macedonia, 2017.
- Hooi, Bryan, Hyun Ah Song, Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos. "Fraudar: Bounding graph fraud in the face of camouflage." In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 895-904. 2016.
- Zhou, Bin, Shenghua Liu, Bryan Hooi, Xueqi Cheng, and Jing Ye. "BeatGAN: Anomalous Rhythm Detection using Adversarially Generated Time Series." In IJCAI, pp. 4433-4439. 2019.
- Houquan Zhou, Shenghua Liu, Kyuhan Lee, Kijung Shin, Huawei Shen and Xueqi Cheng. "DPGS: Degree-Preserving Graph Summarization." In SDM, 2021.
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.