An anomalies detection method based on considering both the global and the local perspectives is proposed to solve the low accuracy problem in traditional anomalies detection
and is successfully applied to outlier detection in transaction graph data sets. The method evaluates the similarity between any two graphs based on maximum common frequent subgraph
and then cuts out the similarity matrix based on common neighbor. The round-trip distance for a data node is calculated and is used as its anomalies score
that makes up the defect of traditional outlier detection methods based on the steady-state distribution and random walk. Experiments in real datasets show that the performance of the proposed method is better than the performance of the method based on subdue. The precision
the recall rate and the false alarm rate are improved by about 10%.
关键词
Keywords
references
HAN Jiawei. Data mining: concepts and technology[M]. 3rd ed. San Francisco, CA, USA: Morgan Kaufmann, 2012.
YU Hao, WANG Bin, XIAO Gang, et al. Distance-based outlier detection on uncertain data[J]. Journal of Computer Research and Development, 2010, 47(3): 474-484.
HASSANZADEH R, NAYAK R. A semi-supervised graph-based algorithm for detecting outliers in online-social-networks[C]∥Proceedings of the 28th Annual ACM Symposium on Applied Computing. New York, USA: ACM, 2013: 577-582.
MOONESINGHE H, TAN P N. Outrank: a graph-based outlier detection framework using random walk[J]. International Journal on Artificial Intelligence Tools, 2008, 17(1): 19-36.
EGOZI A, KELLER Y, GUTERMAN H. A probabilistic approach to spectral graph matching[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(1): 18-27.
AKOGLU L, MCGLOHON M, FALOUTSOS C. Oddball: spotting anomalies in weighted graphs[J]. Lecture Notes in Computer Science, 2010, 6119: 410-421.
MULLER E, SANCHEZ P I, MULLE Y, et al. Ranking outlier nodes in subspaces of attributed graphs[C]∥Proceedings of the 2013 IEEE 29th International Conference on Data Engineering Workshops. Piscataway, NJ, USA: IEEE, 2013: 216-222.
GUO Yanrong, WU Guorong, JIANG Jianguo, et al. Robust anatomical correspondence detection by hierarchical sparse graph matching[J]. IEEE Transactions on Medical Imaging, 2013, 32(2): 268-277.
GUPTA M, GAO Jing, SUN Yizhou, et al. Integrating community matching and outlier detection for mining evolutionary community outliers[C]∥Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM, 2012: 859-867.
杨茂林. 离群检测算法研究[D]. 武汉: 华中科技大学, 2012.
AGGARWAL C C, ZHAO Yuchen, YU P S. Outlier detection in graph streams[C]∥Proceedings of the 2011 IEEE 27th International Conference on Data Engineering. Piscataway, NJ, USA: IEEE, 2011: 399-409.
CAO Lijun, LIU Xiyin, WANG Zhiping, et al. The spatial outlier mining algorithm based on the KNN graph[J]. Journal of Software, 2013, 8(12): 3158-3165.
YAN Sifeng, HAN Jiawei. Span: graph-based subs-tructure pattern mining[C]∥Proceedings of the 2002 IEEE International Conference on Data Mining. Piscataway, NJ, USA: IEEE, 2002: 721-724.
NOBLE C C, COOK D J. Graph-based anomaly detection[C]∥Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM, 2003: 631-636.