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: 175

Science and Engineering, 11 (1), pp. 5–7, 2009. doi:10.1109/ MCSE.2009.14. Cited on page 141. [Freschi,2007]V.Freschi. Proteinfunctionpredictionfromin- teraction networks using a random walk ranking algorithm. In Proceedings of the 7th IEEE International Conference on Bioin- formatics and Bioengineering (BIBE 2007), pp. 42–48. 2007. doi:10.1109/BIBE.2007.4375543. Cited on pages 7 and 90. [Gautschi, 2002] W. Gautschi. OPQ: A Matlab suite of programs for generating orthogonal polynomials and related quadrature rules. http://www.cs.purdue.edu/archives/2002/wxg/ codes/OPQ.html,2002. AccessedinJanuary2008. Citedon pages 76 and 148. [Gautschi, 2004] ———. Orthogonal Polynomials: Computation and Approximation, Oxford University Press, 2004. Cited on page 148. [Gilbert et al., 1992] J. R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in Matlab: Design and implementation. SIAM Journal on Matrix Analysis and Applications, 13 (1), pp. 333–356, 1992. doi:10.1137/0613024. Cited on pages 119, 120, 134, and 135. [Gilbert et al., 2007] J. R. Gilbert, S. Reinhardt, and V. B. Shah. High performance graph algorithms from parallel sparse matrices. In PARA 2006, 8th International Workshop in Applied Parallel Computing and State of the Art in Scientific Computing, pp. 260– 269. 2007. Cited on page 119. [Gilbert et al., 2008] ———. A unified framework for numerical and combinatorial computing. Computing in Science and Engineering, 10 (2), pp. 20–25, 2008. doi:10.1109/MCSE.2008. 45. Cited on page 119. [Gilbert and Teng, 2002] J. R. Gilbert and S.-H. Teng. Mat- lab Mesh Partitioning and Graph Separator Toolbox, 2002. Http://www.cerfacs.fr/6-26298-Matlab-Mesh-Partitioning-and- Graph-Separator-Toolbox.php. Cited on pages 119, 120, and 121. [Gleich et al., 2007] D. F. Gleich, P. Glynn, G. H. Golub, and C. Greif. Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative. In Web Information Retrieval and Linear Algebra Algorithms. 2007. Cited on page 9. [Gleich et al., to appear] D. F. Gleich, A. P. Gray, C. Greif, and T. Laure. An inner-outer iteration for PageRank. SIAM Journal of Scientific Computing, to appear. Cited on page 96. [Gleich and Polito, 2007] D. F. Gleich and M. Polito. Approximat- ing personalized PageRank with minimal use of webgraph data. Internet Mathematics, 3 (3), pp. 257–294, 2007. Cited on pages 26 and 35. [Gleich and Zhukov, 2005] D. F. Gleich and L. Zhukov. Scalable computing with power-law graphs: Experience with parallel PageRank. In SuperComputing 2005. 2005. Poster. Cited on page 44. [Gleich et al., 2004] D. F. Gleich, L. Zhukov, and P. Berkhin. Fast parallel PageRank: A linear system approach. Technical Report YRL-2004-038, Yahoo! Research Labs, 2004. Cited on pages 96, 103, 108, and 110. [Golub and Greif, 2006] G. Golub and C. Greif. An Arnoldi-type algorithm for computing PageRank. BIT Numerical Mathematics, 46 (4), pp. 759–771, 2006. doi:10.1007/s10543-006-0091-y. Cited on pages 29, 41, 44, 46, 60, and 96. [Golub and van Loan, 1996] G. H. Golub and C. F. van Loan. Matrix Computations, The Johns Hopkins University Press, third edition, 1996. Cited on pages 17, 20, and 21. [Golub and Welsch, 1969] G. H. Golub and J. H. Welsch. Calcu- lation of Gauss quadrature rules. Mathematics of Computation, 23 (106), pp. 221–230, 1969. Cited on page 76. [Govan et al., 2008] A. Y. Govan, C. D. Meyer, and R. Albright. Generalizing Google’s PageRank to rank national football league teams. In SAS Global Forum 2008. 2008. Cited on pages 6 and 149. [Gray et al., 2007] A. Gray, C. Greif, and T. Lau. An inner/outer stationary iteration for computing PageRank. CPSC Technical Report TR-2007-27, University of British Columbia, 2007. Cited on pages 9, 39, and 95. [Grinstead and Snell, 1997] C. M. Grinstead and J. L. Snell. Introduction to Probability, American Mathematical Society, 1997. Cited on page 57. [Gyöngyi et al., 2004] Z. Gyöngyi, H. Garcia-Molina, and J. Ped- ersen. Combating web spam with TrustRank. In Proceedings of the 30th International Very Large Database Conference. 2004. Cited on pages 11, 16, 92, and 148. [Haveliwala, 2002] T. H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the 11th international conference on the World Wide Web. 2002. Cited on pages 28 and 61. [Higham, 2005] D. J. Higham. Google PageRank as mean playing time for pinball on the reverse web. Applied Mathematics Letters, 18 (12), pp. 1359 – 1362, 2005. doi:10.1016/j.aml.2005.02.020. Cited on page 6. [Higham, 2002] N. J. Higham. Accuracy and Stability of Numerical Algorithms, SIAM, 2002. Cited on pages 20 and 21. [Hirai et al., 2000] J. Hirai, S. Raghavan, H. Garcia-Molina, andA.Paepcke. Webbase:arepositoryofwebpages. Com- puterNetworks,33(1-6),pp.277–293,2000. doi:10.1016/ S1389-1286(00)00063-3. Cited on pages 34 and 39. [Honey et al., 2007] C. J. Honey, R. Kötter, M. Breakspear, and O. Sporns. Network structure of cerebral cortex shapes functional connectivity on multiple time scales. Proceedings of the National Academy of Sciences, 104 (24), pp. 10240–10245, 2007. doi:10.1073/pnas.0701519104. Cited on page 129. [Horn and Johnson, 1991] R. A. Horn and C. R. Johnson. Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991. Cited on page 12. [Horn and Serra-Capizzano, 2007] R. A. Horn and S. Serra- Capizzano. A general setting for the parametric Google matrix. Internet Mathematics, 3 (4), pp. 385–411, 2007. Cited on page 81. [Huberman et al., 1998] B. A. Huberman, P. L. T. Pirolli, J. E. Pitkow, and R. M. Lukose. Strong regularities in World Wide Web surfing. Science, 280 (5360), pp. 95–97, 1998. Cited on pages 55, 60, and 68. [Ipsen and Selee, 2007] I. C. F. Ipsen and T. M. Selee. PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl., 29 (4), pp. 1281–1296, 2007. doi:10.1137/ 060664331. Cited on page 96. [Jeh and Widom, 2003] G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of the 12th international conference on the World Wide Web, pp. 271–279. 2003. doi:10.1145/775152. 775191. Cited on pages 28 and 61. 7.2 ⋅ future work 155

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