Towards proximity pattern mining in large graphs
Arijit Khan, Xifeng Yan, Kun‐Lung Wu · 2010
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often ineffective to capture association existing in these applications, due to the complexity of isomorphism testing and the inelastic pattern definition.