Sciweavers

137 search results - page 7 / 28
» A Direct Method for Building Sparse Kernel Learning Algorith...
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ICMLA
2010
13 years 5 months ago
Heuristic Method for Discriminative Structure Learning of Markov Logic Networks
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
Quang-Thang Dinh, Matthieu Exbrayat, Christel Vrai...
ILP
2007
Springer
14 years 1 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICPR
2006
IEEE
14 years 8 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden