Semi-supervised learning using randomized mincuts
暂无分享,去创建一个
John D. Lafferty | Avrim Blum | Rajashekar Reddy | Mugizi Robert Rwebangira | J. Lafferty | A. Blum | M. Rwebangira | Rajashekar Reddy | Avrim Blum
[1] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[2] Alon Itai,et al. Learnability with Respect to Fixed Distributions , 1991, Theor. Comput. Sci..
[3] H. Balsters,et al. Learnability with respect to fixed distributions , 1991 .
[4] Mark Jerrum,et al. Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..
[5] Jonathan J. Hull,et al. A Database for Handwritten Text Recognition Research , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Martin E. Dyer,et al. On the relative complexity of approximate counting problems , 2000, APPROX.
[7] Avrim Blum,et al. Learning from Labeled and Unlabeled Data using Graph Mincuts , 2001, ICML.
[8] David G. Wagner,et al. On the Chromatic Roots of Generalized Theta Graphs , 2001, J. Comb. Theory, Ser. B.
[9] Zoubin Ghahramani,et al. Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.
[10] Thorsten Joachims,et al. Transductive Learning via Spectral Graph Partitioning , 2003, ICML.
[11] Jon M. Kleinberg,et al. Detecting a Network Failure , 2004, Internet Math..
[12] John Shawe-Taylor,et al. PAC Bayes and Margins , 2003 .
[13] David A. McAllester. PAC-Bayesian Stochastic Model Selection , 2003, Machine Learning.
[14] Aleksandrs Slivkins,et al. Network failure detection and graph connectivity , 2004, SODA '04.