Active semi-supervised learning using submodular functions

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 274-282

  Guillory, Andrew ^a   Bilmes, Jeff ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; GRAPHIC METHODS; LEARNING SYSTEMS;

ACTIVE LEARNING; ERROR BOUND; GRAPH CUT; NP COMPLETE; SEMI-SUPERVISED LEARNING METHODS; SUBMODULAR FUNCTIONS; UNDIRECTED WEIGHTED GRAPHS;

SEMI-SUPERVISED LEARNING;

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

References (23)

1. P. Afshani, E. Chiniforooshan, R. Dorrigiv, A. Farzan, M. Mirzazadeh, N. Simjour, and H. Zarrabi-Zadeh. On the complexity of finding an unknown cut via vertex queries. In COCOON, 2007.
2. P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. Algorithms and Complexity, pages 288-298, 1997. (Pubitemid 127042997)
3. Y. Bengio, O. Delalleau, and N. Le Roux. Label propagation and quadratic criterion. In O. Chapelle, B. Schölkopf, and A. Zien, editors, Semi-Supervised Learning. MIT Press, 2006.
4. A. Blum and S. Chawla. Learning from labeled and unlabeled data using graph mincuts. In ICML, 2001.
5. A. Blum, J. Lafferty, M. R. Rwebangira, and R. Reddy. Semi-supervised learning using randomized mincuts. In ICML, 2004.
6. N. Cesa-Bianchi, C. Gentile, and F. Vitale. Fast and optimal prediction of a labeled tree. In COLT, 2009.
7. N. Cesa-Bianchi, C. Gentile, F. Vitale, and G. Zappella. Active Learning on Graphs via Spanning Trees. In NIPS Workshop on Networks Across Disciplines, 2010a.
8. N. Cesa-Bianchi, C. Gentile, F. Vitale, and G. Zappella. Active learning on trees and graphs. In COLT, 2010b.
9. O. Chapelle, B. Schölkopf, and A. Zien. Semisupervised learning. MIT press, 2006.
10. W. Cunningham. Optimal attack and reinforcement of a network. Journal of the ACM, 1985.
11. S. Fujishige. Submodular Functions and Optimization. 2005.
12. S. Fujishige, T. Hayashi, and S. Isotani. The minimumnormpoint algorithm applied to submodular function minimization and linear programming, 2006.
13. M. Garey and D. Johnson. Computers and intractability. A guide to the theory of NP-completeness. 1979.
14. A. Guillory and J. Bilmes. Label Selection on Graphs. In NIPS, 2009.
15. M. Herbster and G. Lever. Predicting the Labelling of a Graph via Minimum p-Seminorm Interpolation. In COLT, 2009.
16. S. Iwata and J. B. Orlin. A simple combinatorial algorithm for submodular function minimization. In SODA, 2009.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 1999.
18. M. Minoux. Accelerated greedy algorithms for maximizing submodular set functions. Optimization Techniques, pages 234-243, 1978.
19. H. Narayanan. Submodular Functions and Electrical Networks. 1997.
20. P. Sen, G. M. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad. Collective classification in network data. AI Magazine, 29(3):93-106, 2008.
21. P. Stobbe and A. Krause. Effcient minimization of decomposable submodular functions. NIPS, 2010.
22. L. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2 (4), 1982.
23. H. Yang and D. Wong. Effcient Network Flow Based Min-Cut Balanced Partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(12):1533, 1996