Beyond pairwise classification and clustering using hypergraphs
暂无分享,去创建一个
[1] Bernhard Schölkopf,et al. Learning with Local and Global Consistency , 2003, NIPS.
[2] Bernhard Schölkopf,et al. Learning from labeled and unlabeled data on a directed graph , 2005, ICML.
[3] J. Rodri´guez. On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs , 2002 .
[4] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[5] Shang-Hua Teng,et al. Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) , 2003, ArXiv.
[6] Daniele Frigioni,et al. Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach , 2001, ICTCS.
[7] Shang-Hua Teng,et al. Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/ , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[8] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[9] Jianbo Shi,et al. A Random Walks View of Spectral Segmentation , 2001, AISTATS.