English

Heterogeneous Graph Matching Networks

Cryptography and Security 2019-10-21 v1 Machine Learning Machine Learning

Abstract

Information systems have widely been the target of malware attacks. Traditional signature-based malicious program detection algorithms can only detect known malware and are prone to evasion techniques such as binary obfuscation, while behavior-based approaches highly rely on the malware training samples and incur prohibitively high training cost. To address the limitations of existing techniques, we propose MatchGNet, a heterogeneous Graph Matching Network model to learn the graph representation and similarity metric simultaneously based on the invariant graph modeling of the program's execution behaviors. We conduct a systematic evaluation of our model and show that it is accurate in detecting malicious program behavior and can help detect malware attacks with less false positives. MatchGNet outperforms the state-of-the-art algorithms in malware detection by generating 50% less false positives while keeping zero false negatives.

Keywords

Cite

@article{arxiv.1910.08074,
  title  = {Heterogeneous Graph Matching Networks},
  author = {Shen Wang and Zhengzhang Chen and Xiao Yu and Ding Li and Jingchao Ni and Lu-An Tang and Jiaping Gui and Zhichun Li and Haifeng Chen and Philip S. Yu},
  journal= {arXiv preprint arXiv:1910.08074},
  year   = {2019}
}
R2 v1 2026-06-23T11:47:05.055Z