Skip to search formSkip to main contentSkip to account menu

Clustering high-dimensional data

Known as: Subspace clustering 
Clustering high-dimensional data is the cluster analysis of data with anywhere from a few dozen to many thousands of dimensions. Such high… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Motivation: Software engineering for High Performace Computing (HPC) environments in general [1] and for big data in particular… 
2014
2014
The ability to simplify and categorize things is one of the most important elements of human thought, understanding, and learning… 
Review
2013
Review
2013
clusters in high dimensional data is a challenging task as the high dimensional data comprises hundreds of attributes. Subspace… 
2012
2012
We present a novel approach to improving subspace clustering by exploiting the spatial constraints. The new method encourages the… 
2010
2010
Searching initial centers in high dimensional space is an interesting and important problem which is relevant for the wide… 
2010
2010
Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for… 
2009
2009
In iterative refinement clustering algorithms, such as the various types of K-Means algorithms, the clustering results are very… 
2009
2009
This paper proposes a particle swarm optimizer to solve the variable weighting problem in subspace clustering of high-dimensional… 
2007
2007
Abstract : Geometric harmonics provides a framework for taking data in high-dimensional measurement spaces and embedding them in… 
2005
2005
The self-organizing map (SOM) is a very popular unsupervised neural-network model for analyzing of high-dimensional input data as…