Tree-growing with probabilistically imprecise data

MaRDI QIDQ4395476zbMATH OpenFDO

Authors Anna Ciampi, Edwin Diday, Jacques Lebbe, Emmanuel Périnel, Régine Vignes

Publication date 4 August 1998

zbMATH Keywords

algorithm of tree-growingbinary segmentationdecision treeEM algorithmimprecise datamaximum likelihood criterionmixture distributions problemrecursive partitionsymbolic data analysis

Mathematics Subject Classification ID

Recommendations

• Using probability trees to compute marginals with imprecise probabilities
• Imprecise probability trees: bridging two theories of imprecise probability
• Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures
• Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
• Inference on the History of a Randomly Growing Tree
• scientific article; zbMATH DE number 4104976
• Probabilistic characterization of random decision trees
• scientific article; zbMATH DE number 4060494

Cited in

(3)

• Symbolic object description of strata by segmentation trees
• Symbolic discrimination rules
• Far beyond the classical data models: symbolic data analysis

This page was built for publication: Tree-growing with probabilistically imprecise data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395476)