Automotive Holiday Deals Books Gift Guide Books Gift Guide Shop Men's Cyber Monday Deals Week Learn more nav_sap_SWP_6M_fly_beacon Train egg_2015 Fire TV Stick Beauty Gifts Gifts for Her Amazon Gift Card Offer mithc mithc mithc  Amazon Echo Starting at $49.99 Kindle Voyage Shop Now HTL

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.

Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools), Second Edition 2nd Edition

7 customer reviews
ISBN-13: 978-0898715811
ISBN-10: 0898715814
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used On clicking this link, a new layer will be open
$5.41 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$29.87 On clicking this link, a new layer will be open
More Buying Choices
13 New from $29.87 19 Used from $5.41
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Get Up to 80% Back Rent Textbooks
$29.87 FREE Shipping on orders over $35. Usually ships within 4 to 6 weeks. Ships from and sold by Gift-wrap available.

Editorial Reviews


'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

'Anyone interested in building their own search engine, or looking for a compact and readable introduction to the field of modern information retrieval will find this book to be an excellent first introduction.' Tony Donaldson, MAA Reviews

Book Description

The second edition of this text covers many of the key design issues for building search engines, emphasizing the important role that applied mathematics plays in improving information retrieval. Important data structures, algorithms, and software are discussed, as well as user-centered issues such as interfaces, manual indexing, and document preparation.

Product Details

  • Series: Software, Environments and Tools (Book 17)
  • Paperback: 117 pages
  • Publisher: SIAM, Society for Industrial and Applied Mathematics; 2 edition (April 28, 2005)
  • Language: English
  • ISBN-10: 0898715814
  • ISBN-13: 978-0898715811
  • Product Dimensions: 6 x 0.4 x 9 inches
  • Shipping Weight: 5.6 ounces (View shipping rates and policies)
  • Average Customer Review: 3.1 out of 5 stars  See all reviews (7 customer reviews)
  • Amazon Best Sellers Rank: #1,001,441 in Books (See Top 100 in Books)

More About the Author

Michael W. Berry holds the title of Full Professor and Associate Department Head in the Department of Electrical Engineering and Computer Science at the University of Tennessee, Knoxville.

Prof. Berry is the co-author of "Templates for the Solution of Linear Systems:
Building Blocks for Iterative Methods" (SIAM, 1994) and "Understanding Search Engines: Mathematical Modeling and Text Retrieval, Second Edition" (Bestseller, SIAM, 2005) and editor of "Computational Information Retrieval" (SIAM, 2001), "Survey of Text Mining: Clustering, Classification, and Retrieval" (Springer-Verlag, 2003, 2007), "Lecture Notes in Data Mining" (Bestseller, World Scientific, 2006), and "Text Mining: Applications and Theory" (Wiley, 2010). He has published well over 100 peer-refereed journal and conference publications.

He has organized numerous workshops on Text Mining and was Conference Co-Chair of the 2003 SIAM Third International Conference on Data Mining (May 1-3) in San Francisco, CA. He was also Program Co-Chair of the 2004 Co-Chair of the 2003 SIAM Fourth International Conference on Data Mining (April 22-24) in Orlando, FL. He is a member of SIAM, ACM, MAA, and the IEEE Computer Society and is on the editorial board of "Computing in Science and Engineering" and "Statistical Analysis and Data Mining".

His research interests include information retrieval, data and text mining,
computational science, bioinformatics, and parallel computing. Prof. Berry's
research has been supported by grants and contracts from organizations such
as the National Science Foundation, National Institutes of Health, and the
National Aeronautics and Space Administration.

Customer Reviews

Most Helpful Customer Reviews

28 of 32 people found the following review helpful By A Customer on June 29, 2000
Format: Paperback
I read this book because I am starting academic research on search engines. It was one of my first books on the subject. It actually deals with two aspects: (1) relevant issues in search engine design, and (2) a mathematically sound approach in building and querying large index strucutres. The explanation in the book on both aspects is short but to the point and explained in an understandable way. It also contains a short list + description of some key references. Great !
Comment 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
8 of 8 people found the following review helpful By Geraldo XEXEO on May 7, 2007
Format: Paperback Verified Purchase
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.
Comment 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
3 of 3 people found the following review helpful By Ray on January 20, 2009
Format: Paperback
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.
Comment 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
2 of 2 people found the following review helpful By Man Kam Tam on January 19, 2009
Format: Paperback
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.
Comment 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

What Other Items Do Customers Buy After Viewing This Item?