Introduction To Clustering Large And High Dimensional Data
Download Introduction To Clustering Large And High Dimensional Data PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Introduction To Clustering Large And High Dimensional Data book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Introduction to Clustering Large and High-Dimensional Data
Focuses on a few of the important clustering algorithms in the context of information retrieval.
Understanding High-Dimensional Spaces
Author: David B. Skillicorn
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-09-27
This book proposes new ways of thinking about high-dimensional spaces using two models: the skeleton that relates the clusters to one another, and the boundaries in empty space that provide new perspectives on outliers and on outlying regions.
Introduction to Clustering Large and High-Dimensional Data
Author: Jacob Kogan
language: en
Publisher: Cambridge University Press
Release Date: 2006-11-13
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.