Sciweavers

1180 search results - page 110 / 236
» An Instance Selection Approach to Multiple Instance Learning
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Online and batch learning of pseudo-metrics
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...
Shai Shalev-Shwartz, Yoram Singer, Andrew Y. Ng
JMLR
2006
112views more  JMLR 2006»
14 years 10 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
IJCSA
2007
104views more  IJCSA 2007»
14 years 9 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
CP
2006
Springer
15 years 1 months ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...
UAI
1996
14 years 11 months ago
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
Rina Dechter