Sciweavers

165 search results - page 12 / 33
» Adaptive dimension reduction for clustering high dimensional...
Sort
View
ICCV
2003
IEEE
16 years 1 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
TSP
2010
14 years 6 months ago
On local intrinsic dimension estimation and its applications
In this paper, we present multiple novel applications for local intrinsic dimension estimation. There has been much work done on estimating the global dimension of a data set, typi...
Kevin M. Carter, Raviv Raich, Alfred O. Hero
WIRN
2005
Springer
15 years 5 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
ICPP
2000
IEEE
15 years 4 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ICANN
2005
Springer
15 years 5 months ago
High-Throughput Multi-dimensional Scaling (HiT-MDS) for cDNA-Array Expression Data
Multidimensional Scaling (MDS) is a powerful dimension reduction technique for embedding high-dimensional data into a lowdimensional target space. Thereby, the distance relationshi...
Marc Strickert, Stefan Teichmann, Nese Sreenivasul...