{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T00:36:45Z","timestamp":1778373405010,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819538294","type":"print"},{"value":"9789819538300","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-3830-0_8","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:08:36Z","timestamp":1767319716000},"page":"117-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["RADIO: Effective and\u00a0Efficient Anomalous Subgraph Discovery in\u00a0Financial Networks"],"prefix":"10.1007","author":[{"given":"Xiaolin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yikun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyun","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuequn","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"8_CR1","unstructured":"Benford, F.: The law of anomalous numbers. Proc. Am. Philos. Soc., 551\u2013572 (1938)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chen, T., Tsourakakis, C.: AntiBenford subgraphs: unsupervised anomaly detection in financial networks. In: SIGKDD, pp. 2762\u20132770 (2022)","DOI":"10.1145\/3534678.3539100"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Danisch, M., Chan, T.H.H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: WWW, pp. 233\u2013242 (2017)","DOI":"10.1145\/3038912.3052619"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V., Lin, X.: Efficient algorithms for densest subgraph discovery. PVLDB (2019)","DOI":"10.14778\/3342263.3342645"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Han, X., Cheng, R., Grubenmann, T., et\u00a0al.: Leveraging contextual graphs for stochastic weight completion in sparse road networks. In: SIAM SDM (2022)","DOI":"10.1137\/1.9781611977172.8"},{"issue":"7","key":"8_CR7","first-page":"1493","volume":"15","author":"X Han","year":"2022","unstructured":"Han, X., Cheng, R., Ma, C., Grubenmann, T.: DeepTEA: effective and efficient online time-dependent trajectory outlier detection. VLDB 15(7), 1493\u20131505 (2022)","journal-title":"VLDB"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Han, X., Grubenmann, T., Cheng, R., Wong, S.C., Li, X., Sun, W.: Traffic incident detection: a trajectory-based approach. In: ICDE, pp. 1866\u20131869. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00190"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Han, X., Grubenmann, T., Ma, C., et\u00a0al.: FDM: effective and efficient incident detection on sparse trajectory data. Inf. Syst., 102418 (2024)","DOI":"10.1016\/j.is.2024.102418"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lee, M.C., et al.: AutoAudit: mining accounting and time-evolving graphs. In: Big Data (2020)","DOI":"10.1109\/BigData50022.2020.9378346"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: FlowScope: spotting money laundering based on graphs. In: AAAI, vol.\u00a034 (2020)","DOI":"10.1609\/aaai.v34i04.5906"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Liu, S., Hooi, B., Faloutsos, C.: HoloScope: topology-and-spike aware fraud detection. In: CIKM, pp. 1539\u20131548 (2017)","DOI":"10.1145\/3132847.3133018"},{"key":"8_CR14","unstructured":"Liu, Y., Ding, K., Lu, Q., Li, F., Zhang, L.Y., Pan, S.: Towards self-interpretable graph-level anomaly detection. In: NeurIPS, vol. 36 (2024)"},{"key":"8_CR15","unstructured":"Lou, Z., You, J., et\u00a0al.: Neural subgraph matching. arXiv preprint arXiv:2007.03092 (2020)"},{"issue":"11","key":"8_CR16","first-page":"2719","volume":"15","author":"C Ma","year":"2022","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V., Han, X.: Finding locally densest subgraphs: a convex programming approach. VLDB 15(11), 2719\u20132732 (2022)","journal-title":"VLDB"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Han, X.: A convex-programming approach for efficient directed densest subgraph discovery. In: SIGMOD (2022)","DOI":"10.1145\/3514221.3517837"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., et\u00a0al.: Efficient algorithms for densest subgraph discovery on large directed graphs. In: SIGMOD (2020)","DOI":"10.1145\/3318464.3389697"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., et\u00a0al.: Accelerating directed densest subgraph queries with software and hardware approaches. VLDBJ 33(1) (2024)","DOI":"10.1007\/s00778-023-00805-0"},{"key":"8_CR20","unstructured":"McDaid, A.F., Greene, D., Hurley, N.: Normalized mutual information to evaluate overlapping community finding algorithms. arXiv preprint arXiv:1110.2515 (2011)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043) (2005)","DOI":"10.1038\/nature03607"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Prakash, B.A., Sridharan, A., et\u00a0al.: EigenSpokes: surprising patterns and scalable community chipping in large graphs. In: PAKDD, pp. 435\u2013448 (2010)","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-86514-6_11","volume-title":"Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track","author":"M Starnini","year":"2021","unstructured":"Starnini, M., et al.: Smurf-based anti-money laundering in time-evolving transaction networks. In: Dong, Y., Kourtellis, N., Hammer, B., Lozano, J.A. (eds.) ECML PKDD 2021. LNCS (LNAI), vol. 12978, pp. 171\u2013186. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86514-6_11"},{"key":"8_CR24","unstructured":"Sun, F.Y., Qu, M., Hoffmann, J., Huang, C.W., et\u00a0al.: vGraph: a generative model for joint community detection and node representation learning. In: NeurIPS (2019)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al.: Collaborative deep learning improves disease-related circrna prediction based on multi-source functional information. Briefings Bioinf. 24(2), bbad069 (2023)","DOI":"10.1093\/bib\/bbad069"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Wang, Y., Shen, W., Shen, Y., Feng, S., Wang, T., et\u00a0al.: Integrative graph-based framework for predicting circRNA drug resistance using disease contextualization and deep learning. IEEE J. Biomed. Health Inf. (2024)","DOI":"10.1109\/JBHI.2024.3457271"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Wu, J., Lin, D., Fu, Q., et\u00a0al.: Toward understanding asset flows in crypto money laundering through the lenses of Ethereum heists. TIFS 19 (2024)","DOI":"10.1109\/TIFS.2023.3346276"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Wu, X., et al.: CLARE: a semi-supervised community detection algorithm. In: SIGKDD (2022)","DOI":"10.1145\/3534678.3539370"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: WSDM, pp. 587\u2013596 (2013)","DOI":"10.1145\/2433396.2433471"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Xiong, Y., Ye, Y., et\u00a0al.: SEAL: learning heuristics for community detection with generative adversarial networks. In: SIGKDD, pp. 1103\u20131113 (2020)","DOI":"10.1145\/3394486.3403154"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Zhao, L.: Unsupervised deep subgraph anomaly detection. In: 2022 IEEE International Conference on Data Mining (ICDM), pp. 753\u2013762 (2022)","DOI":"10.1109\/ICDM54844.2022.00086"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, C., Chen, H., Wu, H., Zhang, J., Cai, W.: ARTEMIS: detecting airdrop hunters in NFT markets with a graph learning system. In: WWW, pp. 1824\u20131834 (2024)","DOI":"10.1145\/3589334.3645597"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Zhuang, Z., Ting, K.M., Pang, G., Song, S.: Subgraph centralization: a necessary step for graph anomaly detection. In: SIAM SDM, pp. 703\u2013711. SIAM (2023)","DOI":"10.1137\/1.9781611977653.ch79"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3830-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:08:40Z","timestamp":1767319720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3830-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819538294","9789819538300"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3830-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}