Web Graphs — PageRank-like Importance Measures
FR

Bibliography

  • [Mat01] F. Mathieu, “Structure supposée du graphe du Web,” in Première journée Graphes Dynamiques et Graphes du Web, 2001.
  • [MV02] F. Mathieu and L. Viennot, “Structure intrinsèque du web,” RR-4663, 2002. [Online]. Available: http://www.inria.fr/rrrt/rr-4663.html
  • [MV03] F. Mathieu and L. Viennot, “Local Structure in the Web,” in 12th international conference on the World Wide Web, 2003a.
  • [BM03] M. Bouklit and F. Mathieu, “Effet de la touche Back dans un modèle de surfeur aléatoire : application à PageRank,” in Journées Francophones de la Toile 2003, 2003.
  • [MB04] F. Mathieu and M. Bouklit, “The effect of the back button in a random walk: application for pagerank,” in Alternate track papers & posters of the 13th international conference on World Wide Web, ACM Press, 2004, pp. 370–371.
  • [MV03] F. Mathieu and L. Viennot, “Aspects locaux de l'importance globale des pages web,” in 5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'2003), 2003b.
  • [MV04] F. Mathieu and L. Viennot, “Local Aspects of the Global Ranking of Web Pages,” RR-5192, 2004. [Online]. Available: http://www.inria.fr/rrrt/rr-5192.html
  • [MR04] F. Mathieu and J. Reynier, “File Sharing in P2P: Missing Block Paradigm and Upload Strategies,” RR-5193, 2004. [Online]. Available: http://www.inria.fr/rrrt/rr-5193.html
  • [Gen04] Genitrix, “Une histoire de réseaux.”
  • [Ber00] M. K. Bergman, “The Deep Web: Surfacing Hidden Value.” [Online]. Available: http://www.brightplanet.com/pdf/deepwebwhitepaper.pdf
  • [Sul00] D. Sullivan, “Invisible Web Gets Deeper.” [Online]. Available: http://searchenginewatch.com/sereport/article.php/2162871
  • [SP01] C. Sherman and G. Price, The Invisible Web: Uncovering Information Sources Search Engines Can't See. Independent Publishers Group, 2001.
  • [GLM02] J.-L. Guillaume, M. Latapy, and F. Mathieu, “Tout le Web accessible en quelques clics.” [Online]. Available: http://www.liafa.jussieu.fr/~fmathieu/arbre.php
  • [BB98] K. Bharat and A. Broder, “A technique for measuring the relative size and overlap of public Web search engines,” in Proceedings of the seventh international conference on World Wide Web 7, Elsevier Science Publishers B. V., 1998, pp. 379–388.
  • [Hen+99] M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the Web,” Computer Networks, vol. 31, no. 11–16, pp. 1291–1303, 1999.
  • [Dah00] M. Dahn, “Counting angels on a pinhead: Critically interpreting web size estimates,” Online, vol. 24, no. 1, pp. 35–40, 2000.
  • [BMM94] T. Berners, L. Masinter, and M. Mc Cahill, “RFC-1738 : Uniform Resource Locators (URL).” [Online]. Available: http://www.ietf.org/rfc/rfc1738.txt
  • [Bro+00] A. Broder et al., “Graph structure in the web,” in Proc. 9th International World Wide Web Conference, 2000, pp. 309–320.
  • [Fie+99] R. Fielding et al., “Hypertext Transfer Protocol — HTTP/1.1.”
  • [Kam+03] S. Kamvar, T. Haveliwala, C. Manning, and G. Golub, “Extrapolation methods for accelerating PageRank computations,” in Proceedings of the Twelfth International World Wide Web Conference, 2003a.
  • [Mur00] B. H. Murray, “Sizing the Internet,” 2000.
  • [LG98] S. Lawrence and C. L. Giles, “Searching the World Wide Web,” Science, vol. 280, pp. 98–100, 1998.
  • [LG99] S. Lawrence and C. L. Giles, “Accessibility of Information on the Web,” Nature, vol. 400, no. 6740, pp. 107–109, 1999.
  • [EMT04] N. Eiron, K. S. McCurley, and J. A. Tomlin, “Ranking the Web Frontier,” in Proc. 13th International World Wide Web Conference, 2004, pp. 309–318.
  • [APC03] S. Abiteboul, M. Preda, and G. Cobena, “Adaptive on-line page importance computation,” in Proc. 12th International World Wide Web Conference, 2003, pp. 280–290.
  • [CGP98] J. Cho, H. García-Molina, and L. Page, “Efficient crawling through URL ordering,” Computer Networks and ISDN Systems, vol. 30, no. 1–7, pp. 161–172, 1998.
  • [Cra04] T. C. Craven, “Google, the Source,” College & Research Libraries, vol. 65, no. 4, pp. 306–312, 2004.
  • [Sea] SearchEngineShowdown, “http://www.searchengineshowdown.com/.”
  • [CF02] C. Cooper and A. Frieze, “Crawling on web graphs,” in Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, ACM Press, 2002, pp. 419–427.
  • [LM04] A. N. Langville and C. D. Meyer, “Deeper inside pagerank,” 2004.
  • [RG03] S. Raghavan and H. Garcia-Molina, “Representing web graphs.”
  • [Ara+01] A. Arasu, J. Novak, A. Tomkins, and J. Tomlin, “PageRank Computation and the Structure of the Web: Experiments and Algorithms.”
  • [Kam+03] S. Kamvar, T. Haveliwala, C. Manning, and G. Golub, “Exploiting the Block Structure of the Web for Computing PageRank.”
  • [GL02] J.-L. Guillaume and M. Latapy, “Le Graphe du Web,” Tangente, vol. Hors-Série, no. 12, pp. 12–15, 2002.
  • [Dil+01] S. Dill, S. R. Kumar, K. S. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins, “Self-similarity in the Web,” The VLDB Journal, pp. 69–78, 2001.
  • [Bra97] D. Brake, “Lost in Cyberspace,” New Scientist, 1997.
  • [Ran+01] K. Randall, R. Stata, R. Wickremesinghe, and J. Wiener, “The link database: Fast access to graphs of the Web,” Research Report 175, Compaq Systems Research Center, Palo Alto, CA, 2001.
  • [GLV02] J. Guillaume, M. Latapy, and L. Viennot, “Efficient and simple encodings for the web graph,” in Proceedings of the 11th international conference on the World Wide Web, 2002.
  • [Kle98] J. M. Kleinberg, “Authoritative Sources in a Hyperlinked Environment,” in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 668–677.
  • [BBM03] T. Bennouas, M. Bouklit, and F. de Montgolfier, “Un modèle gravitationnel du Web,” in Actes de ALGOTEL03 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunication, 2003.
  • [O'N+02] E. O'Neill, B. Lavoie, R. Bennett, A. Dyer, and S. Worthington, “Web Characterization Project.” [Online]. Available: http://wcp.oclc.org/
  • [Net04] Netcraft, “http://www.netcraft.com/.”
  • [Who04] WhoIs, “http://www.whois.net/.”
  • [Bri+98] S. Brin, R. Motwani, L. Page, and T. Winograd, “What can you do with a Web in your Pocket?,” Data Engineering Bulletin, vol. 21, no. 2, pp. 37–47, 1998.
  • [Ada99] L. A. Adamic, “The Small World Web,” in Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, Springer-Verlag, 1999, pp. 443–452.
  • [Li+00] W.-S. Li, O. Kolak, Q. Vu, and H. Takano, “Defining logical domains in a web site,” in Proceedings of the eleventh ACM on Hypertext and hypermedia, ACM Press, 2000, pp. 123–132.
  • [FCE95] Q. Feng, R. F. Cohen, and P. Eades, “How to draw a planar clustered graph,” in Computing and Combinatorics, Springer-Verlag, 1995, pp. 21–31.
  • [Bri03] M. Brinkmeier, “Communities in Graphs,” in Proceedings of FCT 2003, 2003.
  • [Sol01] Soleil Levant, “http://hipercom.inria.fr/soleil/.”
  • [She88] O. B. Sheynin, “A A. Markov's Work on Probability,” Archive for History of Exact Science, vol. 39, pp. 337–377, 1988.
  • [Sal96] L. Saloff-Coste, “Lectures on finite Markov Chains,” in Lecture Notes on Probability Theory and Statistics, Springer Verlag, 1996, pp. 301–413.
  • [Ste96] I. Stewart, “Monopoly revisited,” Scientific American, vol. 175, pp. 116–119, 1996.
  • [Col] T. Collins, “Probabilities in the Game of Monopoly.” [Online]. Available: http://www.tkcs-collins.com/truman/monopoly/monopoly.shtml
  • [Gau96] P. Gaucher, “Le Monopoly pour les Nuls.” [Online]. Available: http://www.pps.jussieu.fr/~gaucher/monopoly/monopoly.html
  • [Goo98] Google, “http://www.google.com/.”
  • [Bou01] M. Bouklit, “Quelques méthodes de classement des moteurs de recherche basée sur la structure du graphe du web,” 2001.
  • [BJ02] M. Bouklit and A. Jean-Marie, “Une analyse de PageRank, une mesure de popularité des pages web,” in Actes ALGOTEL'02, 2002.
  • [BGS02] M. Bianchini, M. Gori, and F. Scarselli, “PageRank: A Circuital Analysis.”
  • [BGS03] M. Bianchini, M. Gori, and F. Scarselli, “Inside pagerank,” ACM Transactions on Internet Technology, 2003.
  • [Sal89] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, 1989.
  • [YL95] B. Yuwono and D. L. Lee, “Search and Ranking Algorithms for Locating Resources on the World Wide Web,” in Proceedings of the 12th International Conference on Data Engineering, IEEE Computer Society, 1995, pp. 164–171.
  • [Pri63] D. J. d. S. Price, Little Science, Big Science. Columbia University Press, 1963.
  • [Pag+98] L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank Citation Ranking: Bringing Order to the Web,” 1998. [Online]. Available: http://google.stanford.edu/~backrub/pageranksub.ps
  • [Gof71] W. Goffman, “A Mathematical Method for Analyzing the Growth of a Scientific Discipline,” J. ACM, vol. 18, no. 2, pp. 173–185, 1971.
  • [CP95] L. D. Catledge and J. E. Pitkow, “Characterizing Browsing Strategies in the World Wide Web,” Computer Networks and ISDN Systems, vol. 27, no. 6, pp. 1065–1073, 1995.
  • [TG97] L. Tauscher and S. Greenberg, “How people revisit web pages: empirical findings and implications for the design of history systems,” International Journal of Human Computer Studies, vol. 47, no. 1, pp. 97–137, 1997.
  • [CM01] A. Cockburn and B. McKenzie, “What Do Web Users Do? An Empirical Analysis of Web Use,” International Journal of Human Computer Studies, vol. 54, pp. 903–922, 2001.
  • [WM04] L. Wang and C. Meinel, “Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining,” in ICWE, LNCS, 2004, pp. 531–544.
  • [Mil+04] N. Milic-Frayling, R. Jones, K. Rodden, G. Smyth, A. Blackwell, and R. Sommerer, “Smartback: supporting users in back navigation,” in Proceedings of the 13th international conference on World Wide Web, ACM Press, 2004, pp. 63–71.
  • [Ste94] W. J. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
  • [BP98] S. Brin and L. Page, “The anatomy of a large-scale hypertextual Web search engine,” Computer Networks and ISDN Systems, vol. 30, no. 1–7, pp. 107–117, 1998.
  • [Dur04] F. Durand, “Expériences sur la décomposition de PageRank,” 2004.
  • [Tom03] J. A. Tomlin, “A new Paradigm for Ranking Pages on the World Wide Web,” in Proceedings of the Twelfth International World Wide Web Conference, 2003.
  • [BV] P. Boldi and S. Vigna, “Projet WebGraph.” [Online]. Available: http://vigna.dsi.unimi.it/papers.php#BoVWFI
  • [Fag+00] R. Fagin et al., “Random walks with 'back buttons' (extended abstract),” 2000.
  • [Syd04] M. Sydow, “Random surfer with back step,” in Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, ACM Press, 2004, pp. 352–353.
  • [Hav99] T. Haveliwala, “Efficient computation of PageRank,” 1999.
  • [AJB99] R. Albert, H. Jeong, and A.-L. Barabasi, “Diameter of the World Wide Web,” Nature, vol. 401, pp. 130–131, 1999.
  • [BA99] A.-L. Barabasi and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, pp. 509–512, 1999.
  • [AJB00] R. Albert, H. Jeong, and A.-L. Barabasi, “Scale-Free Characteristics of Random Networks: The Topology of the World-Wide Web,” Physica A, vol. 281, pp. 69–77, 2000.
  • [Kle00] J. M. Kleinberg, “The Small-World Phenomenon: An Algorithmic Perspective,” in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM Press, 2000, pp. 163–170.
  • [PLH01] A. R. Puniyani, R. M. Lukose, and B. A. Huberman, “Intentional Walks on Scale Free Small Worlds,” 2001.
  • [Sto+01] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of the 2001 ACM SIGCOMM conference, 2001, pp. 149–160.
  • [ZKJ01] B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph, “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,” UCB/CSD-1–1141, 2001.
  • [Rat+01] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, ACM Press, 2001, pp. 161–172.
  • [Har+03] N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” in Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems, 2003.
  • [KRR01] J. Kangasharju, J. Roberts, and K. W. Ross, “Object Replication Strategies in Content Distribution Networks,” Computer Communications, vol. 25, no. 4, pp. 376–383, 2001.
  • [CS02] E. Cohen and S. Shenker, “Replication strategies in unstructured peer-to-peer networks.”
  • [LP03] F. Le Fessant and S. Patarin, “MLdonkey, a Multi-Network Peer-to-Peer File-Sharing Program,” RR-4797, 2003.
  • [Coh03] B. Cohen, “Incentives Build Robustness in BitTorrent.”
  • [SGG02] S. Saroiu, P. K. Gummadi, and S. D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” in Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), 2002.
Esc