Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5992
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJena, Krishna Priyadarsini-
dc.contributor.authorRajneekant-
dc.contributor.authorMohapatra, Ramesh Kumar-
dc.contributor.authorMohapatra, Durga Prasad-
dc.date.accessioned2026-11-11T04:53:52Z-
dc.date.available2026-11-11T04:53:52Z-
dc.date.issued2026-10-
dc.identifier.citationInternational Conference on Emerging Digital Intelligence and Generative Engineering, VIT Bhopal University, 30-31 October 2026en_US
dc.identifier.urihttp://hdl.handle.net/2080/5992-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractMalware family classification from dynamic analysis traces remains challenging because most existing approaches represent sandbox behavior as a flat API-call sequence or an aggregated feature vector, limiting their ability to capture the relationships among API calls. In this work, we present a graph-based framework for malware family classification from dynamic behavioral analysis. Each malware execution report generated by the CAPEv2 sandbox is modeled as a directed behavioral API multigraph, where nodes represent unique API names and edges preserve the corresponding call arguments, semantic category, and execution status. The graphs are classified using an edge-aware graph neural network with edge-aware message passing, graph attention, residual connections, and dual mean–max pooling. Focal loss, class-balanced weighting, and post-hoc threshold calibration are used to address severe class imbalance. Evaluated on the public Avast-CTU CAPEv2 dataset containing 48,976 samples from ten malware families under a temporal evaluation protocol, the proposed model achieves a macro-F1 score of 94.04% as a single model and 95.25% as a five-model ensemble.The proposed model significantly outperforms four non-graph baselines and achieves the highest macro-F1 among two existing graph-based malware classifiers evaluated under a common experimental protocol. A controlled comparison across five graph convolution operators and a component ablation study show that performance depends more on the overall framework than on the specific graph convolution operator, and that hand-crafted graph-level statistics are largely unnecessary. The interpretability analysis further shows that the remaining classification errors mainly arise from behavioral overlap among credential-stealing malware families.en_US
dc.subjectMalware family classificationen_US
dc.subjectraph neural networksen_US
dc.subjectdynamic analysisen_US
dc.subjectbehavioral API multigraphsen_US
dc.subjectclass imbalanceen_US
dc.subjectinterpretabilityen_US
dc.titleMalware Family Classification from Behavioral API Multigraphs Using Edge-Aware Graph Neural Networksen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2026_ICEDIG_KPJena_Malware.pdf566.1 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.