Name
Abstract | ||
|---|---|---|
Probabilistic Classifiers Chains (PCC) offers interesting properties to solve multi-label classification tasks due to its ability to estimate the joint probability of the labels. However, PCC presents the major drawback of having a high computational cost in the inference process required to predict new samples. Lately, several approaches have been proposed to overcome this issue, including beam search and an ε-Approximate algorithm based on uniform-cost search. Surprisingly, the obvious possibility of using heuristic search has not been considered yet. This paper studies this alternative and proposes an admisible heuristic that, applied in combination with A* algorithm, guarantees, not only optimal predictions in terms of subset 0/1 loss, but also that it always explores less nodes than ε-Approximate algorithm. In the experiments reported, the number of nodes explored by our method is less than two times the number of labels for all datasets analyzed. But, the difference in explored nodes must be large enough to compensate the overhead of the heuristic in order to improve prediction time. Thus, our proposal may be a good choice for complex multi-label problems. |
Year | Venue | Field |
|---|---|---|
2015 | IJCAI | Drawback,Data mining,Heuristic,Joint probability distribution,Inference,Computer science,Beam search,Artificial intelligence,Probabilistic logic,Probabilistic classification,Machine learning |
DocType | Citations | PageRank |
Conference | 3 | 0.40 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deiner Mena | 1 | 5 | 0.78 |
| Elena Montanes | 2 | 168 | 15.24 |
| José Ramón Quevedo | 3 | 175 | 15.37 |
| Juan José Del Coz | 4 | 312 | 22.86 |