Suffix Classification Trees

Wojciech Wieczorek, Olgierd Unold, Łukasz Strąk
Proceedings of The 14th International Conference on Grammatical Inference 2018, PMLR 93:44-53, 2019.

Abstract

In this paper, a new method for generating acyclic word graph is proposed. The essential characteristics of the method are: the construction of the data structure in linear time with respect to the size of an input and gathering factor frequencies. Moreover, it has been shown through a computational experiment that the proposed approach surpasses—with respect to AUC score—similar grammatical inference algorithms on the sequences from a real biological dataset.

Cite this Paper

BibTeX
@InProceedings{pmlr-v93-wieczorek19a, title = {Suffix Classification Trees}, author = {Wieczorek, Wojciech and Unold, Olgierd and Lukasz Strak}, booktitle = {Proceedings of The 14th International Conference on Grammatical Inference 2018}, pages = {44--53}, year = {2019}, editor = {Unold, Olgierd and Dyrka, Witold and Wieczorek, Wojciech}, volume = {93}, series = {Proceedings of Machine Learning Research}, month = {feb}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v93/wieczorek19a/wieczorek19a.pdf}, url = {https://proceedings.mlr.press/v93/wieczorek19a.html}, abstract = {In this paper, a new method for generating acyclic word graph is proposed. The essential characteristics of the method are: the construction of the data structure in linear time with respect to the size of an input and gathering factor frequencies. Moreover, it has been shown through a computational experiment that the proposed approach surpasses—with respect to AUC score—similar grammatical inference algorithms on the sequences from a real biological dataset.} }
Endnote
%0 Conference Paper %T Suffix Classification Trees %A Wojciech Wieczorek %A Olgierd Unold %A Łukasz Strąk %B Proceedings of The 14th International Conference on Grammatical Inference 2018 %C Proceedings of Machine Learning Research %D 2019 %E Olgierd Unold %E Witold Dyrka %E Wojciech Wieczorek %F pmlr-v93-wieczorek19a %I PMLR %P 44--53 %U https://proceedings.mlr.press/v93/wieczorek19a.html %V 93 %X In this paper, a new method for generating acyclic word graph is proposed. The essential characteristics of the method are: the construction of the data structure in linear time with respect to the size of an input and gathering factor frequencies. Moreover, it has been shown through a computational experiment that the proposed approach surpasses—with respect to AUC score—similar grammatical inference algorithms on the sequences from a real biological dataset.
APA
Wieczorek, W., Unold, O. & Strąk, Ł.. (2019). Suffix Classification Trees. Proceedings of The 14th International Conference on Grammatical Inference 2018, in Proceedings of Machine Learning Research 93:44-53 Available from https://proceedings.mlr.press/v93/wieczorek19a.html.

Related Material