Sciweavers

588 search results - page 57 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
14 years 1 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
ECCV
2004
Springer
14 years 12 months ago
Transformation-Invariant Embedding for Image Analysis
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
Ali Ghodsi, Jiayuan Huang, Dale Schuurmans
GFKL
2005
Springer
82views Data Mining» more  GFKL 2005»
14 years 3 months ago
Robust Multivariate Methods: The Projection Pursuit Approach
Projection pursuit was originally introduced to identify structures in multivariate data clouds (Huber, 1985). The idea of projecting data to a lowdimensional subspace can also be ...
Peter Filzmoser, Sven Serneels, Christophe Croux, ...
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
14 years 11 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...