Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CEC.2010.5586015 | 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) |
Keywords | DocType | Citations |
data mining,indexation,collaboration,satisfiability,outlier detection,identification,indexes,complex network,markov processes,color,dissimilarity index,random walk,complex networks | Conference | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lilian Berton | 1 | 16 | 7.82 |
| Jean Huertas | 2 | 7 | 0.80 |
| Bilza Araujo | 3 | 0 | 0.68 |
| Liang Zhao | 4 | 123 | 14.85 |