Understanding High-Dimensional Spaces

David B. Skillicorn

ISBN 10: 3642333974 / ISBN 13: 9783642333972

Edité par Springer Berlin Heidelberg, 2012

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - High-dimensional spaces arise as a way of modelling datasets with many attributes. Such a dataset can be directly represented in a space spanned by its attributes, with each record represented as a point in the space with its position depending on its attribute values. Such spaces are not easy to work with because of their high dimensionality: our intuition about space is not reliable, and measures such as distance do not provide as clear information as we might expect. There are three main areas where complex high dimensionality and large datasets arise naturally: data collected by online retailers, preference sites, and social media sites, and customer relationship databases, where there are large but sparse records available for each individual; data derived from text and speech, where the attributes are words and so the corresponding datasets are wide, and sparse; and data collected for security, defense, law enforcement, and intelligence purposes, where the datasets arelarge and wide. Such datasets are usually understood either by finding the set of clusters they contain or by looking for the outliers, but these strategies conceal subtleties that are often ignored. In this book the author suggests new ways of thinking about high-dimensional spaces using two models: a skeleton that relates the clusters to one another; and boundaries in the empty space between clusters that provide new perspectives on outliers and on outlying regions. The book will be of value to practitioners, graduate students and researchers.

N° de réf. du vendeur 9783642333972

Détails bibliographiques

• Titre: Understanding High-Dimensional Spaces
• Éditeur: Springer Berlin Heidelberg
• Date de parution: 2012
• Langue: anglais
• ISBN à 10 chiffres: 3642333974
• ISBN à 13 chiffres: 9783642333972
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

Synopsis

High-dimensional spaces arise as a way of modelling datasets with many attributes. Such a dataset can be directly represented in a space spanned by its attributes, with each record represented as a point in the space with its position depending on its attribute values. Such spaces are not easy to work with because of their high dimensionality: our intuition about space is not reliable, and measures such as distance do not provide as clear information as we might expect.

There are three main areas where complex high dimensionality and large datasets arise naturally: data collected by online retailers, preference sites, and social media sites, and customer relationship databases, where there are large but sparse records available for each individual; data derived from text and speech, where the attributes are words and so the corresponding datasets are wide, and sparse; and data collected for security, defense, law enforcement, and intelligence purposes, where the datasets arelarge and wide. Such datasets are usually understood either by finding the set of clusters they contain or by looking for the outliers, but these strategies conceal subtleties that are often ignored. In this book the author suggests new ways of thinking about high-dimensional spaces using two models: a skeleton that relates the clusters to one another; and boundaries in the empty space between clusters that provide new perspectives on outliers and on outlying regions.

The book will be of value to practitioners, graduate students and researchers.

À propos de l?auteur

Prof. David B. Skillicorn is a professor in the School of Computing at Queen's University in Kingston, Ontario; he is also an adjunct professor in the Mathematics and Computer Science Department of the Royal Military College of Canada. His research interests include data mining, knowledge discovery, machine learning, parallel and distributed computing, intelligence and security informatics, and collaborative research.