메뉴 건너뛰기




Volumn 6, Issue 6, 2013, Pages 481-492

Incremental and accuracy-aware personalized pagerank through scheduled approximation

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

EID: 84881264179     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536336.2536348     Document Type: Article
Times cited : (46)

References (18)
  • 1
    • 38749085661 scopus 로고    scopus 로고
    • Local graph partitioning using pagerank vectors
    • R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486, 2006.
    • (2006) FOCS , pp. 475-486
    • Andersen, R.1    Chung, F.2    Lang, K.3
  • 2
    • 79959919123 scopus 로고    scopus 로고
    • Fast personalized PageRank on MapReduce
    • B. Bahmani, K. Chakrabarti, and D. Xin. Fast personalized PageRank on MapReduce. In SIGMOD, pages 973-984, 2011.
    • (2011) SIGMOD , pp. 973-984
    • Bahmani, B.1    Chakrabarti, K.2    Xin, D.3
  • 3
    • 79960170113 scopus 로고    scopus 로고
    • Fast incremental and personalized PageRank
    • B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized PageRank. VLDB, pages 173-184, 2010.
    • (2010) VLDB , pp. 173-184
    • Bahmani, B.1    Chowdhury, A.2    Goel, A.3
  • 4
    • 85068537403 scopus 로고    scopus 로고
    • ObjectRank: Authority-based keyword search in databases
    • A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
    • (2004) VLDB , pp. 564-575
    • Balmin, A.1    Hristidis, V.2    Papakonstantinou, Y.3
  • 5
    • 84924195580 scopus 로고    scopus 로고
    • Bookmark-coloring algorithm for personalized pagerank computing
    • P. Berkhin. Bookmark-coloring algorithm for personalized pagerank computing. Internet Mathematics, 3(1):41-62, 2006.
    • (2006) Internet Mathematics , vol.3 , Issue.1 , pp. 41-62
    • Berkhin, P.1
  • 6
    • 35348868030 scopus 로고    scopus 로고
    • Dynamic personalized pagerank in entity-relation graphs
    • S. Chakrabarti. Dynamic personalized pagerank in entity-relation graphs. In WWW, pages 571-580, 2007.
    • (2007) WWW , pp. 571-580
    • Chakrabarti, S.1
  • 7
    • 79957496158 scopus 로고    scopus 로고
    • Index design and query processing for graph conductance search
    • S. Chakrabarti, A. Pathak, and M. Gupta. Index design and query processing for graph conductance search. VLDBJ, 20:445-470, 2010.
    • (2010) VLDBJ , vol.20 , pp. 445-470
    • Chakrabarti, S.1    Pathak, A.2    Gupta, M.3
  • 8
    • 84924122981 scopus 로고    scopus 로고
    • Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments
    • D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2(3):333-358, 2005.
    • (2005) Internet Mathematics , vol.2 , Issue.3 , pp. 333-358
    • Fogaras, D.1    Rácz, B.2    Csalogány, K.3    Sarlós, T.4
  • 10
    • 57349109369 scopus 로고    scopus 로고
    • Fast algorithms for top-k personalized pagerank queries
    • M. Gupta, A. Pathak, and S. Chakrabarti. Fast algorithms for top-k personalized pagerank queries. In WWW, pages 1225-1226, 2008.
    • (2008) WWW , pp. 1225-1226
    • Gupta, M.1    Pathak, A.2    Chakrabarti, S.3
  • 11
    • 0041848443 scopus 로고    scopus 로고
    • Topic-Sensitive PageRank: a Context-Sensitive ranking algorithm for web search
    • T. H. Haveliwala. Topic-Sensitive PageRank: a Context-Sensitive ranking algorithm for web search. TKDE, 15(4):784-796, 2003.
    • (2003) TKDE , vol.15 , Issue.4 , pp. 784-796
    • Haveliwala, T.H.1
  • 12
    • 80053438862 scopus 로고    scopus 로고
    • Scaling personalized web search
    • G. Jeh and J. Widom. Scaling personalized web search. In WWW, pages 271-279, 2003.
    • (2003) WWW , pp. 271-279
    • Jeh, G.1    Widom, J.2
  • 16
    • 52649091694 scopus 로고    scopus 로고
    • Index design for dynamic personalized PageRank
    • A. Pathak, S. Chakrabarti, and M. Gupta. Index design for dynamic personalized PageRank. In ICDE, pages 1489-1491, 2008.
    • (2008) ICDE , pp. 1489-1491
    • Pathak, A.1    Chakrabarti, S.2    Gupta, M.3
  • 17
    • 16244405068 scopus 로고    scopus 로고
    • The intelligent surfer: Probabilistic combination of link and content information in pagerank
    • M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS, pages 1441-1448, 2002.
    • (2002) NIPS , pp. 1441-1448
    • Richardson, M.1    Domingos, P.2
  • 18
    • 77956202102 scopus 로고    scopus 로고
    • Fast nearest-neighbor search in disk-resident graphs
    • P. Sarkar and A. Moore. Fast nearest-neighbor search in disk-resident graphs. In SIGKDD, pages 513-522, 2010.
    • (2010) SIGKDD , pp. 513-522
    • Sarkar, P.1    Moore, A.2


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