Sciweavers

59 search results - page 5 / 12
» REDUS: finding reducible subspaces in high dimensional data
Sort
View
HAIS
2009
Springer
13 years 10 months ago
Unsupervised Feature Selection in High Dimensional Spaces and Uncertainty
Developing models and methods to manage data vagueness is a current effervescent research field. Some work has been done with supervised problems but unsupervised problems and unce...
José Ramón Villar, María del ...
ICCV
2007
IEEE
14 years 7 months ago
Robust Visual Tracking Based on Incremental Tensor Subspace Learning
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 9 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
CVPR
2005
IEEE
14 years 7 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 6 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal