We develop an algorithm based on Supervised Random Walks that naturally combines the information from the network structure with node and edge level attributes. We achieve this by using these attributes to guide a random walk on the graph. We formulate a supervised learning task where the goal is to learn a function that assigns strengths to edges in the network such that a random walker is more likely to visit the nodes to which new links will be created in the future. We develop an efficient training algorithm to directly learn the edge strength estimation function.
Our experiments on the Facebook social graph and large collaboration networks show that our approach outperforms state-of-the-art unsupervised approaches as well as approaches that are based on feature extraction. %Z %U http://doi.acm.org/10.1145/1935826.1935914 %+ %^ %0 %0 Generic %A Backstrom, L. & Leskovec, J. %D 2010 %T Supervised Random Walks: Predicting and Recommending Links in Social Networks %E %B %C %I %V %6 %N %P %& %Y %S %7 %8 %9 %? %! %Z %@ %( %) %* %L %M %1 %2 Supervised Random Walks: Predicting and Recommending Links in Social Networks %3 misc %4 %# %$ %F backstrom2010supervised %K predicting, random, recommending, supervised, toread, walks %X Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near future or which existing interactions are we missing. Although this problem has been extensively studied, the challenge of how to effectively combine the information from the network structure with rich node and edge attribute data remains largely open. We develop an algorithm based on Supervised Random Walks that naturally combines the information from the network structure with node and edge level attributes. We achieve this by using these attributes to guide a random walk on the graph. We formulate a supervised learning task where the goal is to learn a function that assigns strengths to edges in the network such that a random walker is more likely to visit the nodes to which new links will be created in the future. We develop an efficient training algorithm to directly learn the edge strength estimation function. Our experiments on the Facebook social graph and large collaboration networks show that our approach outperforms state-of-the-art unsupervised approaches as well as approaches that are based on feature extraction. %Z cite arxiv:1011.4071 %U http://arxiv.org/abs/1011.4071 %+ %^ %0 %0 Conference Proceedings %A Ramage, Daniel; Hall, David; Nallapati, Ramesh & Manning, Christopher D. %D 2009 %T Labeled LDA: A Supervised Topic Model for Credit Attribution in Multi-labeled Corpora %E %B Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1 %C Stroudsburg, PA, USA %I Association for Computational Linguistics %V %6 %N %P 248--256 %& %Y %S EMNLP '09 %7 %8 %9 %? %! %Z %@ 978-1-932432-59-6 %( %) %* %L %M %1 %2 Labeled LDA %3 inproceedings %4 %# %$ %F Ramage:2009:LLS:1699510.1699543 %K lda, model, supervised, topic, toread %X A significant portion of the world's text is tagged by readers on social bookmarking websites. Credit attribution is an inherent problem in these corpora because most pages have multiple tags, but the tags do not always apply with equal specificity across the whole document. Solving the credit attribution problem requires associating each word in a document with the most appropriate tags and vice versa. This paper introduces Labeled LDA, a topic model that constrains Latent Dirichlet Allocation by defining a one-to-one correspondence between LDA's latent topics and user tags. This allows Labeled LDA to directly learn word-tag correspondences. We demonstrate Labeled LDA's improved expressiveness over traditional LDA with visualizations of a corpus of tagged web pages from del.icio.us. Labeled LDA outperforms SVMs by more than 3 to 1 when extracting tag-specific document snippets. As a multi-label text classifier, our model is competitive with a discriminative baseline on a variety of datasets. %Z %U http://dl.acm.org/citation.cfm?id=1699510.1699543 %+ %^ %0 %0 Conference Proceedings %A Schmidt-Thieme, Lars %D 2005 %T Compound Classification Models for Recommender Systems. %E %B Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005 %C Houston, Texas, USA %I IEEE Computer Society %V %6 %N %P 378-385 %& %Y %S %7 %8 %9 %? %! %Z %@ 0-7695-2278-5 %( %) %* %L %M %1 %2 %3 inproceedings %4 %# %$ %F DBLP:conf/icdm/Schmidt-Thieme05 %K recommender, learning, supervised %X %Z %U http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.46 %+ %^ %0 %0 Report %A Zhu, Xiaojin %D 2005 %T Semi-Supervised Learning Literature Survey %E %B %C %I Computer Sciences, University of Wisconsin-Madison %V %6 %N %P %& %Y %S %7 %8 %9 %? %! %Z %@ 1530 %( %) %* %L %M %1 %2 %3 techreport %4 %# %$ %F zhu05survey %K clustering, learning, semi, supervised, toread %X %Z %U http://pages.cs.wisc.edu/~jerryzhu/pub/ssl_survey.pdf %+ %^ %0 %0 Journal Article %A Basu, Sugato; Banerjee, Arindam & Mooney, Raymond J. %D 2004 %T Active Semi-Supervision for Pairwise Constrained Clustering %E %B %C %I %V %6 %N %P 333--344 %& %Y %S %7 %8 April %9 %? %! %Z %@ %( %) %* %L %M %1 %2 %3 article %4 %# %$ %F Basu:EtAl:04 %K active, clustering, semi, supervised %X Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constraints between pairs of examples. This paper presents a pairwise constrained clustering framework and a new method for actively selecting informative pairwise constraints to get improved clustering performance. The clustering and active learning methods are both easily scalable to large datasets, and can handle very high dimensional data. Experimental and theoretical results confirm that this active querying of pairwise constraints significantly improves the accuracy of clustering when given a relatively small amount of supervision. %Z %U http://www.cs.utexas.edu/users/ml/papers/semi-sdm-04.pdf %+ %^