{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:28:14Z","timestamp":1744086494396,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336836"},{"type":"electronic","value":"9783642336843"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33684-3_4","type":"book-chapter","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T08:02:55Z","timestamp":1347264175000},"page":"60-76","source":"Crossref","is-referenced-by-count":5,"title":["Mining Dense Structures to Uncover Anomalous Behaviour in Financial Network Data"],"prefix":"10.1007","author":[{"given":"Ursula","family":"Redmond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Harrigan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e1draig","family":"Cunningham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.eswa.2010.07.143","volume":"38","author":"L. Subelj","year":"2011","unstructured":"Subelj, L., Furlan, S., Bajec, M.: An expert system for detecting automobile insurance fraud using social network analysis. Expert Systems with Applications\u00a038(1), 1039\u20131052 (2011)","journal-title":"Expert Systems with Applications"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Wan-Shiou Yang, S.Y.H.: A process-mining framework for the detection of healthcare fraud and abuse. Expert Syst. Appl., 56\u201368 (2006)","DOI":"10.1016\/j.eswa.2005.09.003"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ratkiewicz, J., Conover, M., Meiss, M., Gon\u00e7alves, B., Patil, S., Flammini, A., Menczer, F.: Truthy: mapping the spread of astroturf in microblog streams. In: Proceedings of the 20th International Conference Companion on World Wide Web (WWW 2011), pp. 249\u2013252. ACM (2011)","DOI":"10.1145\/1963192.1963301"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.socnet.2006.05.001","volume":"29","author":"C. Morselli","year":"2007","unstructured":"Morselli, C., Gigu\u00e8re, C., Petit, K.: The efficiency\/security trade-off in criminal networks. Social Networks\u00a029(1), 143\u2013153 (2007)","journal-title":"Social Networks"},{"key":"4_CR6","unstructured":"Reuter, P., Truman, E.M.: Chasing Dirty Money: The Fight Against Money Laundering. Peterson Institute (2004)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44816-0_11","volume-title":"Advances in Intelligent Data Analysis","author":"C. Cortes","year":"2001","unstructured":"Cortes, C., Pregibon, D., Volinsky, C.: Communities of Interest. In: Hoffmann, F., Adams, N., Fisher, D., Guimar\u00e3es, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol.\u00a02189, pp. 105\u2013114. Springer, Heidelberg (2001)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"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 (2007)","DOI":"10.1145\/1242572.1242600"},{"issue":"3-5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community Detection in Graphs. Physics Reports\u00a0486(3-5), 75\u2013174 (2010)","journal-title":"Physics Reports"},{"issue":"9","key":"4_CR10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1971","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: Finding All Cliques of an Undirected Graph. Communications of the ACM\u00a016(9), 575\u2013577 (1971)","journal-title":"Communications of the ACM"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S. Seidman","year":"1978","unstructured":"Seidman, S., Foster, B.: A Graph-Theoretic Generalization of the Clique Concept. Journal of Mathematical Sociology\u00a06, 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S. Seidman","year":"1983","unstructured":"Seidman, S.: Network Structure and Minimum Degree. Social Networks\u00a05(3), 269\u2013287 (1983)","journal-title":"Social Networks"},{"issue":"4","key":"4_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J. Cohen","year":"2009","unstructured":"Cohen, J.: Graph Twiddling in a MapReduce World. IEEE Computing in Science & Engineering\u00a011(4), 29\u201341 (2009)","journal-title":"IEEE Computing in Science & Engineering"},{"key":"4_CR14","unstructured":"Cohen, J.: Trusses: Cohesive Subgraphs for Social Network Analysis. Technical report, National Security Agency (2008)"},{"key":"4_CR15","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. CoRR abs\/1108.1780 (2011)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., Shimony, S.E.: Computing Frequent Graph Patterns from Semistructured Data. In: Proceedings of the International Conference on Data Minning, pp. 458\u2013465 (2002)","DOI":"10.1109\/ICDM.2002.1183988"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Grew: A Scalable Frequent Subgraph Discovery Algorithm. In: Proceedings of the IEEE International Conference on Data Mining (2004)","DOI":"10.21236\/ADA439436"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. Data Mining and Knowledge Discovery\u00a011, 243\u2013271 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph Indexing: A Frequent Structure-Based Approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-Index: Towards Verification-Free Query Processing on Graph Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Xiong, L., Liu, L.: A reputation-based trust model for peer-to-peer ecommerce communities. In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 228\u2013229. ACM (2003)","DOI":"10.1145\/779928.779972"},{"key":"4_CR22","unstructured":"Python Software Foundation: Python (2012), http:\/\/www.python.org"},{"key":"4_CR23","unstructured":"NetworkX Developers: NetworkX (2010), networkx.lanl.gov"},{"key":"4_CR24","unstructured":"Hunter, J., Dale D., Droettboom M.: matplotlib (2011), matplotlib.sourceforge.net"},{"key":"4_CR25","unstructured":"Gephi: Gephi (2012), gephi.org"},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/bioinformatics\/btl633","volume":"23","author":"I. Rivals","year":"2007","unstructured":"Rivals, I., Personnaz, L., Taing, L., Potier, M.: Enrichment or depletion of a GO category within a class of genes: which test? Bioinformatics\u00a023(4), 401\u2013407 (2007)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Modeling and Mining Ubiquitous Social Media"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33684-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T02:17:13Z","timestamp":1744078633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33684-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336836","9783642336843"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33684-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}