https://scholars.lib.ntu.edu.tw/handle/123456789/379132
標題: | Syntactic sensitive complexity for symbol-free sequence | 作者: | CHENG-YUAN LIOU Liou, D.-R. Simak, A.A. Huang, B.-S. |
關鍵字: | L-system; measure of regularity; quasi-regular structure; rewriting rule; text complexity | 公開日期: | 2013 | 卷: | 8261 LNCS | 起(迄)頁: | 14-21 | 來源出版物: | Lecture Notes in Computer Science | 摘要: | 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. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84892884612&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/379132 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84892884612&doi=10.1007%2f978-3-642-42057-3_3&partnerID=40&md5=c2f7038b9cf9f2e9103e52059961c29a |
ISSN: | 03029743 | DOI: | 10.1007/978-3-642-42057-3-3 | SDG/關鍵字: | Big data; L-systems; measure of regularity; Regular structure; Rewriting rules; text complexity; Anomaly detection |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。