메뉴 건너뛰기




Volumn 19, Issue 5, 2007, Pages 585-598

Practical algorithms and lower bounds for similarity search in massive graphs

Author keywords

Graph algorithms; Probabilistic algorithms; Similarity measures; Web search

Indexed keywords

GRAPH ALGORITHMS; PROBABILISTIC ALGORITHMS; SIMILARITY MEASURES; WEB SEARCH;

EID: 33947632387     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1008     Document Type: Article
Times cited : (13)

References (30)
  • 2
    • 0033714666 scopus 로고    scopus 로고
    • Webbase: A Repository of Web
    • J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke, "Webbase: A Repository of Web Pages," Proc. Ninth World Wide Web Conf. (WWW), pp. 277-293, 2000.
    • (2000) , pp. 277-293
    • Hirai, J.1    Raghavan, S.2    Garcia-Molina, H.3    Paepcke, A.4
  • 3
    • 0003780986 scopus 로고    scopus 로고
    • The PageRank Citation Ranking: Bringing Order to the Web
    • Technical Report 1999-66, Stanford Univ
    • L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," Technical Report 1999-66, Stanford Univ., 1998
    • (1998)
    • Page, L.1    Brin, S.2    Motwani, R.3    Winograd, T.4
  • 4
    • 0033293618 scopus 로고    scopus 로고
    • Finding Related Pages in the World Wide Web
    • J. Dean and M.R. Henzinger, "Finding Related Pages in the World Wide Web," Computer Networks, vol. 31, no. 11, pp. 1467-1479, 1999.
    • (1999) Computer Networks , vol.31 , Issue.11 , pp. 1467-1479
    • Dean, J.1    Henzinger, M.R.2
  • 5
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative Sources in a Hyperlinked Environment
    • J. Kleinberg, "Authoritative Sources in a Hyperlinked Environment," J. ACM vol. 46, no. 5, pp. 604-632, 1999.
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.1
  • 8
    • 34250725631 scopus 로고    scopus 로고
    • A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph
    • Mar
    • D. Fogaras and B. Rácz, "A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph," Proc. Clustering Information over the Web Workshop, pp. 557-567, Mar. 2004.
    • (2004) Proc. Clustering Information over the Web Workshop , pp. 557-567
    • Fogaras, D.1    Rácz, B.2
  • 14
    • 0004255482 scopus 로고    scopus 로고
    • Efficient Computation of PageRank
    • Technical Report 1999-31, Stanford Univ
    • T.H. Haveliwala, "Efficient Computation of PageRank," Technical Report 1999-31, Stanford Univ., 1999.
    • (1999)
    • Haveliwala, T.H.1
  • 15
    • 12244308827 scopus 로고    scopus 로고
    • An Analytical Comparison of Approaches to Personalizing PageRank
    • Technical Report 2003-35, Stanford Univ
    • T.H. Haveliwala, S. Kamvar, and G. Jeh, "An Analytical Comparison of Approaches to Personalizing PageRank," Technical Report 2003-35, Stanford Univ., 2003.
    • (2003)
    • Haveliwala, T.H.1    Kamvar, S.2    Jeh, G.3
  • 16
    • 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 Math., vol. 2, no. 3, pp. 333-358, 2005.
    • (2005) Internet Math , vol.2 , Issue.3 , pp. 333-358
    • Fogaras, D.1    Rácz, B.2    Csalogány, K.3    Sarlós, T.4
  • 18
    • 0031353179 scopus 로고    scopus 로고
    • Size-Estimation Framework with Applications to Transitive Closure and Reachability
    • E. Cohen, "Size-Estimation Framework with Applications to Transitive Closure and Reachability," J. Computer Systems Science, vol. 55, no. 3, pp. 441-453, 1997.
    • (1997) J. Computer Systems Science , vol.55 , Issue.3 , pp. 441-453
    • Cohen, E.1
  • 19
    • 0031644241 scopus 로고    scopus 로고
    • Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
    • P. Indyk and R. Motwani, "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality," Proc. 30th ACM Symp. Theory of Computing (STOC), pp. 604-613, 1998.
    • (1998) Proc. 30th ACM Symp. Theory of Computing (STOC) , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 25
    • 0001284253 scopus 로고    scopus 로고
    • Computing on Data Streams, External Memory Algorithms
    • M.R. Henzinger, P. Raghavan, and S. Rajagopalan, "Computing on Data Streams," External Memory Algorithms, DIMACS Book Series, vol. 50, pp. 107-118, 1999.
    • (1999) DIMACS Book Series , vol.50 , pp. 107-118
    • Henzinger, M.R.1    Raghavan, P.2    Rajagopalan, S.3
  • 26
    • 0038722393 scopus 로고    scopus 로고
    • The Complexity of Massive Data Set Computations,
    • PhD dissertation, Univ. of California at Berkeley
    • Z. Bar-Yossef, "The Complexity of Massive Data Set Computations," PhD dissertation, Univ. of California at Berkeley, 2002.
    • (2002)
    • Bar-Yossef, Z.1
  • 30
    • 33947617675 scopus 로고    scopus 로고
    • Open Directory Project ODP
    • "Open Directory Project (ODP)," http://www.dmoz.org, 2005.
    • (2005)


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