• Incremental-IO: Codes for incremental eigenpair computation for graph Laplacian matrices [Updated Feb. 2016]
Task: Computation time comparison of sequential smallest eigenpair between the batch method, the proposed incremental method (Incremental-IO), and the adapted Lanczos algorithm (Lanczos-IO)
Ref: "Incremental Method for Spectral Clustering of Increasing Orders",  ACM KDD 2016 MLG Workshop

  • AMOS: Codes in Python and Matlab (per requested) for AMOS: an automated model order selection algorithm for graph clustering / community detection
Task: Simply input a graph (sparse format is preferred) and AMOS will output reliable clustering results via automated clustering selection and multi-stage statistical testing