Cantitate/Preț
Produs

Intro Clust Large High Dimens Data

Autor Jacob Kogan
en Limba Engleză Paperback – 22 feb 2007
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.
Citește tot Restrânge

Preț: 28549 lei

Preț vechi: 35687 lei
-20%

Puncte Express: 428

Carte tipărită la comandă

Livrare economică 24 iulie-07 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9780521617932
ISBN-10: 0521617936
Pagini: 222
Dimensiuni: 152 x 229 x 12 mm
Greutate: 0.33 kg
Editura: Cambridge University Press
Locul publicării:New York, United States

Cuprins

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.

Recenzii

"...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

Descriere

Focuses on a few of the important clustering algorithms in the context of information retrieval.