Computer evidence analysis technology based on weighted frequent pattern growth algorithm

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The current analysis of computer forensics is still dependent on the investigation personnel, leading to the problem of heavy workload and low efficiency. At the same time, computer evidences have the characteristics of complex structure and large amount of data, which is prone to the problem of association rules redundancy. In order to improve the efficiency of computer evidence analysis, this paper uses association analysis technology to analyze the user's behavior habits from the obtained computer system log, browser records, file operation traces and other information; combined with the idea of weighted features, the weight set was generated according to the difference of attribute importance, and the Frequent Pattern Growth (FP-Growth) algorithm is improved. The experimental results show that the improved FP-Growth algorithm can effectively remove the redundant rules in evidence analysis, and is more practical for user behavior analysis.

Cite

CITATION STYLE

APA

Xue, T., Li, Q., Zhang, P., Chen, Z., Feng, P., & Luo, N. (2019). Computer evidence analysis technology based on weighted frequent pattern growth algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11634 LNCS, pp. 430–441). Springer Verlag. https://doi.org/10.1007/978-3-030-24271-8_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free