ANF                     Fuse affinity networks (i.e., matrices) through
                        one-step or two-step random walk
affinity_matrix         Generate a symmetric affinity matrix based on a
                        distance matrix using 'local' Gaussian kernel
eval_clu                Evaluate clustering result
kNN_graph               Calculate k-nearest-neighbor graph from
                        affinity matrix and normalize it as transition
                        matrix
pod                     Finding optimal discrete solutions for spectral
                        clustering
spectral_clustering     spectral_clustering
