Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.

Qty:1
  • List Price: $28.95
  • Save: $4.62 (16%)
FREE Shipping on orders with at least $25 of books.
Only 12 left in stock (more on the way).
Ships from and sold by Amazon.com. Gift-wrap available.
Google's PageRank and Bey... has been added to your Cart
Want it Thursday, April 7? Order within and choose Two-Day Shipping at checkout. Details

Ship to:
To see addresses, please
or
Please enter a valid US zip code.
or
FREE Shipping on orders over $25.
Condition: Used: Very Good
Comment: Very mild shelf wear; an overall bright, clean, tight copy.

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Google's PageRank and Beyond: The Science of Search Engine Rankings Paperback – February 26, 2012

4.1 out of 5 stars 17 customer reviews

See all 5 formats and editions Hide other formats and editions
Price
New from Used from
Kindle
"Please retry"
Paperback
"Please retry"
$24.33
$16.97 $3.07

Fluke: The Math and Myth of Coincidence by Joseph Mazur
"Fluke" by Joseph Mazur
Discover fun and games with numbers. Learn more | See related books
$24.33 FREE Shipping on orders with at least $25 of books. Only 12 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

  • Google's PageRank and Beyond: The Science of Search Engine Rankings
  • +
  • Who's #1?: The Science of Rating and Ranking
Total price: $54.28
Buy the selected items together

NO_CONTENT_IN_FEATURE
Image
Looking for the Audiobook Edition?
Tell us that you'd like this title to be produced as an audiobook, and we'll alert our colleagues at Audible.com. If you are the author or rights holder, let Audible help you produce the audiobook: Learn more at ACX.com.

Product Details

  • Paperback: 240 pages
  • Publisher: Princeton University Press (February 26, 2012)
  • Language: English
  • ISBN-10: 0691152667
  • ISBN-13: 978-0691152660
  • Product Dimensions: 6.8 x 0.5 x 9.9 inches
  • Shipping Weight: 1.1 pounds (View shipping rates and policies)
  • Average Customer Review: 4.1 out of 5 stars  See all reviews (17 customer reviews)
  • Amazon Best Sellers Rank: #1,123,628 in Books (See Top 100 in Books)

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)
1.  Powerful SEO Tools opens new browser window
  -  
Try Agency Analytics Today. Rank Tracking, Backlinks, Audits +
2.  More visitors, More sales opens new browser window
  -  
Relevant ads to the right audience Open an account and start today!

Customer Reviews

Top Customer Reviews

By W Boudville HALL OF FAMEVINE VOICE on August 16, 2006
Format: Hardcover
Langville and Meyer have done a superb job describing both Google's technical foundations, and the broader subject of how search engines rank pages. Over half the book is devoted to explaining the maths and rationales behind PageRank. The level of maths is understandable to those who have done some university level courses on linear algebra (i.e. matrices).

The book also has considerable value in analysing what other organisations (like search engines) and researchers have cobbled together. It gives a useful summation of the state of the research, circa 2006. Essentially, everyone seems to focus on link analysis, after Google revolutionised the industry in 1998 by using this. It blew away the previous leader, AltaVista.

It is true, as the authors point out, that most of the material here has already been published. But as discrete events, scattered through various scientific journals and websites. You can certainly get explanations of PageRank on several websites. But the mathematical depth and reliability of those discussions can vary with the site. The book is far handier.

It is a good starting point, if you are interesting in devising your own search methods.
Comment 41 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
Great work! I wish I read it before I start my Ph.D. study.

Pros:

1) Precise and intuitive description of the search algorithm

2) Plenty of interesting stories making mathematics fully applicable in practice

3) Sample Matlab code available

Cons:

This is actually a perfect book. But one needs to have basic linear algebra to appreciate its value. If you are looking for "SEO", you are in a wrong spot.

But if anyone wonder how Page and Brin turn math into treasure, read it!
1 Comment 12 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
A web search engine has six major components. The components are (1) crawler module, (2) page repository, (3) indexing module, (4) indexes, (5) query module, and (6) ranking module. The ranking module takes the set of relevant pages and ranks them according to both the content score and the popularity score. The popularity score is the focus of Amy N. Langville and Carl D. Meyer's "Google's PageRank and Beyond: The Science of Search Engine Rankings." The popularity score of a web page is determined by Web pages' hyperlink structure.

Brin and Page`s PagerRank philosophy is that a page with more recommendations must be more important than a page with a few links. Or a web page is more important if it is pointed to by other important page. Brin and Page then build a normalized hyperlink matrix (H). With the adjustments named stochasticity and primitivity, a Google matrix (G) is obtained, which is, in fact, a probability transition matrix of a Markov chain. The desired ranking of the web pages is the stationary vector of the matrix G or the solution of the corresponding linear homogeneous system.

To calculate the ranking vector is not an easy task, for the matrix G has 8.1 billion rows and 8.1 billions columns. The matrix is growing everyday as the number of web pages grows everyday. The book consider several major large-scale implementation issues such as storage, convergence criterion, accuracy, dangling nodes, and back button modeling. Accelerating methods are presented as well. They are the adaptive power method, extrapolation, and aggregation. Once the ranking vector is calculated, it has to be updated periodically. However, there is no effective and efficient update method available other than calculating from scratch.
Read more ›
Comment 7 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
The subtitle "The science of search engine rankings" is a misnomer. This book is primarily about the *mathematics* of pagerank. For non-mathematicians, such as a computer scientist like myself (though I do have undergrad maths), it was pretty slow going and just plain boring.

I wanted algorithm examples for pagerank calculation of largish (10M) data sets. Not matlab code. Matlab might be great for people who love matrices and don't mind being locked-in to a proprietary language, but it is hardly a sensible choice for a production implementation of the pagerank algorithm. And an algorithm using matrix manipulation, while it might be mathematically nice, is difficult to implement efficiently without fancy matrix compression tricks (as far as I can tell).

In the end, I discarded the book, and wrote my own shorter, simpler, non-matrix implementation in python, verified it produced the same results, and then rewrote it in C. It is quite fast enough for 10M pages even without any fancy optimisations. Not a matrix in sight. Yay.

For mathematicians, this book might deserve more than 3 stars. For computer scientists though, I wouldn't recommend it.
2 Comments 14 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
Great book describing the algorithms that made current search engines so useful and popular. The book describes the math behind the pagerank and HITS algorithms, supported by MATLAB code. Wonderfully written!

Do not buy this book if you want to know how to use search engines, only if you want to understand them!
Comment 4 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
The authors subdivide the book into two main sections: the first few chapters, which are conversational in the manner in which they address pagerank and similar algorithms, and the subsequent chapters, which grow increasingly mathematical. Both authors have strong backgrounds in mathematics, hence that focus. Understanding that, the book is very approachable, lucid and useful in understanding the treated subject matter.
Comment 6 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Most Recent Customer Reviews

Set up an Amazon Giveaway

Google's PageRank and Beyond: The Science of Search Engine Rankings
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
This item: Google's PageRank and Beyond: The Science of Search Engine Rankings



Pages with Related Products. See and discover other items: ebay books