Sciweavers

186 search results - page 13 / 38
» Learning directed probabilistic logical models from relation...
Sort
View
WWW
2008
ACM
16 years 9 days ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...
96
Voted
ICML
1998
IEEE
16 years 13 days ago
Heading in the Right Direction
Stochastic topological models, and hidden Markov models in particular, are a useful tool for robotic navigation and planning. In previous work we have shown how weak odometric dat...
Hagit Shatkay, Leslie Pack Kaelbling
TNN
1998
123views more  TNN 1998»
14 years 11 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
104
Voted
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 29 days ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICML
2009
IEEE
16 years 13 days ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos