Abstract.A new method of constructing classifiers from huge volume of temporal data is proposed in the paper. The novelty of introduced method lies in a multi-stage approach to constructing hierarchical classifiers that combines process mining, feature extraction based on temporal patterns and constructing classifiers based on a decision tree. Such an approach seems to be practical when dealing with huge volume of temporal data. As a proof of concept a system has been constructed for packet-based network traffic anomaly detection, where anomalies are represented by spatio-temporal complex concepts and called by behavioral patterns. Hierarchical classifiers constructed with the new approach turned out to be better than "flat" classifiers based directly on captured network traffic data.

No abstract

No abstract

A new method of decision tree construction from temporal data is proposed in the paper. This method uses the so-called temporal cuts for binary partition of data in tree nodes. The novelty of the proposed approach is that the quality of cuts is calculated not on the basis of the discernibility of objects (related to time points), but on the basis of the discernibility of time windows labeled with different decision classes. The paper includes results of experiments performed on our data sets and collections from machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision tree, and other methods well known from literature. Our new method outperforms these known methods.

No abstract