Sciweavers

23 search results - page 1 / 5
» A constrained optimization approach for an adaptive generali...
Sort
View
CEE
2010
185views more  CEE 2010»
13 years 5 months ago
A constrained optimization approach for an adaptive generalized subspace tracking algorithm
In this paper, we present a new algorithm for tracking the generalized signal subspace recursively. It is based on an interpretation of the generalized signal subspace as the solu...
Amir Valizadeh, Mahsa Najibi
CVPR
2005
IEEE
14 years 6 months ago
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearance...
Ming Yang, Ying Wu
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
14 years 5 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
SIGIR
2004
ACM
13 years 10 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
ECAI
2006
Springer
13 years 8 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani