Evaluate Nodes Importance in Directed Network Using Topological Potential

Mining concernful nodes in large network is a basic and important work in the research of complex network.There are some classic algorithms for ranking nodes in directed network. This paper provides a ranking algorithm based on topological structure.By defining and computing the topological potentia...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Information Engineering and Computer Science pp. 1 - 4
Main Authors Teng Wang, Yanni Han, Jie Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Artificial neural networks
Complex networks
Data mining
Entropy
Social network services
Topology
Online AccessGet full text

Cover

More Information
Summary:Mining concernful nodes in large network is a basic and important work in the research of complex network.There are some classic algorithms for ranking nodes in directed network. This paper provides a ranking algorithm based on topological structure.By defining and computing the topological potential score for each node,we can obtain a more accurate global ranking which can reflect nodes importance in the network.We also demonstrate the algorithm with using a real-world network.According to the experiment result,this method provides a general framework for some classic ranking measures. Furthermore,by optimizing influence factor,it can also reveal the position differences in network structure.
ISBN:1424479398
9781424479399
ISSN:2156-7379
DOI:10.1109/ICIECS.2010.5677747