Abstract
This work uses L-system to model the text sequence. The sequence complexity is obtained by calculating the complexity of its modeling system. It can sense certain quasi-regular structures and serves as a measure of regularity of the sequence. The outliers and statistics of the complexity values can be applied to the anomaly detection of symbol sequences. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Liou, C. Y., Liou, D. R., Simak, A. A., & Huang, B. S. (2013). Syntactic sensitive complexity for symbol-free sequence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8261 LNCS, pp. 14–21). Springer Verlag. https://doi.org/10.1007/978-3-642-42057-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
