Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
There is a growing need for a more automated system of partitioning data sets into groups, or clusters. For example, digital libraries and the World Wide Web continue to grow exponentially, the ability to find useful information increasingly depends on the indexing infrastructure or search engine. Clustering techniques can be used to discover natural groups in data sets and to identify abstract structures that might reside there, without having any background knowledge of the characteristics of the data. Clustering has been used in a variety of areas, including computer vision, VLSI design, data mining, bio-informatics (gene expression analysis), and information retrieval, to name just a few. This book focuses on a few of the most important clustering algorithms, providing a detailed account of these major models in an information retrieval context. The beginning chapters introduce the classic algorithms in detail, while the later chapters describe clustering through divergences and show recent research for more advanced audiences.Read more
- Rather than providing comprehensive coverage of the area, the book focuses on a few important clustering algorithms
- A detailed and elementary description of the algorithms is provided in the beginning chapters, to be easily absorbed by undergraduates
- Recent research results involving sophisticated mathematics are of interest for graduate students and research experts
Reviews & endorsements
"...this book may serve as a useful reference for scientists and engineers who need to understand the concepts of clustering in general and/or to focus on text mining applications. It is also appropriate for students who are attending a course in pattern recognition, data mining, or classification and are interested in learning more about issues related to the k-means scheme for an undergraduate or master's thesis project. Last, it supplies very interesting material for instructors."
Nicolas Loménie, IAPR Newsletter
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: November 2006
- format: Hardback
- isbn: 9780521852678
- length: 222 pages
- dimensions: 234 x 156 x 19 mm
- weight: 0.419kg
- availability: Replaced by 9780521617932
Table of Contents
1. Introduction and motivation
2. Quadratic k-means algorithm
4. Spherical k-means algorithm
5. Linear algebra techniques
6. Information-theoretic clustering
7. Clustering with optimization techniques
8. k-means clustering with divergence
9. Assessment of clustering results
10. Appendix: Optimization and Linear Algebra Background
11. Solutions to selected problems.
You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×