logo

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

different girlfriends (or wifes!), but managed to stick together until gradua- tion. Chris Maes and I ended up as roommates for two years. Again, I cannot sufficiently thank these folks for all the help they’ve provided. I can only hope I wasn’t too much of a burden. Let me continue with my research collaborators. Without them, it would be difficult to imagine fitting as much material into the thesis as I have. It’s quite likely that Leslie Ward, Erin Bodine, and the rest of the Harvey Mudd Overture Services clinic team are directly (or perhaps only indirectly) responsible for the topic of this thesis. The present topic clearly follows a trajectory from our initial investigations into web search. I owe them my thanks for sending me down this path—although, at points I may have used less flattering and more colorful language to describe my thesis. Reid Andersen, Pavel Berkhin, Kevin Lang, Peter Glynn, and Sebastiano Vigna all helped shape my view of the PageRank problem through our dis- cussions. I’m extremely grateful to Marzia Polito for working through the intricacies of personalized PageRank and HostRank with me over the course of a summer internship. Likewise, Amy Langville was incredibly helpful during my visits to her in Charleston. Abraham Flaxman merits a special acknowledgment. You see, he gave me the data about α I always wanted. It is gratifying to receive data that fits initial assumptions so cleanly; see figure 4.6 for more about his data. Chen Greif also merits mention. Not only did he fly down to Stanford to attend my dissertation defense in person, he also arranged for three trips to Vancouver, and a post-doctoral position too. He’s been a great research collaborator and always makes sure I address every little detail. At Stanford, Margot Gerritsen and Amin Saberi have been constant fix- tures throughout my education. Soon after I came to Stanford, Margot asked me to prepare a homework assignment on PageRank for her numerical linear algebra class. Both advise the computational approaches to digital steward- ship group at Stanford, which has funded part of my research. I’m grateful for their involvement in my research and general education at Stanford. And then there’s Paul. For those reading this who don’t know, Paul Con- stantine was a fellow Ph.D. student at Stanford. Over a fateful beer, we realized that the random alpha PageRank ideas in chapter 4 are possible and make sense. Subsequently, this research blossomed into almost two theses: his thesis on parameterized matrix equations and mine on PageRank. It’s been a wonderful collaboration, and this thesis would be rather different without these pieces. During my research, I’ve had three mentors: Leonid Zhukov, Gene H. Golub, and Michael Saunders. Leonid was my first academic mentor, although he was officially my men- tor as an intern at Overture and Yahoo!. He never seemed to quite agree with my philosophy on ordering authors (I try to use alphabetical ordering) and kept claiming that I was making him “less important” on papers (we all know where Z lies in the alphabet). In this case, he’s first because the order is chronological. Leonid patiently set me straight on matters of matrix computations. He took me through latent semantic indexing (LSI), principal x

PDF Image | ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

algorithms-for-pagerank-sensitivity-dissertation-010

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