Science Resources RSS Feeds
|
 |
 |
 |
| View Larger Image | Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools), Second Edition | Paperbackby Michael W. Berry and Murray Browne (Author)
| List Price: | $37.00 | | | Available: | Usually ships in 24 hours |
| | Binding: | Paperback | | Publisher: | SIAM, Society for Industrial and Applied Mathematics | | Edition: | 2nd Edition | | Page Count: | 117 Pages | | Publication Date: | April 28, 2005 | | Sales Rank: | 705,208th |
|
EDITORIAL REVIEWS |
Product Description
“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 competent engineering undergraduates, perhaps with a bit of instructor guidance. They discuss the algorithms used by most commercial search engines, so you may find your use of Google and its kind becomes more effective, too.” --George Corliss, Marquette University. “This book gives a valuable, generally non-technical, insight into how search engines work, how to improve the users' success in Information Retrieval (IR), and an in-depth analysis of a mathematical algorithm for improving a search engine's performance. …Written in an informal style, the book is easy to read and is a good introduction on how search engines operate…” —Christopher Dean, Mathematics Today, October 1999. The second edition of Understanding Search Engines: Mathematical Modeling and Text Retrieval follows the basic premise of the first edition by discussing many of the key design issues for building search engines and emphasizing the important role that applied mathematics can play in improving information retrieval. The authors discuss important data structures, algorithms, and software as well as user-centered issues such as interfaces, manual indexing, and document preparation. Readers will find that the second edition includes significant changes that bring the text up to date on current information retrieval methods. For example, the authors have added a completely new chapter on link-structure algorithms used in search engines such as Google, and the chapter on user interface has been rewritten to specifically focus on search engine usability. To reflect updates in the literature on information retrieval, the authors have added new recommendations for further reading and expanded the bibliography. In addition, the index has been updated and streamlined to make it more reader friendly. Instructors will find that the book serves as an excellent companion text for courses in information retrieval, applied linear algebra, and scientific computing. Because of the authors’ informal, conversational tone, readers with nonmathematical backgrounds also will appreciate the less technical chapters of the text. |
CUSTOMER REVIEWS (Average Customer Rating: 3.0 based on 7 reviews)
|
Understanding Search Engines by Daniel Pawelec (Poland)  2 Stars
February 04, 2009
This book is condensed knowladge about the topic of search engines - but only the basics. I am very dissapointed because I thought I will see something special, inspiring.
This book is good for beginners in search engines field but not for the money it costs now.
| |
A mix of good and bad by Ray 2 Stars
January 21, 2009
As others have pointed out, this book is very short. As a consequence, it leaves out a lot of details and forces the reader to refer to another book. This is more noticeable in the sections that do not relate to linear algebra (stemming, performance evaluation, and user interface design). If you want more information about these topics, it is best to look for another book.
However, the discussions about latent semantic indexing and querying based on link structure are more detailed in comparison and both topics are mentioned within the context of linear algebra.
Don't expect an introduction to QR or SVD matrix decompositions or what an eigenspace is. Also, don't expect a proper definition of what a graph is. For all of this, you will also have to refer to another book. If you do not need such an introduction, then you may not mind.
Overall, the book attempts to do too many topics in few pages and suffers from this. However, if you are looking for a "crash course in search engines"-type book, then this might be the one for you. You may end up buying another book afterwards if you want to know implementation details, though.
| |
Linear Algebra, Numerical Linear Algebra, and Search Engine by Man Kam Tam (Calexico, CA USA)  5 Stars
January 20, 2009
Other than showing the readers how to design a search engine, the authors, Michael W. Berry and Murray Browne of "Understanding Search Engines: Mathematical Modeling, and Text Retrieval," intend to fill the gap between applied mathematics and information management. In a latent semantic index (LSI) system, mathematics plays a major role in search engine performance. The term-by-document matrix of the system would be transformed to a lower rank matrix for conceptual indexing. However, nobody knows how low the rank should be for the best performance. The best technique so far for lower rank approximation is called singular value decomposition. In such a system, vectors model both documents and queries. The angle between the document vector and the query vector determines the rank-order of the document. The elements of the vectors are usually the weighted frequency of the term occurrence. Thus the searchers should list as many terms as possible in their queries for better search results.
LSI search engine is good for small document system only. Other searching methods such as HITS and PageRank are introduced. For the readers who have the background on linear algebra, numerical linear algebra, and search engine should find this book interesting.
Generally speaking, the book is brief. It has 117 pages and 9 chapters. The nine chapters are Introduction, Document File Preparation, Vector Space Models, Matrix Decompositions, Query Management, Ranking and Relevance Feedback, Searching by Link Structure, User Interface Considerations, and Further Reading. Chapter two (Document File Preparation) reminds the readers that the documents of the system needed to be "clean-up" and index. The works may require plenty of manual labor.
| |
Good introduction by Pat Choi (L.A., CA United States)  4 Stars
November 11, 2008
Good first (and short) book on the subject. Easy to follow and understand. Most suitable for reader who has some exposures to numerical analysis and/or numerical linear algebra because QR factorization, SVD, Semidiscrete decomposition (SDD) etc. methods are used in the text.
| |
Good Introduction by Geraldo XEXEO (Rio de Janeiro, Brazil) 4 Stars
May 07, 2007
There are better books in the market, and even the author would be the first to recognize it. However, this book is one of the most clear and readable introduction to the subject that you can find.
The author fully acomplishes the objective: teach his reader, at undergratuate level, how search engines work. Even some difficult subject, such as LSI, are treated at a level one can easilly understand.
One of the most important characteristics of the book is that it does math. Every formula has an example, usually using small matrix that allow the reader to easilly follow them.
The book is suitable for an objective introduction to the field. It is not very "academic", in the sense it is rather informal. If it is not a textbook, it could help some bewildered student to grasp the inner workings. It could also help a teacher to find clearer ways for explanations and good examples for classroom.
| |
SIMILAR PRODUCTS |
| Google's PageRank and Beyond: The Science of Search Engine Rankings
by Amy N. Langville (Author), Carl D. Meyer (Author)
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...
| 
| 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...
| 
| 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...
| 
| Search Engines: Information Retrieval in Practice
by Bruce Croft (Author), Donald Metzler (Author), Trevor Strohman (Author)
KEY BENEFIT: Written by a leader in the field of information retrieval, this text provides the background and tools needed to evaluate, compare and modify search engines. KEY TOPICS: Coverage of the underlying IR and mathematical models reinforce key concepts. Numerous programming exercises make extensive use of Galago, a Java-based open source search engine. MARKET: A valuable tool for search engine and information retrieval professionals.
| 
| 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...
|
|
|
|
