Preserving personalized pagerank in subgraphs

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 793-800

  Vattani, Andrea ^a   Chakrabarti, Deepayan ^b   Gurevich, Maxim ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC GRAPHS; CLUSTERING ACCURACY; CLUSTERING COEFFICIENT; DEGREE DISTRIBUTIONS; FINE-GRAINED RELATIONSHIPS; INDUCED SUBGRAPHS; PAGERANK; PAGERANK VALUE; REAL-WORLD GRAPHS; SAMPLING METHOD; SUBGRAPHS;

LEARNING SYSTEMS;

GRAPH THEORY;

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

References (20)

1. Andersen, R., Chung, F., and Lang, K. Local partitioning for directed graphs using pagerank. Internet Math., 5(1-2):3-22, 2008.
2. Condon, Anne and Karp, Richard M. Algorithms for graph partitioning on the planted partition model. Random Structures & Algorithms, 18:116-140, 1999.
3. Gkantsidis, C., Mihail, M., and Saberi, A. Random walks in peer-to-peer networks: Algorithms and evaluation. P2P Computing Systems, 63(3), 2006.
4. Gori, M. and Pucci, A. Itemrank: A random-walk based scoring algorithm for recommender engines. In IJCAI, pp. 2766-2771, 2007.
5. Gyöngyi, Z., Garcia-Molina, H., and Pedersen, J. Combating web spam with trustrank. VLDB, 2004.
6. Haveliwala, Taher H. Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng., 15(4), 2003.
7. Hübler, C., Kriegel, H.-P., Borgwardt, K., and Ghahramani, Z. Metropolis algorithms for representative subgraph sampling. In ICDM, 2008.
8. Jeh, Glen and Widom, Jennifer. Scaling personalized web search. In WWW, pp. 271-279, 2003.
9. Jia, Yuntao, Hoberock, Jared, Garland, Michael, and Hart, John. On the visualization of social and other scale-free networks. IEEE Trans. on Visualization and Computer Graphics, pp. 1285-1292, 2008.
10. Kannan, Ravi, Vempala, Santosh, and Vetta, Adrian. On clusterings: Good, bad and spectral. Journal of ACM, 51, 2004.
11. Karypis, George and Kumar, Vipin. A fast and highly quality multilevel scheme for partitioning irregular graphs. Journal on Scientific Computing, pp. 359-392, 1999.
12. Leskovec, Jure and Faloutsos, Christos. Sampling from large graphs. In KDD, pp. 631-636, 2006.
13. Maiya, Arun S. and Berger-Wolf, Tanya Y. Sampling community structure. In WWW, pp. 701-710, 2010.
14. Meila, Marina and Shi, Jianbo. Learning segmentation by random walks. In NIPS, pp. 873-879, 2000.
15. Moitra, Ankur. Approximation algorithms for multi-commodity type problems with guarantees independent of the graph size. In FOCS, pp. 3-12, 2009.
16. Orponen, P., Schaeffer, S., and Gaytán, V. Locally computable approximations for spectral clustering and absorption times of random walks. CoRR, abs/0810.4061, 2008.
17. Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., and Zhao, B. Measurement-calibrated graph models for social network experiments. In WWW, 2010.
18. Sarlós, T., Benczúr, A., Csalogány, K., Fogaras, D., and Rácz, B. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW, pp. 297-306, 2006.
19. Szummer, M. and Jaakkola, T. Partially labeled classification with markov random walks. In NIPS, 2001.
20. van Dongen, Stijn Marinus. Graph clustering by flow simulation. PhD thesis, Univesity of Utrecht, 2000.