ISBN: 9780691145037 - numerical algorithms for personalized search in self-organizing information networks (18 Ergebnisse)

Hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Zustand: Very Good. First Edition. First Edition with number line to 1. Hardcover boards very good with light shelf wear. Spine square. Binding sound. Pages crisp and clean. Interior unmarked.

Zustand: New.

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. Lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. This book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Num Pages: 160 pages, 55 line illus. 11 tables. BIC Classification: UY. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 165 x 241 x 16. Weight in Grams: 352. . 2010. Hardcover. . . . .…

Zustand: New.

Hardback. Zustand: New. 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.…

Zustand: New. Lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. This book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Num Pages: 160 pages, 55 line illus. 11 tables. BIC Classification: UY. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 165 x 241 x 16. Weight in Grams: 352. . 2010. Hardcover. . . . . Books ship from the US and Ireland.…

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Hardback. Zustand: New. New copy - Usually dispatched within 4 working days.

Hardback. Zustand: New. 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.…

Hardcover. Zustand: Brand New. 139 pages. 9.75x6.50x0.50 inches. In Stock.

Hardcover. Zustand: Brand New. 139 pages. 9.75x6.50x0.50 inches. In Stock. This item is printed on demand.

Buch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. …