作者: Veronique Van Vlasselaer , Leman Akoglu , Tina Eliassi-Rad , Monique Snoeck , Bart Baesens
关键词:
摘要: Given a labeled graph containing fraudulent and legitimate nodes, which nodes group together? How can we use the riskiness of node groups to infer future label for new members group? This paper focuses on social security fraud where companies are linked resources they share. The primary goal in is detect that intentionally fail pay their contributions government. We aim by (1) propagating time-dependent exposure score each based its relationships known network, (2) deriving cliques resources, labeling these terms bankruptcy involvement, (3) characterizing company using combination intrinsic relational features membership suspicious cliques. show clique-based boost performance traditional models.