Using the H-Divergence to Prune Probabilistic Automata
Lists
Only you see this
Abstract
A problem usually encountered in probabilistic automata learning is the difficulty to deal with large training samples and/or wide alphabets. This is partially due to the size of the resulting Probabilistic Prefix Tree (PPT) from which state merging-based learning algorithms are generally applied. In this paper, we propose a novel method to prune PPTs by making use of the H-divergence d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</sub> , recently introduced in the field of domain adaptation. d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</sub> is based on the classification error made by an hypothesis learned from unlabeled examples drawn according to two distributions to compare. Through a thorough comparison with state-of-the-art divergence measures, we provide experimental evidences that demonstrate the efficiency of our method based on this simple and intuitive criterion.
BibTeX
@inproceedings{marc2011using,
author = {Bernard Marc and Baptiste Jeudy and Jean-Philippe Peyrache and Marc Sebban and Franck Thollard},
title = {{Using the H-Divergence to Prune Probabilistic Automata}},
booktitle = {ICTAI},
year = {2011},
doi = {10.1109/ictai.2011.114},
}Loading related content...