Sciweavers

1106 search results - page 15 / 222
» On regularization algorithms in learning theory
Sort
View
ICML
2000
IEEE
15 years 10 months ago
Discovering Test Set Regularities in Relational Domains
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we presen...
Seán Slattery, Tom M. Mitchell
NIPS
2008
14 years 11 months ago
Non-parametric Regression Between Manifolds
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem arises frequently in many application areas ranging from signal processing, comp...
Florian Steinke, Matthias Hein
ICPR
2008
IEEE
15 years 11 months ago
Fast and regularized local metric for query-based operations
To learn a metric for query?based operations, we combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric in a unified algorithm to find...
Frank P. Ferrie, Karim T. Abou-Moustafa
NN
2010
Springer
189views Neural Networks» more  NN 2010»
14 years 4 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk