Email Network Important Nodes Mining Based on Core Number and PageRank

Abstract

Mining important persons is significant to network security and computer forensics nowadays in researches on email network centralization. Traditional PageRank algorithm is prone to be affected by interferential nodes because it distributes PR values evenly. This paper proposes a method which decomposes email network into different layers based on the core number, eliminates the interferential nodes in outer layers to decrease impact of interferential nodes and complexity of following procedure. Besides, it proposes an improved PageRank algorithm which partially solves the bias problem on nodes’ weighting, ranks the nodes quantitatively. The experiments indicate that it improves the accuracy and reduces the computational complexity in mining important nodes from email network.