Sciweavers

194 search results - page 16 / 39
» Subspace Regularization: A New Semi-supervised Learning Meth...
Sort
View
SIGIR
2004
ACM
15 years 5 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
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
13 years 7 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
CSSC
2008
80views more  CSSC 2008»
14 years 11 months ago
Logistic Discrimination with Total Variation Regularization
This article introduces a regularized logistic discrimination method that is especially suited for discretized stochastic processes (such as periodograms, spectrograms, EEG curves...
Robin Rühlicke, Daniel Gervini
ICB
2009
Springer
159views Biometrics» more  ICB 2009»
15 years 6 months ago
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition
The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To...
Changyou Chen, Junping Zhang, Rudolf Fleischer
IJCNN
2006
IEEE
15 years 5 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer