Semi-supervised learning using randomized mincuts

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 97-104

  Blum, Avrim ^a   Lafferty, John ^a   Rwebangira, Mugizi Robert ^a   Reddy, Rajashekar ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; DATASETS; DIGIT RECOGNITION; MARKOV RANDOM FIELDS (MRF);

COMPUTATION THEORY; COMPUTER SCIENCE; DATA PROCESSING; FUNCTIONS; GRAPH THEORY; LEARNING ALGORITHMS; POLYNOMIALS; PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RELAXATION PROCESSES;

LEARNING SYSTEMS;

EID: 14344266781     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Benedek, G., & Itai, A. (1991). Learnability with respect to a fixed distribution. Theoretical Computer Science, 86, 377-389.
2. Blum, A., & Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. Proceedings of the 18th International Conference on Machine Learning (pp. 19-26). Morgan Kaufmann.
3. Brown, J. I., Hickman, C. A., Sokal, A. D., & Wagner, D. G. (2001). Chromatic roots of generalized theta graphs. J. Combinatorial Theory, Series B, 83, 272-297.
4. Dyer, M., Goldberg, L. A., Greenhill, C., & Jerrum, M. (2000). On the relative complexity of approximate counting problems. Proceedings of APPROX'00, Lecture Notes in Computer Science 1913 (pp. 108-119).
5. Freund, Y., Mansour, Y., & Schapire, R. (2003). Generalization bounds for averaged classifiers (how to be a Bayesian with-out believing). To appear in Annals of Statistics. Preliminary version appeared in Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics, 2001.
6. Greig, D., Porteous, B., & Seheult, A. (1989). Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, 51, 271-279.
7. Hull, J. (1994). A database for handwritten text recognition research. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16, 550-554.
8. Jerrum, M., & Sinclair, A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing, 22, 1087-1116.
9. Joachims, T. (2003). Transductive learning via spectral graph partitioning. Proceedings of the International Conference on Machine Learning (ICML) (pp. 290-297).
10. Kleinberg, J. (2000). Detecting a network failure. Proc. 41st IEEE Symposium on Foundations of Computer Science (pp. 231-239).
11. Kleinberg, J., Sandler, M., & Slivkins, A. (2004). Network failure detection and graph connectivity. Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (pp. 76-85).
12. Langford, J., & Shawe-Taylor, J. (2002). PAC-bayes and margins. Neural Information Processing Systems.
13. McAllester, D. (2003). PAC-bayesian stochastic model selection. Machine Learning, 51, 5-21.
14. Zhu, X., Gharahmani, Z., & Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. Proceedings of the 20th International Conference on Machine Learning (pp. 912-919).