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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
