Generalized optimization framework for graph-based semi-supervised learning

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 966-974

  Avrachenkov, Konstantin ^a   Gonçalves, Paulo ^b   Mishenin, Alexey ^c   Sokol, Marina ^a  

^a INRIA   (France)

^b INRIA   (France)

^c ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

Graph based semi supervised learning; Optimization framework; Pagerank; Wikipedia article classifi cation

Indexed keywords

DATA MINING; GRAPHIC METHODS; LAPLACE TRANSFORMS; MACHINE LEARNING; RANDOM PROCESSES; SPACE DIVISION MULTIPLE ACCESS;

NORMALIZED LAPLACIAN; OPTIMIZATION FRAMEWORK; PAGERANK; PROBABILISTIC INTERPRETATION; REGULARIZATION PARAMETERS; SEMI- SUPERVISED LEARNING; SMOOTHING KERNELS; WIKIPEDIA ARTICLES;

SUPERVISED LEARNING;

EID: 84880220875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.83     Document Type: Conference Paper

References (16)

1. Yasemin Altun, David McAllester, and Mikhail Belkin. Maximum margin semi-supervised learning for structured variables. In Y.Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 33-40. MIT Press, Cambridge, MA, 2005.
2. Konstantin Avrachenkov. Analytic Perturbation The- ory and its Applications. University of South Australia, 1999.
3. Konstantin Avrachenkov, Vladimir Dobrynin, Danil Nemirovsky, Son Kim Pham, and Elena Smirnova. Pagerank based clustering of hypertext document collections. In Proceedings of the 31st annual interna- Tional ACM SIGIR conference on Research and devel- opment in information retrieval, SIGIR '08, pages 873-874. ACM, 2008.
4. Konstantin Avrachenkov and Nelly Litvak. The effect of new links on google pagerank. Stochastic Models, 22(2):319-332, 2006.
5. Fan Chung and Alexander Tsiatas. Finding and visualizing graph clusters using pagerank optimization. In Ravi Kumar and Dandapani Sivakumar, editors, Algorithms and Models for the Web-Graph, volume 6516 of LNCS, pages 86-97. Springer, 2010.
6. Anne Condon and Richard M. Karp. Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms, 18(2):116-140, 2001.
7. Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, and Christos Faloutsos. Semi-supervised learning based on semiparametric regularization. In SDM, pages 132-142, 2008.
8. Donald E. Knuth. The Stanford GraphBase: A plat- form for combinatorial computing. ACM, New York, NY, USA, 1993.
9. Amy N. Langville and Carl D. Meyer. Google page rank and beyond. Princeton University Press, 2006.
10. Cleve B. Moler. Numerical Computing with MATLAB. 2004.
11. Mark E.J. Newman and Michelle Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, 2004.
12. Martin L. Puterman. Markov Decision Processes: Dis- crete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, USA, 1st edition, 1994.
13. George Yin and Qing Zhang. Continuous-time Markov chains and applications: A singular perturbation ap- proach. Applications of mathematics. Springer, 1998.
14. Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Scholkopf. Learning with local and global consistency. In Advances in Neural Information Processing Systems 16, pages 32- 328. MIT Press, 2004.
15. Dengyong Zhou and Christopher J. C. Burges. Spectral clustering and transductive learning with multiple views. In Proceedings of the 24th international confer- ence on Machine learning, ICML '07, pages 1159-1166. ACM, 2007.
16. Xiaojin Zhu and Andrew B. Goldberg. Introduction to semi-supervised learning. Synthesis Lectures on Arti-cial Intelligence and Machine Learning, 3(1):1-130, 2009.