메뉴 건너뛰기




Volumn , Issue , 2011, Pages 631-640

Local computation of PageRank: The ranking side

Author keywords

IR theory: ranking; link and graph mining; local computation; PageRank; web and social media search

Indexed keywords

DETERMINISTIC ALGORITHMS; FUNDAMENTAL PROBLEM; GRAPH MINING; LOCAL ALGORITHM; LOCAL COMPUTATION; LOCAL SCORE; LOW COSTS; NODE GRAPH; PAGERANK; PAGERANK SCORE; SOCIAL MEDIA; SOCIAL NETWORKS; SUBNETWORKS;

EID: 83055179565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063670     Document Type: Conference Paper
Times cited : (21)

References (33)
  • 1
    • 0033661294 scopus 로고    scopus 로고
    • Does "authority" mean quality? Predicting expert quality ratings of web documents
    • B. Amento, L. Terveen, and W. Hill. Does "authority" mean quality? Predicting expert quality ratings of web documents. In Proc. of ACM SIGIR, pages 296-303. 2000.
    • (2000) Proc. of ACM SIGIR , pp. 296-303
    • Amento, B.1    Terveen, L.2    Hill, W.3
  • 3
    • 70349321258 scopus 로고    scopus 로고
    • Local approximation of PageRank and reverse PageRank
    • Z. Bar-Yossef and L.-T. Mashiach. Local approximation of PageRank and reverse PageRank. In Proc. of ACM CIKM, pages 279-288. 2008.
    • (2008) Proc. of ACM CIKM , pp. 279-288
    • Bar-Yossef, Z.1    Mashiach, L.-T.2
  • 6
  • 7
    • 19944376183 scopus 로고    scopus 로고
    • The WebGraph framework I: Compression techniques
    • P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proc. of WWW, pages 595-601. 2004.
    • (2004) Proc. of WWW , pp. 595-601
    • Boldi, P.1    Vigna, S.2
  • 10
    • 0002505172 scopus 로고    scopus 로고
    • The anatomy of a large scale hypertextual Web search engine
    • S. Brin and L. Page. The anatomy of a large scale hypertextual Web search engine. In Proc. of WWW. 1998.
    • Proc. of WWW. 1998
    • Brin, S.1    Page, L.2
  • 11
    • 0037048579 scopus 로고    scopus 로고
    • Complexity measures and decision tree complexity: A survey
    • H. Buhrman and R. D. Wolf. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science, 288(1):21-43, 2002.
    • (2002) Theoretical Computer Science , vol.288 , Issue.1 , pp. 21-43
    • Buhrman, H.1    Wolf, R.D.2
  • 12
    • 18744409364 scopus 로고    scopus 로고
    • Local methods for estimating PageRank values
    • Y.-Y. Chen, Q. Gan, and T. Suel. Local methods for estimating PageRank values. In Proc. of ACM CIKM, pages 381-389. 2004.
    • (2004) Proc. of ACM CIKM , pp. 381-389
    • Chen, Y.-Y.1    Gan, Q.2    Suel, T.3
  • 13
    • 20444396637 scopus 로고    scopus 로고
    • Efficient crawling through URL ordering
    • J. Cho, H. Garcia-Molina, and L. Page. Efficient crawling through URL ordering. Computer Networks, 30(1-7):161-172, 1998.
    • (1998) Computer Networks , vol.30 , Issue.1-7 , pp. 161-172
    • Cho, J.1    Garcia-Molina, H.2    Page, L.3
  • 14
    • 84924205346 scopus 로고    scopus 로고
    • Fast PageRank Computation via a Sparse Linear System
    • G. M. Del Corso, A. Gulli, and F. Romani. Fast PageRank Computation via a Sparse Linear System. Internet Mathematics, 2(3):251-273, 2005.
    • (2005) Internet Mathematics , vol.2 , Issue.3 , pp. 251-273
    • Del Corso, G.M.1    Gulli, A.2    Romani, F.3
  • 16
    • 84860502106 scopus 로고    scopus 로고
    • PageRanking WordNet synsets: An application to opinion mining
    • A. Esuli and F. Sebastiani. PageRanking WordNet synsets: An application to opinion mining. In Proc. of ACL, pages 424-431. 2007.
    • (2007) Proc. of ACL , pp. 424-431
    • Esuli, A.1    Sebastiani, F.2
  • 17
  • 18
    • 33749016498 scopus 로고    scopus 로고
    • Information revelation and privacy in online social networks
    • R. Gross and A. Acquisti. Information revelation and privacy in online social networks. In Proc. of ACM WPES, pages 71-80. 2005.
    • (2005) Proc. of ACM WPES , pp. 71-80
    • Gross, R.1    Acquisti, A.2
  • 20
    • 84870973609 scopus 로고    scopus 로고
    • Identifying key users in online social networks: A PageRank based approach
    • J. Heidemann, M. Klier, and F. Probst. Identifying key users in online social networks: A PageRank based approach. In Proc. of ICIS, 2010.
    • Proc. of ICIS, 2010
    • Heidemann, J.1    Klier, M.2    Probst, F.3
  • 22
    • 3042651890 scopus 로고    scopus 로고
    • The EigenTrust algorithm for reputation management in P2P networks
    • S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The EigenTrust algorithm for reputation management in P2P networks. In Proc. of WWW, pages 508-516. 2003.
    • (2003) Proc. of WWW , pp. 508-516
    • Kamvar, S.D.1    Schlosser, M.T.2    Garcia-Molina, H.3
  • 23
    • 84885651292 scopus 로고    scopus 로고
    • PageRank without hyperlinks: Structural re-ranking using links induced by language models
    • O. Kurland and L. Lee. PageRank without hyperlinks: Structural re-ranking using links induced by language models. In Proc. of ACM SIGIR, pages 306-313. 2005.
    • (2005) Proc. of ACM SIGIR , pp. 306-313
    • Kurland, O.1    Lee, L.2
  • 25
    • 17144368785 scopus 로고    scopus 로고
    • Rank-stability and rank-similarity of link-based Web ranking algorithms in authority-connected graphs
    • R. Lempel and S. Moran. Rank-stability and rank-similarity of link-based Web ranking algorithms in authority-connected graphs. Information Retrieval, 8:219-243, 2005.
    • (2005) Information Retrieval , vol.8 , pp. 219-243
    • Lempel, R.1    Moran, S.2
  • 26
    • 37149025751 scopus 로고    scopus 로고
    • PageRank: When order changes
    • M. Melucci and L. Pretto. PageRank: When order changes. In Proc. of ECIR, pages 581-588. 2007.
    • (2007) Proc. of ECIR , pp. 581-588
    • Melucci, M.1    Pretto, L.2
  • 27
    • 27644503675 scopus 로고    scopus 로고
    • GeneRank: Using search engine technology for the analysis of microarray experiments
    • J. L. Morrison, R. Breitling, D. J. Higham, and D. R. Gilbert. GeneRank: Using search engine technology for the analysis of microarray experiments. BMC Bioinformatics, 6:233, 2005.
    • (2005) BMC Bioinformatics , vol.6 , pp. 233
    • Morrison, J.L.1    Breitling, R.2    Higham, D.J.3    Gilbert, D.R.4
  • 28
    • 61649120796 scopus 로고    scopus 로고
    • What does it mean to converge in rank?
    • E. Peserico and L. Pretto. What does it mean to converge in rank? In Proc. of ICTIR, pages 239-245. 2007.
    • (2007) Proc. of ICTIR , pp. 239-245
    • Peserico, E.1    Pretto, L.2
  • 29
    • 33644507692 scopus 로고    scopus 로고
    • Semantic document engineering with WordNet and PageRank
    • P. Tarau, R. Mihalcea, and E. Figa. Semantic document engineering with WordNet and PageRank. In Proc. of ACM SAC, pages 782-786. 2005.
    • (2005) Proc. of ACM SAC , pp. 782-786
    • Tarau, P.1    Mihalcea, R.2    Figa, E.3
  • 32
    • 36349028666 scopus 로고    scopus 로고
    • Toward alternative measures for ranking venues: A case of database research community
    • S. Yan and D. Lee. Toward alternative measures for ranking venues: a case of database research community. In Proc. of ACM/IEEE JCDL, pages 235-244. 2007.
    • (2007) Proc. of ACM/IEEE JCDL , pp. 235-244
    • Yan, S.1    Lee, D.2
  • 33
    • 85026748110 scopus 로고
    • Probabilistic computations: Toward a unied measure of complexity
    • A. C.-C. Yao. Probabilistic computations: Toward a unied measure of complexity. In Proc. of IEEE FOCS, pages 222-227. 1977.
    • (1977) Proc. of IEEE FOCS , pp. 222-227
    • Yao, A.C.-C.1


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