Latent classification models for binary data
From MaRDI portal
Publication:2270743
DOI10.1016/j.patcog.2009.05.002zbMath1175.68368OpenAlexW2165634546MaRDI QIDQ2270743
Thomas D. Nielsen, Helge Langseth
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.05.002
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)
Related Items (2)
Multiclass classification with potential function rules: margin distribution and generalization ⋮ Efficient mixture model for clustering of sparse high dimensional binary data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wrappers for feature subset selection
- EM algorithms for ML factor analysis
- A Bayesian method for the induction of probabilistic networks from data
- On the optimality of the simple Bayesian classifier under zero-one loss
- Bayesian network classifiers
- Not so naive Bayes: Aggregating one-dependence estimators
- Latent classification models
- An introduction to variational methods for graphical models
- Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
- Ridge Estimators in Logistic Regression
- Noisy-or classifier
This page was built for publication: Latent classification models for binary data