A family of admissible heuristics for A^* to perform inference in probabilistic classifier chains
From MaRDI portal
Publication:2360976
Recommendations
- Beam search algorithms for multilabel learning
- Heuristic tree search with nonparametric statistical inference methods
- Generalized best-first search strategies and the optimality of A*
- The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces
- scientific article; zbMATH DE number 4045171
Cites work
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- An analysis of chaining in multi-label classification
- Beam search algorithms for multilabel learning
- Combining instance-based learning and logistic regression for multilabel classification
- Efficient Monte Carlo methods for multi-dimensional learning with classifier chains
- ML-KNN: A lazy learning approach to multi-label learning
- On label dependence and loss minimization in multi-label classification
- Trust region Newton method for logistic regression
Cited in
(2)
This page was built for publication: A family of admissible heuristics for \(\mathrm{A}^*\) to perform inference in probabilistic classifier chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360976)