Sciweavers

434 search results - page 32 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
AAAI
2010
13 years 10 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
TSP
2010
13 years 3 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
IJCAI
2007
13 years 10 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant
ICCS
2007
Springer
14 years 2 months ago
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
Omar Bashir, Omar Ghattas, Judith Hill, Bart G. va...
ICML
2004
IEEE
14 years 9 months ago
Automated hierarchical mixtures of probabilistic principal component analyzers
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
Ting Su, Jennifer G. Dy