141 search results - page 10 / 29 » Approximate algorithms for credal networks with binary varia... |
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
JMLR
2010
13 years 3 months ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we propose the multirelational topic model (MRTM) for multiple types of link modeling such as citation and coauthor links in document networks. In the citation networ...
IJCNN
2006
IEEE
14 years 2 months ago
2006
IEEE
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
CVPR
2008
IEEE
13 years 10 months ago
2008
IEEE
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...