Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Introduction to Clustering Large and High-Dimensional Data

$78.99

  • Date Published: November 2006
  • availability: Replaced by 9780521617932
  • format: Hardback
  • isbn: 9780521852678

$78.99
Hardback

Replaced by 9780521617932
Unavailable Add to wishlist

Other available formats:
Paperback, eBook


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 collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
About the Authors
  • 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.

    • 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
    Read more

    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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • 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
    3. BIRCH
    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.

  • Author

    Jacob Kogan, University of Maryland, Baltimore
    Jacob Kogan is an Associate Professor in the Department of Mathematics and Statistics at the University of Maryland, Baltimore County. Dr. Kogan received his PhD in Mathematics from Weizmann Institute of Science, has held teaching and research positions at the University of Toronto and Purdue University. His research interests include Text and Data Mining, Optimization, Calculus of Variations, Optimal Control Theory, and Robust Stability of Control Systems. Dr. Kogan is the author of Bifurcations of Extremals in Optimal Control and Robust Stability and Convexity: An Introduction. Since 2001, he has also been affiliated with the Department of Computer Science and Electrical Engineering at UMBC. Dr. Kogan is a recipient of 2004–2005 Fulbright Fellowship to Israel. Together with Charles Nicholas of UMBC and Marc Teboulle of Tel-Aviv University he is co-editor of the volume Grouping Multidimensional Data: Recent Advances in Clustering.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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 ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×