Learning Theory: An Approximation Theory Viewpoint (Cambridge Monographs on Applied & Computational Mathematics)
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
The Journal of Machine Learning Research
A tutorial on spectral clustering
Statistics and Computing
Clustering high dimensional data: A graph-based relaxed optimization approach
Information Sciences: an International Journal
Error bounds of multi-graph regularized semi-supervised classification
Information Sciences: an International Journal
Learning with l1-graph for image analysis
IEEE Transactions on Image Processing
Hi-index | 0.00 |
The progressively scale of online social network leads to the difficulty of traditional algorithms on detecting communities. We introduce an efficient and fast algorithm to detect community structure in social networks. Instead of using the eigenvectors in spectral clustering algorithms, we construct a target function for detecting communities. The whole social network communities will be partitioned by this target function. We also analyze and estimate the generalization error of the algorithm. The performance of the algorithm is compared with the standard spectral clustering algorithm, which is applied to different well-known instances of social networks with a community structure, both computer generated and from the real world. The experimental results demonstrate the effectiveness of the algorithm.