Sciweavers

2295 search results - page 131 / 459
» Learning Overcomplete Representations
Sort
View
70
Voted
AAAI
1998
15 years 2 months ago
Feature Generation for Sequence Categorization
The problem of sequence categorization is to generalize from a corpus of labeled sequences procedures for accurately labeling future unlabeled sequences. The choice of representat...
Daniel Kudenko, Haym Hirsh
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 10 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
138
Voted
CLEF
2011
Springer
14 years 16 days ago
Author Identification Using Semi-supervised Learning - Notebook for PAN at CLEF 2011
Author identification models fall into two major categories according to the way they handle the training texts: profile-based models produce one representation per author while in...
Ioannis Kourtis, Efstathios Stamatatos
124
Voted
ICML
2009
IEEE
16 years 1 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2007
IEEE
16 years 1 months ago
Bayesian compressive sensing and projection optimization
This paper introduces a new problem for which machine-learning tools may make an impact. The problem considered is termed "compressive sensing", in which a real signal o...
Shihao Ji, Lawrence Carin