180 search results - page 5 / 36 » Generalized Projected Clustering in High-Dimensional Data St... |
BMCBI
2007
14 years 9 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
PR
2007
14 years 9 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
168
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
114
Voted
ISCA
2007
IEEE
14 years 9 months ago
2007
IEEE
Hyperspectral sensors represent the most advanced instruments currently available for remote sensing of the Earth. The high spatial and spectral resolution of the images supplied ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...