Sciweavers

250 search results - page 28 / 50
» Learning Probabilistic Models of Word Sense Disambiguation
Sort
View
COLT
1995
Springer
15 years 1 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
15 years 10 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
ICANN
2009
Springer
15 years 4 months ago
Learning Features by Contrasting Natural Images with Noise
Abstract. Modeling the statistical structure of natural images is interesting for reasons related to neuroscience as well as engineering. Currently, this modeling relies heavily on...
Michael Gutmann, Aapo Hyvärinen
CVPR
1998
IEEE
15 years 12 months ago
Action Recognition Using Probabilistic Parsing
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
Aaron F. Bobick, Yuri A. Ivanov
TASLP
2010
144views more  TASLP 2010»
14 years 4 months ago
Active Learning With Sampling by Uncertainty and Density for Data Annotations
To solve the knowledge bottleneck problem, active learning has been widely used for its ability to automatically select the most informative unlabeled examples for human annotation...
Jingbo Zhu, Huizhen Wang, Benjamin K. Tsou, Matthe...