INGC: Graph Clustering Outlier Detection Algorithm Using Label Propagation

摘要

In the last decade, the size of data have increased at tremendous rate. To extract knowledgeable insights from this huge amount of data, data mining has to be done. To get the useful insights the connection in between data is sometimes of high interest. This connection can be efficiently represented as graphs. It provides an influential way to provide efficient illustrations for many applications spanning from biological networks, social networks to web networks. Graph mining techniques such as clustering and outlier detection can be beneficial in gathering the useful information. In this paper, an efficient influence based graph clustering and outlier detection algorithm (INGC) is proposed based on label propagation. The proposed algorithm improves the performance of the traditional Label Propagation algorithm by making it more robust. The proposed INGC saves time by labeling only high influential vertices of network. Further the labels are propagated among the rest of the nodes of network. And, the nodes with same vertex label are gathered to form a cluster. The vertices to which no label has been assigned during clustering are identified as outliers. Experiments were carried out on three real life graph datasets. It is shown that the proposed INGC outperforms the state-of art clustering algorithms in terms of F-Measure and Modularity. INGC also proved to be efficient in terms of detection rate of outliers.