Two Step graph-based semi-supervised Learning for Online Auction Fraud Detection
We analyze a social graph of online auction users and propose an online auction fraud detection approach. In this paper, fraudsters are those who participate in their own auction in order to drive up the final price. They tend to frequently bid in auctions hosted by fraudulent sellers, who work in the same collusion group. Our graph-based semi-supervised learning approach for online auction fraud detection is based on this social interaction of fraudsters. Auction users and their transactions are represented as a social interaction graph. Given a small set of known fraudsters, our aim was to detect more fraudsters based on the hypothesis that strong edges between fraudsters frequently exist in online auction social graphs. Detecting fraudsters who work in collusion with known fraudsters was our primary goal. We also found that weighted degree centrality is a distinct feature that separates fraudsters and legitimate users. We actively used this fact to detect fraud. To this end, we extended the modified adsorption model by incorporating the weighted degree centrality of nodes. The results, from real world data, show that by integrating the weighted degree centrality to the model can significantly improve accuracy.
KeywordsOnline auction fraud detection Graph-based semi-supervised learning Weighted degree centrality
Unable to display preview. Download preview PDF.
- 2.Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Mining and Knowledge Discovery, 1–63 (2014)Google Scholar
- 3.Chapelle, O., Schölkopf, B., Zien, A.: Semi-supervised learning. MIT, Cambridge (2010) Google Scholar
- 5.Chau, D.H., Nachenberg, C., Wilhelm, J., Wright, A., Faloutsos, C.: Polonium: tera-scale graph mining and inference for malware detection. In: SIAM International Conference on Data Mining (SDM), pp. 131–142 (2011)Google Scholar
- 7.Järvelin, K., Kekäläinen, J.: IR evaluation methods for retrieving highly relevant documents. In: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2000, pp. 41–48. ACM, New York (2000)Google Scholar
- 9.McGlohon, M., Bay, S., Anderle, M.G., Steier, D.M., Faloutsos, C.: Snare: a link analytic system for graph labeling and risk detection. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 1265–1274. ACM, New York (2009)Google Scholar
- 10.Mislove, A., Viswanath, B., Gummadi, K.P., Druschel, P.: You are who you know: inferring user profiles in online social networks. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, WSDM 2010, pp. 251–260. ACM, New York (2010)Google Scholar
- 11.Pandit, S., Chau, D.H., Wang, S., Faloutsos, C.: Netprobe: a fast and scalable system for fraud detection in online auction networks. In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, pp. 201–210. ACM, New York (2007)Google Scholar
- 12.Rubin, S., Christodorescu, M., Ganapathy, V., Giffin, J.T., Kruger, L., Wang, H., Kidd, N.: An auctioning reputation system based on anomaly. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, pp. 270–279. ACM, New York (2005)Google Scholar
- 15.Talukdar, P.P., Pereira, F.: Experiments in graph-based semi-supervised learning methods for class-instance acquisition. In: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010, pp. 1473–1481. Association for Computational Linguistics (2010)Google Scholar
- 18.Vlasselaer, V.V., Akoglu, L., Eliassi-Rad, T., Snoeck, M., Baesens, B.: Guilt-by-constellation: fraud detection by suspicious clique memberships. In: 2015 48th Hawaii International Conference on System Sciences (HICSS), pp. 918–927 (2015)Google Scholar