Semi-supervised classification from discriminative random walks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5211 LNAI, Issue PART 1, 2008, Pages 162-177

  Callut, Jérôme ^a,b   Françoisse, Kevin ^a,b   Saerens, Marco ^a,b   Dupont, Pierre ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b LOUVAIN SCHOOL OF MANAGEMENT   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GRAPH THEORY; NUMERICAL ANALYSIS; ROBOT LEARNING; SUPERVISED LEARNING;

BETWEENNESS; COMPUTATION TIMES; LABELED NODES; LAPLACIAN; LARGE GRAPHS; LINEAR TIME COMPLEXITIES; NOVEL TECHNIQUES; PASSAGE TIMES; RANDOM WALKS; SUPERVISED CLASSIFICATIONS; UNDIRECTED GRAPHS;

LEARNING SYSTEMS;

EID: 56049120372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87479-9_29     Document Type: Conference Paper

References (15)

1. Callut, J.: First Passage Times Dynamics in Markov Models with Applications to HMM Induction, Sequence Classification, and Graph Mining. Phd thesis dissertation, Universite catholique de Louvain (October 2007)
2. Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control 58(9), 1505-1514 (1997)
3. Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Automation and Remote Control 59(10), 1443-1459 (1998)
4. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1983)
5. Macskassy, S.A., Provost, F.: Classi cation in networked data: A toolkit and a univariate case study. J. Mach. Learn. Res. 8, 935-983 (2007)
6. Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social networks 27, 39-54 (2005)
7. Norris, J.R.: Markov Chains. Cambridge University Press, United Kingdom (1997)
8. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report, Computer System Laboratory, Stanford University (1998)
9. Rabiner, L., Juang, B.-H.: Fundamentals of Speech Recognition. Prentice-Hall, Englewood Cliffs (1993)
10. Smola, A.J., Kondor, R.: Kernels and regularization on graphs. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 144-158. Springer, Heidelberg (2003)
11. Szummer, M., Jaakkola, T.: Partially labeled classification with markov random walks. In: Advances in Neural Information Processing Systems, vol. 14, pp. 945-952 (2002)
12. Tsuda, K., Noble, W.S.: Learning kernels from biological networks by maximizing entropy. Bioinformatics 20(1), 326-333 (2004)
13. Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 440-449. Springer, Heidelberg (2005)
14. Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: ICML 2005: Proceedings of the 22nd international conference on Machine learning, pp. 1036-1043. ACM, New York (2005)
15. Zhou, D., Schölkopf, B.: Learning from labeled and unlabeled data using random walks. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 237-244. Springer, Heidelberg (2004)