Sciweavers

3050 search results - page 311 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2009
IEEE
16 years 7 months 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
ICML
2009
IEEE
16 years 7 months ago
Structure learning with independent non-identically distributed data
There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i.d. s...
Robert E. Tillman
ICML
2007
IEEE
16 years 7 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
ICML
2008
IEEE
16 years 7 months ago
Adaptive p-posterior mixture-model kernels for multiple instance learning
In multiple instance learning (MIL), how the instances determine the bag-labels is an essential issue, both algorithmically and intrinsically. In this paper, we show that the mech...
Hua-Yan Wang, Qiang Yang, Hongbin Zha
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 7 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims