z-logo
open-access-imgOpen Access
Tractable inference for probabilistic data models
Author(s) -
Csato Lehel,
Opper Manfred,
Winther Ole
Publication year - 2003
Publication title -
complexity
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.447
H-Index - 61
eISSN - 1099-0526
pISSN - 1076-2787
DOI - 10.1002/cplx.10086
Subject(s) - probabilistic logic , inference , statistical model , statistical inference , computer science , machine learning , artificial intelligence , theoretical computer science , data mining , mathematics , statistics
We present an approximation technique for probabilistic data models with a large number of hidden variables, based on ideas from statistical physics. We give examples for two nontrivial applications. © 2003 Wiley Periodicals, Inc.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom