Introduction to clustering large and high-dimensional data
著者
書誌事項
Introduction to clustering large and high-dimensional data
Cambridge University Press, c2007
- : hardback
- : paperback
大学図書館所蔵 件 / 全13件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 189-201) and index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より
