Michael P. Holmes, Charles Lee Isbell Jr.. Looping suffix tree-based inference of partially observable hidden state. In William W. Cohen, Andrew Moore, editors, Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006. Volume 148 of ACM International Conference Proceeding Series, pages 409-416, ACM, 2006. [doi]
@inproceedings{HolmesJ06,
title = {Looping suffix tree-based inference of partially observable hidden state},
author = {Michael P. Holmes and Charles Lee Isbell Jr.},
year = {2006},
doi = {10.1145/1143844.1143896},
url = {http://doi.acm.org/10.1145/1143844.1143896},
tags = {rule-based},
researchr = {https://researchr.org/publication/HolmesJ06},
cites = {0},
citedby = {0},
pages = {409-416},
booktitle = {Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006},
editor = {William W. Cohen and Andrew Moore},
volume = {148},
series = {ACM International Conference Proceeding Series},
publisher = {ACM},
isbn = {1-59593-383-2},
}