Syntactic sensitive complexity for symbol-free sequence
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 101 === This work uses the L-system to construct a tree structure for text sequence and derives its complexity [6]. This complexity serves as a measure of structural complexity of text sequence. We encode text sequences into binary strings and analyze their complexity...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52739916014916441015 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 101 === This work uses the L-system to construct a tree structure for text sequence and derives its complexity [6]. This complexity serves as a measure of structural complexity of text sequence. We encode text sequences into binary strings and analyze their complexity between different encoding methods.
Besides we compare our methods to other measures of complexity [4, 12] and study the possibility of anomaly detection in Network by Kullback–Leibler
divergence.
|
|---|