Symbolic discrimination rules
A tree-growing algorithm is proposed in order to treat explicitly probabilistic data. A population of \(n\) objects partitioned into \(m\) classes is considered. Each object is formally described by symbolic data of probabilistic assertion type. The aim is: (i) to describe in the form of a binary tree the various classes of the given partition; (ii) to build a decision rule (discrimination or classification rule) which is able to classify new objects (with unknown class membership) to one class of the given partition. Non-probabilistic Boolean descriptions can also be handled in the proposed framework by transforming to modal variables with uniform probability functions. For the entire collection see [Zbl 1039.62501].
- Centre and range method for fitting a linear regression model to symbolic interval data
- Symbolic object description of strata by segmentation trees
- Dynamic recursive tree-based partitioning for malignant melanoma identification in skin lesion dermoscopic images
- scientific article; zbMATH DE number 1674017 (Why is no real title available?)
- Generation of Boolean classification rules
- Far beyond the classical data models: symbolic data analysis
- Constrained linear regression models for symbolic interval-valued variables
This page was built for publication: Symbolic discrimination rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2756646)
