Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms

Abstract

If several friends of Smith have committed petty thefts, what would you say about Smith? Most people would not be surprised if Smith is a hardened criminal. Guilt-by-association methods combine weak signals to derive stronger ones, and have been extensively used for anomaly detection and classification in numerous settings (e.g., accounting fraud, cyber-security, calling-card fraud). The focus of this paper is to compare and contrast several very successful, guilt-by-association methods: Random Walk with Restarts, SemiSupervised Learning, and Belief Propagation (BP). Our main contributions are two-fold: (a) theoretically, we prove that all the methods result in a similar matrix inversion problem; (b) for practical applications, we developed FaBP, a fast algorithm that yields 2× speedup, equal or higher accuracy than BP, and is guaranteed to converge. We demonstrate these benefits using synthetic and real datasets, including YahooWeb, one of the largest graphs ever studied with BP.

DOI: 10.1007/978-3-642-23783-6_16

10 Figures and Tables

0102020102011201220132014201520162017
Citations per Year

57 Citations

Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Koutra2011UnifyingGA, title={Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms}, author={Danai Koutra and Tai-You Ke and U. Kang and Duen Horng Chau and Hsing-Kuo Kenneth Pao and Christos Faloutsos}, booktitle={ECML/PKDD}, year={2011} }