An Optimized Apriori Algorithm Based on Sparse Matrix for Intrusion Detection

摘要

The original Apriori algorithm is widely used in the intrusion detection field, but it may consume incrediblecomputing resources in the process of handling network packets. We propose our optimized-Apriori algorithm which cangreatly improves the algorithm efficiency by means of reducing the data storage space and the number of frequent itemsets. We take full advantage of the characteristics of sparse matrix to save storage space and shorten the running time. Theexperimental results show that our optimized-Apriori algorithm can make a larger progress in saving the storage space ofnetwork data to be processed, even shortening nearly half of the data mining time in the process of intrusion detection.