메뉴 건너뛰기




Volumn 4863 LNCS, Issue , 2007, Pages 150-165

Local computation of PageRank contributions

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; VECTORS; WEB SERVICES;

EID: 38149020737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_12     Document Type: Conference Paper
Times cited : (94)

References (20)
  • 5
    • 84924195580 scopus 로고    scopus 로고
    • Bookmark-coloring algorithm for personalized pagerank computing
    • Berkhin, P.: Bookmark-coloring algorithm for personalized pagerank computing. Internet Math. 3(1), 41-62 (2006)
    • (2006) Internet Math , vol.3 , Issue.1 , pp. 41-62
    • Berkhin, P.1
  • 6
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107-117 (1998)
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 7
    • 18744409364 scopus 로고    scopus 로고
    • Local methods for estimating pagerank values
    • Chen, Y., Gan, Q., Suei, T.: Local methods for estimating pagerank values. In: Proc. of CIKM, pp. 381-389 (2004)
    • (2004) Proc. of CIKM , pp. 381-389
    • Chen, Y.1    Gan, Q.2    Suei, T.3
  • 9
    • 35048902592 scopus 로고    scopus 로고
    • Fogaras, D., Racz, B.: Towards scaling fully personalized pagerank. In: Leonardi, S. (ed.) WAW 2004. LNCS, 3243, pp. 105-117. Springer, Heidelberg (2004)
    • Fogaras, D., Racz, B.: Towards scaling fully personalized pagerank. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol. 3243, pp. 105-117. Springer, Heidelberg (2004)
  • 11
  • 12
    • 38149029726 scopus 로고    scopus 로고
    • Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Web content categorization using link information. Technical report, Stanford University (2006)
    • Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Web content categorization using link information. Technical report, Stanford University (2006)
  • 13
    • 0041848443 scopus 로고    scopus 로고
    • Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
    • Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784-796 (2003)
    • (2003) IEEE Trans. Knowl. Data Eng , vol.15 , Issue.4 , pp. 784-796
    • Haveliwala, T.H.1
  • 16
    • 0011716017 scopus 로고
    • What can be computed locally?
    • Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259-1277 (1995)
    • (1995) SIAM J. Comput , vol.24 , Issue.6 , pp. 1259-1277
    • Naor, M.1    Stockmeyer, L.2
  • 17
    • 34250653315 scopus 로고    scopus 로고
    • Ntoulas, A., Najork, M., Manasse, M., Fetterly, D.: Detecting spam web pages through content analysis. In: WWW 2006: Proceedings of the 15th international conference on World Wide Web, pp. 83-92. ACM Press, New York (2006)
    • Ntoulas, A., Najork, M., Manasse, M., Fetterly, D.: Detecting spam web pages through content analysis. In: WWW 2006: Proceedings of the 15th international conference on World Wide Web, pp. 83-92. ACM Press, New York (2006)
  • 19
    • 34250637587 scopus 로고    scopus 로고
    • Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297-306 (2006)
    • Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297-306 (2006)
  • 20
    • 4544280485 scopus 로고    scopus 로고
    • Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
    • ACM Press, New York
    • Spielman, D.A., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: ACM STOC-04, pp. 81-90. ACM Press, New York (2004)
    • (2004) ACM STOC-04 , pp. 81-90
    • Spielman, D.A.1    Teng, S.-H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.