10054 search results - page 88 / 2011 » On the Complexity of Function Learning |
109
click to vote
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
It is possible to broadly characterize two approaches to probabilistic modeling in terms of generative and discriminative methods. Provided with sufficient training data the discr...
115
click to vote
JMLR
2002
15 years 4 days ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
117
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
106
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...