Cost-sensitive feature acquisition and classification
From MaRDI portal
Publication:869033
Recommendations
- Using POMDPs for learning cost sensitive decision trees
- Learning cost-sensitive active classifiers
- Value of information lattice: exploiting probabilistic independence for effective feature subset acquisition
- Cost-Sensitive Classification with Unconstrained Influence Diagrams
- Classification with costly features as a sequential decision-making problem
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1509479 (Why is no real title available?)
- Anytime point-based approximations for large POMDPS
- Biological Sequence Analysis
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
- Planning and acting in partially observable stochastic domains
- The Complexity of Markov Decision Processes
Cited in
(11)- Effective active learning strategies for the use of large-margin classifiers in semantic annotation: an optimal parameter discovery perspective
- Value of information lattice: exploiting probabilistic independence for effective feature subset acquisition
- Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
- Adaptive covariate acquisition for minimizing total cost of classification
- Sequential approaches for learning datum-wise sparse representations
- Multi-stage classifier design
- A hierarchical model for test-cost-sensitive decision systems
- Classification with costly features as a sequential decision-making problem
- Classifier cascades and trees for minimizing feature evaluation cost
- Cost-sensitive feature selection of numeric data with measurement errors
- Non-adaptive stochastic score classification and explainable halfspace evaluation
This page was built for publication: Cost-sensitive feature acquisition and classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869033)