Research Article
A Mobile Malware Detection Method Based on Malicious Subgraphs Mining
Algorithm 1
Edge-weighted matrix generation.
| | Input: Bipartite graph of adjacency nodes and the weight of all adjacency nodes. | | Repeat: | | Choose and , | | if ( or is not a virtual node) | | if () | | Calculate the weight of edge: | | | | Insert into the edge-weighted matrix | | else | | = 0 | | Insert into the edge-weighted matrix | | Until: Every edge is assigned a weight. | | Output: The edge-weighted matrix. |
|