Syntactic sensitive complexity for symbol-free sequence

07/01/2013

∙

This work uses the L-system to construct a tree structure for the text sequence and derives its complexity. It serves as a measure of structural complexity of the text. It is applied to anomaly detection in data transmission.

READ FULL TEXT

Syntactic sensitive complexity for symbol-free sequence

Explainable multi-class anomaly detection on functional data

Global Information Guided Video Anomaly Detection

Anomaly-Injected Deep Support Vector Data Description for Text Outlier Detection

A Transfer Learning Framework for Anomaly Detection Using Model of Normality

Comparison of RNN Encoder-Decoder Models for Anomaly Detection

Innovations Autoencoder and its Application in Real-Time Anomaly Detection

Controllable Sentence Simplification

Syntactic sensitive complexity for symbol-free sequence

Related Research

Explainable multi-class anomaly detection on functional data

Global Information Guided Video Anomaly Detection

Anomaly-Injected Deep Support Vector Data Description for Text Outlier Detection

A Transfer Learning Framework for Anomaly Detection Using Model of Normality

Comparison of RNN Encoder-Decoder Models for Anomaly Detection

Innovations Autoencoder and its Application in Real-Time Anomaly Detection

Controllable Sentence Simplification