A Novel Algorithm for Important Email Network Nodes Mining

DOI

10.2991/amsm-16.2016.11How to use a DOI?

Keywords

nodes mining; core number; PAGERANK

Abstract

Mining important persons is significant to network security, especially researches on email network centralization nowadays. To solve the problem that traditional PageRank algorithm is sensitive to the network disturbance, this paper proposes a method which decomposes email network into different layers based on the core number and eliminates the interferential nodes from outer layers. Besides, it improves PageRank algorithm which ranks the nodes quantitatively to find the important nodes. The experiments indicate that it improves the accuracy and reduces the computational complexity in mining important nodes from email network.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Junkai Yi
AU  - Zhirong Li
AU  - Xianghui Zhao
PY  - 2016/05
DA  - 2016/05
TI  - A Novel Algorithm for Important Email Network Nodes Mining
BT  - Proceedings of the 2016 International Conference on Applied Mathematics, Simulation and Modelling
PB  - Atlantis Press
SP  - 44
EP  - 48
SN  - 2352-538X
UR  - https://doi.org/10.2991/amsm-16.2016.11
DO  - 10.2991/amsm-16.2016.11
ID  - Yi2016/05
ER  -