ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

PDF Publication Title:

ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION ( algorithms-for-pagerank-sensitivity-dissertation )

Previous Page View | Next Page View | Return to Search List

Text from PDF Page: 174

154 7 ⋅ conclusion [Brauer, 1952] A. Brauer. Limits for the characteristic roots of a matrix. IV: Applications to stochastic matrices. Duke MathematicsJournal,19(1),pp.75–91,1952. doi:10.1215/ S0012-7094-52-01910-8. Cited on page 33. [Buckheit and Donoho, 1995] J. B. Buckheit and D. L. Donoho. WaveLab and reproducible research. In Wavelets and statistics, pp. 55–81. Springer-Verlag, 1995. Cited on page 141. [Castillo et al., 2006] C. Castillo, D. Donato, L. Becchetti, P. Boldi, S. Leonardi, M. Santini, and S. Vigna. A reference collection for web spam. SIGIR Forum, 40 (2), pp. 11–24, 2006. doi:10.1145/1189702.1189703. Cited on pages 39, 88, and 91. [Catledge and Pitkow, 1995] L. D. Catledge and J. E. Pitkow. Characterizing browsing strategies in the world-wide web. Com- puter Networks and ISDN Systems, 27 (6), pp. 1065–1073, 1995. doi:10.1016/0169-7552(95)00043-7. Cited on page 60. [Chan et al., 1983] T. F. Chan, G. H. Golub, and R. J. LeVeque. Algorithms for computing the sample variance: Analysis and recommendations. The American Statistician, 37 (3), pp. 242–247, 1983. doi:10.2307/2683386. Cited on page 72. [Chen et al., 2007] P. Chen, H. Xie, S. Maslov, and S. Redner. Finding scientific gems with Google’s PageRank algorithm. Journal of Informetrics, 1 (1), pp. 8–15, 2007. doi:10.1016/j.joi.2006. 06.001. Cited on pages 55 and 60. [Chien et al., 2004] S. Chien, C. Dwork, R. Kumar, D. R. Simon, andD.Sivakumar. Linkevolution:Analysisandalgorithms. Internet Mathematics, 1 (3), pp. 277–304, 2004. Cited on page 26. [Cho and Schonfeld, 2007] J. Cho and U. Schonfeld. RankMass crawler: a crawler with high personalized PageRank coverage guarantee. In VLDB 2007: Proceedings of the 33rd international conference on very large data bases, pp. 375–386. 2007. Cited on page 35. [Constantine, 2009] P. G. Constantine. Spectral methods for parameterized matrix equations. Ph.D. thesis, Stanford University, 2009. Cited on pages 56 and 149. [Constantine and Gleich, 2007] P. G. Constantine and D. F. Gleich. Using polynomial chaos to compute the influ- ence of multiple random surfers in the PageRank model. In Proceedings of the 5th Workshop on Algorithms and Mod- els for the Web Graph (WAW2007), pp. 82–95. 2007. doi: 10.1007/978-3-540-77004-6_7. Cited on pages 9 and 56. [Constantine et al., 2009] P. G. Constantine, D. F. Gleich, and G. Iaccarino. Spectral methods for parameterized matrix equations. arXiv, 2009. arXiv:0904.2040. Cited on page 56. [Cormen et al., 2001] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, MIT Press, Cambridge, Massachusetts, second edition, 2001. Cited on pages 130 and 131. [Cuil, 2009] Cuil. Cuil – FAQs (item 10). Available online http: //www.cuil.com/info/faqs/, 2009. Accessed on July 11, 2009. Cited on page 20. [Cutts, 2006] M. Cutts. Q&A march 27, 2006. Matt Cutts: Gadgets, Google, and SEO. Available online http://www.mattcutts.com/ blog/q-a-thread-march-27-2006/, 2006. Cited on page 146. [Cutts, 2009] ———. PageRank scupting. Matt Cutts: Gadgets, Google, and SEO blog. Available online http://www.mattcutts. com/blog/pagerank-sculpting/, 2009. Cited on page 146. [Cvetković and Milovanović, 2004] A. S. Cvetković and G. V. Milovanović. The Mathematica package ’OrthogonalPolyno- mials’. Facta universitatis, 19, pp. 17–36, 2004. Cited on page 148. [Davis and Rabinowitz, 1984] P. J. Davis and P. Rabinowitz. Meth- ods of Numerical Integration, Academic Press, New York, 2nd edition, 1984. Cited on page 80. [Davis, 2007] T. Davis. University of Florida sparse matrix collection. http://www.cise.ufl.edu/research/sparse/matrices/, NA Digest, vol. 92, no. 42, October 16, 1994; NA Digest, vol. 96, no. 28, July 23, 1996; and NA Digest, vol. 97, no. 23, June 7, 1997, 2007. Cited on page 39. [Davis, 2004] T. A. Davis. Algorithm 832: UMFPACK v4.3—an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw., 30 (2), pp. 196–199, 2004. doi:10.1145/992200.992206. Cited on page 72. [de Kerchove et al., 2008] C. de Kerchove, L. Ninove, and P. van Dooren. Maximizing PageRank via outlinks. Linear Algebra and its Applications, 429 (5-6), pp. 1254–1276, 2008. Special Issue devoted to selected papers presented at the 13th Conference of the International Linear Algebra Society. doi:10.1016/j.laa. 2008.01.023. Cited on page 26. [Dean, 2009] J. Dean. Challenges in building large-scale information retrieval systems. Presentation at WSDM2009, 2009. Accessed online at http://videolectures.net/wsdm09_dean_cblirs/. Cited on page 1. [Del Corso et al., 2005] G. M. Del Corso, A. Gullí, and F. Romani. Fast PageRank computation via a sparse linear system. Internet Mathematics, 2 (3), pp. 251–273, 2005. Cited on pages 24 and 96. [Del Corso et al., 2007] ———. Comparison of Krylov subspace methods on the PageRank problem. J. Comput. Appl. Math., 210 (1-2), pp. 159–166, 2007. doi:10.1016/j.cam.2006.10.080. Cited on pages 96, 103, 110, and 112. [Donoho et al., 2009] D. L. Donoho, A. Maleki, I. U. Rah- man,M.Shahram,andV.Stodden. Reproducibleresearch in computational harmonic analysis. Computing in Sci- ence and Engineering, 11 (1), pp. 8–18, 2009. doi:http: //doi.ieeecomputersociety.org/10.1109/MCSE.2009.15. Cited on page 141. [Eiron et al., 2004] N. Eiron, K. S. McCurley, and J. A. Tomlin. Ranking the web frontier. In Proceedings of the 13th international conference on the World Wide Web (WWW2004), pp. 309–318. 2004. doi:10.1145/988672.988714. Cited on page 96. [Eldén, 2004] L. Eldén. A note on the eigenvalues of the Google matrix. arXiv, 2004. arXiv:math/0401177. Cited on pages 18 and 33. [Fagiolo,2007]G.Fagiolo. Clusteringincomplexdirectednet- works. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics),76(2),026107,2007. doi:10.1103/PhysRevE.76. 026107. Cited on page 130. [Farahat et al., 2006] A. Farahat, T. LoFaro, J. C. Miller, G. Rae, and L. A. Ward. Authority rankings from HITS, PageRank, and SALSA: Existence, uniqueness, and effect of initialization. SIAM Journal on Scientific Computing, 27 (4), pp. 1181–1201, 2006. doi:10.1137/S1064827502412875. Cited on page 60. [Fomel and Claerbout, 2009] S. Fomel and J. F. Claerbout. Guest editors’ introduction: Reproducible research. Computing in

PDF Image | ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

PDF Search Title:

ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

Original File Name Searched:

gleich.pdf

DIY PDF Search: Google It | Yahoo | Bing

Cruise Ship Reviews | Luxury Resort | Jet | Yacht | and Travel Tech More Info

Cruising Review Topics and Articles More Info

Software based on Filemaker for the travel industry More Info

The Burgenstock Resort: Reviews on CruisingReview website... More Info

Resort Reviews: World Class resorts... More Info

The Riffelalp Resort: Reviews on CruisingReview website... More Info

CONTACT TEL: 608-238-6001 Email: greg@cruisingreview.com | RSS | AMP