Buy new:
$73.05$73.05
$3.99
delivery:
Oct 2 - 6
Ships from: Almost June Sold by: Almost June
Buy used: $5.00
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools), Second Edition 2nd Edition
Purchase options and add-ons
- ISBN-100898715814
- ISBN-13978-0898715811
- Edition2nd
- PublisherSociety for Industrial and Applied Mathematics
- Publication dateMay 1, 2005
- LanguageEnglish
- Dimensions5.75 x 0.25 x 8.75 inches
- Print length184 pages
Frequently bought together

Customers who viewed this item also viewed
Editorial Reviews
Review
'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
About the Author
Product details
- Publisher : Society for Industrial and Applied Mathematics; 2nd edition (May 1, 2005)
- Language : English
- Paperback : 184 pages
- ISBN-10 : 0898715814
- ISBN-13 : 978-0898715811
- Item Weight : 8 ounces
- Dimensions : 5.75 x 0.25 x 8.75 inches
- Best Sellers Rank: #3,694,474 in Books (See Top 100 in Books)
- #626 in Network Storage & Retrieval Administration
- #2,921 in General Library & Information Sciences
- #7,343 in Internet & Telecommunications
- Customer Reviews:
Important information
To report an issue with this product, click here.
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
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
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.
I own over 100 books on search and related topics. This is a wonderful little book—it’s very different from the others. Can you build a search engine with just this book? Maybe, maybe not. But does this book cover things differently than the other literature, often times more clearly? You bet.
I’ve been building and selling a commercial search engine for the last two years—I wish I had had this book when I started!
(Some reviewers mentioned the price—it is expensive as I write this—I bought my copy used for a lot less.)
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.
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.
This book is good for beginners in search engines field but not for the money it costs now.





