Sciweavers

186 search results - page 20 / 38
» Learning directed probabilistic logical models from relation...
Sort
View
ICML
2003
IEEE
16 years 15 days ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
NIPS
1998
15 years 1 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 5 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
AAAI
2010
15 years 1 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
ICML
2006
IEEE
16 years 15 days ago
Combining discriminative features to infer complex trajectories
We propose a new model for the probabilistic estimation of continuous state variables from a sequence of observations, such as tracking the position of an object in video. This ma...
David A. Ross, Simon Osindero, Richard S. Zemel