Product Description
Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, Google's PageRank and Beyond supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample Web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. Many illustrative examples and entertaining asides MATLAB code Accessible and informal style Complete and self-contained section for mathematics review

CUSTOMER REVIEWS (Average Customer Rating: 4.0 based on 15 reviews)

Google's PageRank and Beyond: The Science of Search Engine Rankings by Xin Chen

4 Stars
February 16, 2009
The book is good at explaining the Google's pageRanking, and it try to present rigorious math proof to demonstrate the idea. It is good, however, the math part is not well organized, and it is not easy for people without linear algebra knowledge to follow it. Anyway, it is still good book to demonstrate Markov chain in pageRank.

Probability Transition Matrix, Markov Chain, and Stationary Vector by Man Kam Tam (Calexico, CA USA)

5 Stars
December 09, 2008
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. Other ranking methods such as HITS and SALSA are introduced. They are both query dependent. They have both the hub and authority scores. They are both easier to spam than PageRank. Several interesting Matlab programs are provided. One could use them crawl the web, build the matrices, and accelerate the calculation of the stationary vector. This is a wonderful book with timely technical material, entertaining asides, and a cute book cover. Best of all, the primary author is a lady. I am looking forward to read more books like this.

Great book... by Kevin A. Burton

5 Stars
May 06, 2008
Great book. It's nice to have all the recent work done in trust metrics all in one place.

Good balance by M. Grant (South Africa)

4 Stars
February 24, 2008
The book strikes a good balance between the novice and the highly experienced math junkie

More a math textbook than anything else by Denise Magic (West Milwaukee, WI United States)

2 Stars
October 29, 2007
You need a degree in math to comprehend this book - if that is what you are looking for great. If not this book is not for web professionals like myself.

SIMILAR PRODUCTS

	Information Retrieval: Algorithms and Heuristics (The Information Retrieval Series)(2nd Edition) by David A. Grossman (Author), Ophir Frieder (Author) Interested in how an efficient search engine works? Want to know what algorithms are used to rank resulting documents in response to user requests? The authors answer these and other key information retrieval design and implementation questions. This book is not yet another high level text. Instead, algorithms are thoroughly described, making this book ideally suited for both computer science students and practitioners who work on search-related applications. As stated in the...
	Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools), Second Edition by Michael W. Berry and Murray Browne (Author) “There is no other information retrieval/search book where the heart is the mathematical foundations. This book is greatly needed to further establish information retrieval as a serious academic, as well as practical and industrial, area." ---Jaime Carbonell, Carnegie Mellon University. “Berry and Browne describe most of what you need to know to design your own search engine. Their strength is the description of the solid mathematical underpinnings at a level that is understandable to...
	Introduction to Information Retrieval by Christopher D. Manning (Author), Prabhakar Raghavan (Author), Hinrich Schütze (Author) Class-tested and coherent, this groundbreaking new textbook teaches web-era information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. Written from a computer science perspective by three leading experts in the field, it gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of...
	Mining the Web: Discovering Knowledge from Hypertext Data by Soumen Chakrabarti (Author) Mining the Web: Discovering Knowledge from Hypertext Data is the first book devoted entirely to techniques for producing knowledge from the vast body of unstructured Web data. Building on an initial survey of infrastructural issues-including Web crawling and indexing-Chakrabarti examines low-level machine learning techniques as they relate specifically to the challenges of Web mining. He then devotes the final part of the book to applications that unite infrastructure and analysis to bring...
	Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data (Data-Centric Systems and Applications) by Bing Liu (Author) Web mining aims to discover useful information and knowledge from the Web hyperlink structure, page contents, and usage data. Although Web mining uses many conventional data mining techniques, it is not purely an application of traditional data mining due to the semistructured and unstructured nature of the Web data and its heterogeneity. It has also developed many of its own algorithms and techniques. Liu has written a comprehensive text on Web data mining. Key topics of structure mining,...