766 search results - page 15 / 154 » Clustering high dimensional data using subspace and projecte... |
IGARSS
2010
13 years 6 months ago
2010
In this paper, we develop a new spatial preprocessing strategy which can be applied prior to a spectral-based endmember extraction process for unmixing of hyperspectral data. Our ...
VLDB
2000
ACM
14 years 5 days ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
SSDBM
2007
IEEE
14 years 2 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
ECEASST
2010
13 years 6 months ago
2010
: A new approach for topographic mapping, called Swarm-Organized Projection (SOP) is presented. SOP has been inspired by swarm intelligence methods for clustering and is similar to...
ICML
1995
IEEE
14 years 9 months ago
1995
IEEE
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...