English español

Repositorio de la Universidad de Oviedo > Producción Bibliográfica de UniOvi: RECOPILA > Artículos >

Use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10651/43023

Título : A heuristic in A* for inference in nonlinear Probabilistic Classifier Chains
Autor(es) y otros: Mena Waldo, Deiner
Quevedo Pérez, José Ramón
Montañés Roces, Elena
Coz Velasco, Juan José del
Palabras clave: Multilabel
Classifier chains
Heuristic search
Fecha de publicación : 2017
Editorial : Elsevier
Versión del editor: http://dx.doi.org/10.1016/j.knosys.2017.03.015
Citación : Knowledge-Based Systems, 126, p. 78-90 (2017); doi:10.1016/j.knosys.2017.03.015
Descripción física: p. 78-90
Resumen : Probabilistic Classifier Chains (PCC) is a very interesting method to cope with multi-label classification, since it is able to obtain the entire joint probability distribution of the labels. However, such probability distribution is obtained at the expense of a high computational cost. Several efforts have been made to overcome this pitfall, proposing different inference methods for estimating the probability distribution. Beam search and the - approximate algorithms are two methods of this kind. A more recently approach is based on the A* algorithm with an admissible heuristic, but it is limited to be used just for linear classifiers as base methods for PCC. This paper goes in that direction presenting an alternative admissible heuristic for the A* algorithm with two promising advantages in comparison to the above-mentioned heuristic, namely, i) it is more dominant for the same depth and, hence, it explores fewer nodes and ii) it is suitable for nonlinear classifiers. Additionally, the paper proposes an efficient implementation for the computation of the heuristic that reduces the number of models that must be evaluated by half. The experiments show, as theoretically expected, that this new algorithm reaches Bayes-optimal predictions in terms of subset 0/1 loss and explores fewer nodes than other state-of-the-art methods that also provide optimal predictions. In spite of exploring fewer nodes, this new algorithm is not as fast as the -approximate algorithm with when the search for an optimal solution is highly directed. However, it shows its strengths when the datasets present more uncertainty, making faster predictions than other state-of-the-art approaches
Fecha fin embargo: 2020-06-30
URI : http://hdl.handle.net/10651/43023
ISSN : 0950-7051
Aparece en las colecciones: Artículos
Investigaciones y Documentos OpenAIRE

Ficheros en este ítem:

Fichero Tamaño Formato
ExhaustivePCC-grnAcc.pdf828,15 kBAdobe PDFVisualizar/Abrir

Exportar a Mendeley

Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.


Base de Datos de Autoridades Biblioteca Universitaria Consultas / Sugerencias