• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Guo Fangfang, Wang Xinyue, Wang Huiqiang, Lü Hongwu, Hu Yibing, Wu Fang, Feng Guangsheng, Zhao Qian. A Dynamic Stain Analysis Method on Maximal Frequent Sub Graph Mining[J]. Journal of Computer Research and Development, 2020, 57(3): 631-638. DOI: 10.7544/issn1000-1239.2020.20180846
Citation: Guo Fangfang, Wang Xinyue, Wang Huiqiang, Lü Hongwu, Hu Yibing, Wu Fang, Feng Guangsheng, Zhao Qian. A Dynamic Stain Analysis Method on Maximal Frequent Sub Graph Mining[J]. Journal of Computer Research and Development, 2020, 57(3): 631-638. DOI: 10.7544/issn1000-1239.2020.20180846

A Dynamic Stain Analysis Method on Maximal Frequent Sub Graph Mining

Funds: This work was supported by the National Natural Science Foundation of China (61502118), the Natural Science Foundation of Heilongjiang Province of China (F2016028), the Fundamental Research Funds for the Central Universities (HEUCF180602, HEUCFM180604), and the Major National Science and Technology Program (2016ZX03001023-005).
More Information
  • Published Date: February 29, 2020
  • The malicious code recognition method on traditional dynamic stain analysis technology has many problems such as huge number of malicious code behavior dependency graphs (MBDG) and long time of matching process.According to the common characteristics of each malicious code family, the behavior dependency graph is represented by some common sub graph parts. Therefore, this paper proposes a malicious code behavior dependency graph mining method based on maximum frequent sub graphs. The method mines the largest frequent sub graphs which can represent the significant common features of the family from the malicious code family behavior dependency graph. The maximum frequent sub graph that is mined can represent the most significant common feature among the variants of this type of malicious code. The target behavior dependency graph just needs to be matched with the largest frequent sub graph after mining.Besides, the method reduces the number of behavior dependency graphs and improves the recognition efficiency without losing the characteristics of malicious code behavior. Compared with the traditional dynamic stain analysis method for malicious code recognition, when the minimum support is 0.045, the number of behavior dependency graphs decreases by 82%, the recognition efficiency increases by 81.7%, and the accuracy rate is 92.15%.
  • Related Articles

    [1]Wu Wanqing, Zhao Yongxin, Wang Qiao, Di Chaofan. A Safe Storage and Release Method of Trajectory Data Satisfying Differential Privacy[J]. Journal of Computer Research and Development, 2021, 58(11): 2430-2443. DOI: 10.7544/issn1000-1239.2021.20210589
    [2]Wang Bin, Zhang Lei, Zhang Guoyin. A Gradual Sensitive Indistinguishable Based Location Privacy Protection Scheme[J]. Journal of Computer Research and Development, 2020, 57(3): 616-630. DOI: 10.7544/issn1000-1239.2020.20190086
    [3]Zhang Yuxuan, Wei Jianghong, Li Ji, Liu Wenfen, Hu Xuexian. Graph Degree Histogram Publication Method with Node-Differential Privacy[J]. Journal of Computer Research and Development, 2019, 56(3): 508-520. DOI: 10.7544/issn1000-1239.2019.20170886
    [4]Tang Benxiao, Wang Lina, Wang Run, Zhao Lei, Wang Danlei. A Defensive Method Against Android Physical Sensor-Based Side-Channel Attack Based on Differential Privacy[J]. Journal of Computer Research and Development, 2018, 55(7): 1371-1392. DOI: 10.7544/issn1000-1239.2018.20170982
    [5]Zhu Weijun, You Qingguang, Yang Weidong, Zhou Qinglei. Trajectory Privacy Preserving Based on Statistical Differential Privacy[J]. Journal of Computer Research and Development, 2017, 54(12): 2825-2832. DOI: 10.7544/issn1000-1239.2017.20160647
    [6]He Ming, Chang Mengmeng, Wu Xiaofei. A Collaborative Filtering Recommendation Method Based on Differential Privacy[J]. Journal of Computer Research and Development, 2017, 54(7): 1439-1451. DOI: 10.7544/issn1000-1239.2017.20160207
    [7]Huang Longxia, Zhang Gongxuan, Fu Anmin. Privacy-Preserving Public Auditing for Dynamic Group Based on Hierarchical Tree[J]. Journal of Computer Research and Development, 2016, 53(10): 2334-2342. DOI: 10.7544/issn1000-1239.2016.20160429
    [8]Zhang Xiaojian, Wang Miao, Meng Xiaofeng. An Accurate Method for Mining top-k Frequent Pattern Under Differential Privacy[J]. Journal of Computer Research and Development, 2014, 51(1): 104-114.
    [9]Zhang Kun and Zhu Yangyong. Sequence Pattern Mining Without Duplicate Project Database Scan[J]. Journal of Computer Research and Development, 2007, 44(1): 126-132.
    [10]Ge Weiping, Wang Wei, Zhou Haofeng, and Shi Baile. Privacy Preserving Classification Mining[J]. Journal of Computer Research and Development, 2006, 43(1): 39-45.

Catalog

    Article views (1031) PDF downloads (232) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return