Buy Understanding Search Engines by Michael W. Berry
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)
Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)

Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)


     0     
5
4
3
2
1



International Edition


X
About the Book

The second edition of Understanding Search Engines 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.

Table of Contents:
Preface to the Second Edition Preface to the First Edition Chapter 1: Introduction Chapter 2: Document File Preparation Chapter 3: Vector Space Models Chapter 4: Matrix Decompositions Chapter 5: Query Management Chapter 6: Ranking and Relevance Feedback Chapter 7: Searching by Link Structure Chapter 8: User Interface Considerations Chapter 9: Further Reading Bibliography Index.

About the Author :
Michael W. Berry is a Professor and Interim Department Head in the Department of Computer Science at the University of Tennessee and a faculty member in the Graduate School in Genome Science & Technology Program at the University of Tennessee and Oak Ridge National Laboratory. His current research interests include information retrieval, data mining, scientific computing, computational science, numerical linear algebra, and parallel computation. Murray Browne is a Research Associate in the Computer Science Department at the University of Tennessee. He is a member of the American Society for Information Science and Technology and has published numerous essays, book reviews, newspaper articles, and feature stories.

Review :
'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


Best Sellers


Product Details
  • ISBN-13: 9780898715811
  • Publisher: Society for Industrial & Applied Mathematics,U.S.
  • Publisher Imprint: Society for Industrial & Applied Mathematics,U.S.
  • Edition: New edition
  • Language: English
  • Returnable: Y
  • Spine Width: 7 mm
  • Weight: 202 gr
  • ISBN-10: 0898715814
  • Publisher Date: 31 May 2005
  • Binding: Paperback
  • Height: 226 mm
  • No of Pages: 134
  • Series Title: Software Environments and Tools
  • Sub Title: Mathematical Modeling and Text Retrieval
  • Width: 149 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)
Society for Industrial & Applied Mathematics,U.S. -
Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Understanding Search Engines: Mathematical Modeling and Text Retrieval(Software Environments and Tools)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!