Sciweavers

4047 search results - page 1 / 810
» The Discrete Basis Problem
Sort
View
TKDE
2008
126views more  TKDE 2008»
13 years 4 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
13 years 11 months ago
Constructing action set from basis functions for reinforcement learning of robot control
Abstract— Continuous action sets are used in many reinforcement learning (RL) applications in robot control since the control input is continuous. However, discrete action sets a...
Akihiko Yamaguchi, Jun Takamatsu, Tsukasa Ogasawar...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 5 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
IDA
2002
Springer
13 years 4 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
COMPGEOM
2010
ACM
13 years 9 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang