Sciweavers

824 search results - page 116 / 165
» Learning probabilistic logic models from probabilistic examp...
Sort
View
NIPS
2004
15 years 7 months ago
Hierarchical Distributed Representations for Statistical Language Modeling
Statistical language models estimate the probability of a word occurring in a given context. The most common language models rely on a discrete enumeration of predictive contexts ...
John Blitzer, Kilian Q. Weinberger, Lawrence K. Sa...
ML
2000
ACM
124views Machine Learning» more  ML 2000»
15 years 6 months ago
Text Classification from Labeled and Unlabeled Documents using EM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
Kamal Nigam, Andrew McCallum, Sebastian Thrun, Tom...
AI
2011
Springer
15 years 1 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman
NIPS
2001
15 years 7 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
KDD
2002
ACM
127views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining knowledge-sharing sites for viral marketing
Viral marketing takes advantage of networks of influence among customers to inexpensively achieve large changes in behavior. Our research seeks to put it on a firmer footing by mi...
Matthew Richardson, Pedro Domingos