By Topic

Identifying abnormal nodes in complex networks by using random walk measure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lilian Berton ; Institute of Mathematics and Computer Science, University of São Paulo, Av. Trabalhador São-carlense 400, Caixa Postal: 668, CEP: 13560-970, São Carlos, São Paulo, Brazil ; Jean Huertas ; Bilzã Araújo ; Liang Zhao

Identifying outlier nodes is an important task in complex network mining. In this paper, we analyze the problem of identifying outliers in a network structure and propose an outlier measure by using the random walk distance measure and the dissimilarity index between pairs of vertices. Our method determines a “view” to the whole network for each node and infers that outliers are those nodes whose views differ significantly from majority of the nodes. Usually, outlier is detected by applying a specific criteria, for example, the farthest ones from the central node. Consequently, only one type of outliers satisfying the predefined criteria can be determined. On the other hand, our method incorporates both local and global information of the network due to random walk feature and can give more general outlier detection results. We have applied the method to artificial and real networks and some interesting results have been obtained.

Published in:

IEEE Congress on Evolutionary Computation

Date of Conference:

18-23 July 2010