A family of admissible heuristics for A^* to perform inference in probabilistic classifier chains
DOI10.1007/S10994-016-5593-5zbMATH Open1412.68189OpenAlexW2523823872MaRDI QIDQ2360976FDOQ2360976
Authors: Deiner Mena, Elena Montañés, José Ramón Quevedo, Juan José Del Coz 
Publication date: 29 June 2017
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5593-5
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
inferencemulti-label classificationadmissible heuristics\(\mathrm{A}^*\)probabilistic classifier chains
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Trust region Newton method for logistic regression
- Title not available (Why is that?)
- Combining instance-based learning and logistic regression for multilabel classification
- ML-KNN: A lazy learning approach to multi-label learning
- An analysis of chaining in multi-label classification
- Beam search algorithms for multilabel learning
- On label dependence and loss minimization in multi-label classification
- Efficient Monte Carlo methods for multi-dimensional learning with classifier chains
Cited In (2)
Uses Software
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)
