Syntactic sensitive complexity for symbol-free sequence
Journal
Lecture Notes in Computer Science
Journal Volume
8261 LNCS
Pages
14-21
Date Issued
2013
Author(s)
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.
Subjects
L-system; measure of regularity; quasi-regular structure; rewriting rule; text complexity
Other Subjects
Big data; L-systems; measure of regularity; Regular structure; Rewriting rules; text complexity; Anomaly detection
Type
conference paper