Numerical Algorithms for Personalized Search in Self-organizing Information Networks
by Sep Kamvar
- List Price$60.00
- Your price$47.99
Save $12.01 (20% off) and earn Kobo Super Points!
Or, get it for 24800 Kobo Super Points!
See if you have enough points for this eBook. Sign in
This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. Representing much of the foundational research in this field, the book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data.
Sep Kamvar focuses on eigenvector-based techniques in Web search, introducing a personalized variant of Google's PageRank algorithm, and he outlines algorithms--such as the now-famous quadratic extrapolation technique--that speed up computation, making personalized PageRank feasible. Kamvar suggests that Power Method-related techniques ultimately should be the basis for improving the PageRank algorithm, and he presents algorithms that exploit the convergence behavior of individual components of the PageRank vector. Kamvar then extends the ideas of reputation management and personalized search to distributed networks like peer-to-peer and social networks. He highlights locality and computational considerations related to the structure of the network, and considers such unique issues as malicious peers. He describes the EigenTrust algorithm and applies various PageRank concepts to P2P settings. Discussion chapters summarizing results conclude the book's two main sections.
Clear and thorough, this book provides an authoritative look at central innovations in search for all of those interested in the subject.
- Princeton University Press, September 2010
Princeton University Press
- Download options:
- EPUB 2 (Adobe DRM)
You can read this item using any of the following Kobo apps and devices: