메뉴 건너뛰기




Volumn , Issue , 2004, Pages 309-318

Ranking the Web frontier

Author keywords

Hypertext; PageRank; Ranking

Indexed keywords

ALGORITHMS; INFORMATION RETRIEVAL; MATRIX ALGEBRA; RANDOM PROCESSES; SEARCH ENGINES; VECTORS;

EID: 19944369101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988672.988714     Document Type: Conference Paper
Times cited : (160)

References (32)
  • 2
    • 19944369522 scopus 로고    scopus 로고
    • The dynamic absorbing model for the web
    • University of Glasgow, April
    • Gianni Amati, Iadh Ounis, and Vassilis Plachouras. The dynamic absorbing model for the web. Technical Report TR-2003-137, University of Glasgow, April 2003.
    • (2003) Technical Report , vol.TR-2003-137
    • Amati, G.1    Ounis, I.2    Plachouras, V.3
  • 3
    • 33646442365 scopus 로고    scopus 로고
    • Pagerank computation and the structure of the web: Experiments and algorithms
    • Honolulu
    • Arvind Arasu, Jasmine Novak, Andrew S. Tomkins, and John A. Tomlin. Pagerank computation and the structure of the web: Experiments and algorithms. In Poster Proc. WWW2002, Honolulu, 2002.
    • (2002) Poster Proc. WWW2002
    • Arasu, A.1    Novak, J.2    Tomkins, A.S.3    Tomlin, J.A.4
  • 4
    • 0003272324 scopus 로고    scopus 로고
    • Uniform resource identifiers (URI): Generic syntax
    • T. Berners-Lee, R. Fielding, and L. Masinter. Uniform resource identifiers (URI): Generic syntax. http://www.ietf.org/rfc/rfc2396.txt. RFC 2396.
    • RFC , vol.2396
    • Berners-Lee, T.1    Fielding, R.2    Masinter, L.3
  • 8
    • 0037818472 scopus 로고    scopus 로고
    • I/O efficient techniques for computing pagerank
    • McLean, Virgina
    • Yen-Yu Chen, Qingqing Gan, and Torsten Suel. I/O efficient techniques for computing pagerank. In CIKM 2002, pages 549-557, McLean, Virgina, 2002.
    • (2002) CIKM 2002 , pp. 549-557
    • Chen, Y.-Y.1    Gan, Q.2    Suel, T.3
  • 12
    • 8644220983 scopus 로고    scopus 로고
    • Recognizing nepotistic links on the web
    • AAAI Press, July
    • Brian D. Davison. Recognizing nepotistic links on the web. In Artificial Intelligence for Web Search, pages 23-28. AAAI Press, July 2000.
    • (2000) Artificial Intelligence for Web Search , pp. 23-28
    • Davison, B.D.1
  • 13
    • 0036989578 scopus 로고    scopus 로고
    • Pagerank, hits and a unified framework for link analysis
    • Tampere, Finland
    • Chris Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst Simon. Pagerank, hits and a unified framework for link analysis. In Proc. of 25th ACM SIGIR, pages 353-354, Tampere, Finland, 2002.
    • (2002) Proc. of 25th ACM SIGIR , pp. 353-354
    • Ding, C.1    He, X.2    Husbands, P.3    Zha, H.4    Simon, H.5
  • 14
    • 1542287402 scopus 로고    scopus 로고
    • Analysis of anchor text for web search
    • Nadav Eiron and Kevin S. McCurley. Analysis of anchor text for web search. In Proc. of 26th ACM SIGIR, pages 459-460, 2003.
    • (2003) Proc. of 26th ACM SIGIR , pp. 459-460
    • Eiron, N.1    McCurley, K.S.2
  • 18
    • 0004236492 scopus 로고    scopus 로고
    • Johns Hopkins University Press, Baltimore, 3rd edition
    • Gene H. Golub and Charles van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 3rd edition, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.2
  • 20
    • 0004255482 scopus 로고    scopus 로고
    • Efficient computation of pagerank
    • Stanford University
    • Taher Haveliwala. Efficient computation of pagerank. Technical report, Stanford University, 1999.
    • (1999) Technical Report
    • Haveliwala, T.1
  • 22
    • 17444363858 scopus 로고    scopus 로고
    • Adaptive methods for the computation of pagerank
    • April
    • Sepandar Kamvar, Taher Haveliwala, and Gene Golub. Adaptive methods for the computation of pagerank. Technical report, April 2003.
    • (2003) Technical Report
    • Kamvar, S.1    Haveliwala, T.2    Golub, G.3
  • 23
    • 17444376867 scopus 로고    scopus 로고
    • Exploiting the block structure of the web for computing pagerank
    • Stanford University
    • Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford University, 2003.
    • (2003) Technical Report
    • Kamvar, S.D.1    Haveliwala, T.H.2    Manning, C.D.3    Golub, G.H.4
  • 25
    • 0001313149 scopus 로고    scopus 로고
    • SALSA:the stochastic approach for link-structure analysis
    • Ronny Lempel and Shlomo Moran. SALSA:the stochastic approach for link-structure analysis. ACM Transactions on Information Systems, 19(2):131-160, 2001.
    • (2001) ACM Transactions on Information Systems , vol.19 , Issue.2 , pp. 131-160
    • Lempel, R.1    Moran, S.2
  • 26
    • 0242294246 scopus 로고    scopus 로고
    • Link rot limits the usefulness of web-based educational materials in biochemistry and molecular biology
    • John Markwell and David W. Brooks. Link rot limits the usefulness of web-based educational materials in biochemistry and molecular biology. Biochem. Mol. Biol. Educ., 31:69-72, 2003.
    • (2003) Biochem. Mol. Biol. Educ. , vol.31 , pp. 69-72
    • Markwell, J.1    Brooks, D.W.2
  • 27
    • 85006710010 scopus 로고    scopus 로고
    • Breadth-first search crawling yields high-quality pages
    • Marc Najork and Janet L. Wiener. Breadth-first search crawling yields high-quality pages. In Proc. 10th World Wide Web Conference, pages 114-118, 2001.
    • (2001) Proc. 10th World Wide Web Conference , pp. 114-118
    • Najork, M.1    Wiener, J.L.2
  • 28
    • 0003780986 scopus 로고    scopus 로고
    • The PageRank citation ranking: Bringing order to the web
    • Stanford Digital Library Technologies Project, Paper SIDL-WP-1999-0120 (version of 11/11/1999)
    • Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998. Paper SIDL-WP-1999-0120 (version of 11/11/1999).
    • (1998) Technical Report
    • Page, L.1    Brin, S.2    Motwani, R.3    Winograd, T.4
  • 29
    • 84922574542 scopus 로고    scopus 로고
    • Using pagerank to characterize web structure
    • Singapore, Springer-Verlag. LNCS 2387
    • Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal. Using pagerank to characterize web structure. In COCOON 2002, pages 330-339, Singapore, 2002. Springer-Verlag. LNCS 2387.
    • (2002) COCOON 2002 , pp. 330-339
    • Pandurangan, G.1    Raghavan, P.2    Upfal, E.3
  • 30
    • 0003301647 scopus 로고    scopus 로고
    • What is this page known for? Computing web page reputations
    • Amsterdam
    • Davood Rafiei and Alberto Mendelzon. What is this page known for? Computing web page reputations. In Proc. 9th World Wide Web Conference, Amsterdam, 2000.
    • (2000) Proc. 9th World Wide Web Conference
    • Rafiei, D.1    Mendelzon, A.2
  • 31
    • 1342315836 scopus 로고    scopus 로고
    • The decay and failures of web references
    • Diomidis Spinellis. The decay and failures of web references. Comm. ACM, 46(1):71-77, 2003.
    • (2003) Comm. ACM , vol.46 , Issue.1 , pp. 71-77
    • Spinellis, D.1
  • 32
    • 84880475269 scopus 로고    scopus 로고
    • A new paradigm for ranking pages on the world wide web
    • Budapest, May
    • John A. Tomlin. A new paradigm for ranking pages on the world wide web. In Proc. 12th World Wide Web Conference, pages 350-355, Budapest, May 2003.
    • (2003) Proc. 12th World Wide Web Conference , pp. 350-355
    • Tomlin, J.A.1


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