A probabilistic classification method based on conditional independences
zbMATH Open1249.05273MaRDI QIDQ2898780FDOQ2898780
Authors: Edith Kovács, Tamás Szántai
Publication date: 12 July 2012
Published in: Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica (Search for Journal in Brave)
Recommendations
classificationMarkov networkinformative variables\(t\)-cherry probability distributionconditional independences
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial probability (60C05) Hypergraphs (05C65)
Cited In (11)
- Inductive Inference and Partition Exchangeability in Classification
- Relationship between homogeneity and independence constraints for classification algorithms
- Class-Based Probability Estimation Using a Semantic Hierarchy
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Title not available (Why is that?)
- Chained correlations for feature selection
- Independent rule in classification of multivariate binary data
- 强化属性依赖关系的 K 阶贝叶斯分类模型
- Predicting the Conditional Probability of Discovering a New Class
- Monte Carlo feature selection and interdependency discovery in supervised classification
- Lattice machine classification based on contextual probability
This page was built for publication: A probabilistic classification method based on conditional independences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898780)