2014/04/15 by Christina Papagiannopoulou, Grigorios Tsoumakas, Papagiannopoulou, Christina +3
Computer Science · #Advanced Text Analysis Techniques #Natural Language Processing Techniques #Text and Document Classification Technologies #cs.LG
paper · pdf · doi:10.48550/arxiv.1404.4038
arxiv created 2014/04/17 · arxiv updated 2014/04/18
This work presents a sound probabilistic method for enforcing adherence of the marginal probabilities of a multi-label model to automatically discovered deterministic relationships among labels. In particular we focus on discovering two kinds of relationships among the labels. The first one concerns pairwise positive entailement: pairs of labels, where the presence of one implies the presence of the other in all instances of a dataset. The second concerns exclusion: sets of labels that do not coexist in the same instances of the dataset. These relationships are represented with a Bayesian network. Marginal probabilities are entered as soft evidence in the network and adjusted through probabilistic inference. Our approach offers robust improvements in mean average precision compared to the standard binary relavance approach across all 12 datasets involved in our experiments. The discovery process helps interesting implicit knowledge to emerge, which could be useful in itself.