04548nam 2200757Ia 450 991046027050332120200520144314.01-282-66584-797866126658441-4008-3706-510.1515/9781400837069(CKB)2670000000040755(EBL)557150(OCoLC)650641334(SSID)ssj0000424304(PQKBManifestationID)11306069(PQKBTitleCode)TC0000424304(PQKBWorkID)10471594(PQKB)10965752(MiAaPQ)EBC557150(WaSeSS)Ind00024399(DE-B1597)446585(OCoLC)979579421(DE-B1597)9781400837069(PPN)170258580(Au-PeEL)EBL557150(CaPaEBR)ebr10402717(CaONFJC)MIL266584(EXLCZ)99267000000004075520100428d2010 uy 0engur|n|---|||||txtccrNumerical algorithms for personalized search in self-organizing information networks[electronic resource] /Sep KamvarCourse BookPrinceton, N.J. Princeton University Press20101 online resource (295 p.)Description based upon print version of record.0-691-14503-2 Includes bibliographical references. Frontmatter -- Contents -- Tables -- Figures -- Acknowledgments -- Chapter One. Introduction -- PART I. World Wide Web -- Chapter Two. PageRank -- Chapter Three. The Second Eigenvalue of the Google Matrix -- Chapter Four. The Condition Number of the PageRank Problem -- Chapter Five. Extrapolation Algorithms -- Chapter Six. Adaptive PageRank -- Chapter Seven. BlockRank -- PART II. P2P Networks -- Chapter Eight. Query-Cycle Simulator -- Chapter Nine. Eigen Trust -- Chapter Ten. Adaptive P2P Topologies -- Chapter Eleven. Conclusion -- BibliographyThis 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.Database searchingMathematicsInformation networksMathematicsContent analysis (Communication)MathematicsSelf-organizing systemsData processingAlgorithmsInternet searchingMathematicsElectronic books.Database searchingMathematics.Information networksMathematics.Content analysis (Communication)Mathematics.Self-organizing systemsData processing.Algorithms.Internet searchingMathematics.025.5/24Kamvar Sep1977-1033777MiAaPQMiAaPQMiAaPQBOOK9910460270503321Numerical algorithms for personalized search in self-organizing information networks2452499UNINA