Papers by Keyword: Maximal Frequent Itemsets

Abstract: Ming association rules have been proved as an important method to detect intrusions. To improve response speed and detecting precision in the current intrusion detection system, this papers proposes an intrusion detection system model of MMFIID-DS. Firstly, to improve response speed of the system by greatly reducing search space, various pruning strategies are proposed to mine the maximal frequent itemsets on trained normal data set, abnormal data set and current data streams to establish normal and abnormal behavior pattern as well as user behavior pattern of the system. Besides, to improve detection precision of the system, misuse detection and anomaly detection techniques are combined. Both theoretical and experimental results indicate that the MMFIID-DS intrusion detection system is fairly sound in performance.

Abstract: Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper focuses on mining maximal frequent itemsets approximately over a stream landmark model. A false negative method is proposed based on Chernoff Bound to save the computing and memory cost. Our experimental results on a real world dataset show that our algorithm is effective and efficient.