{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:27:10Z","timestamp":1759336030304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030855284"},{"type":"electronic","value":"9783030855291"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85529-1_22","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T23:04:55Z","timestamp":1632092695000},"page":"273-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["MEDICI: A Simple to Use Synthetic Social Network Data Generator"],"prefix":"10.1007","author":[{"given":"David F.","family":"Nettleton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Nettleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc Canal i","family":"Farriol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Nettleton, D.F.: Data mining of social networks represented as graphs. Comput. Sci. Rev. 7, 1\u201334 (2013)","DOI":"10.1016\/j.cosrev.2012.12.001"},{"key":"22_CR2","unstructured":"The ethics of Big Data: Balancing economic benefits and ethical questions of Big Data in the EU policy context\u201d, Study of the European Economic and Social Committee (2017), Published by: \u201cVisits and Publications\u201d Unit EESC-2017\u201341-EN (2017)"},{"key":"22_CR3","first-page":"849","volume":"40","author":"N Newman","year":"2013","unstructured":"Newman, N.: The costs of lost privacy: consumer harm and rising economic inequality in the age of Google. Wm. Mitchell L. Rev. 40, 849 (2013)","journal-title":"Wm. Mitchell L. Rev."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-020-15871-z","volume":"11","author":"N Toma\u0161ev","year":"2020","unstructured":"Toma\u0161ev, N., et al.: AI for social good: unlocking the opportunity for positive impact. Nat. Commun. 11(1), 1\u20136 (2020)","journal-title":"Nat. Commun."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Park, H., Kim, M.S.: TrillionG: a trillion-scale synthetic graph generator using a recursive vector model. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 913\u2013928, May 2017","DOI":"10.1145\/3035918.3064014"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Samsi, S., et al.: Static graph challenge: Subgraph isomorphism. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20136. IEEE, September 2017","DOI":"10.1109\/HPEC.2017.8091039"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Angles, R., Paredes, R., & Garc\u00eda, R. (2020). R3MAT: A Rapid and Robust Graph Generator. IEEE Access, 8, 130048\u2013130065","DOI":"10.1109\/ACCESS.2020.3009577"},{"key":"22_CR8","first-page":"5609","volume":"30","author":"Z Feng","year":"2020","unstructured":"Feng, Z., et al.: A schema-driven synthetic knowledge graph generation approach with extended graph differential dependencies (GDDxs). IEEE Access. 30, 5609 (2020)","journal-title":"IEEE Access."},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Ros\u00e9s, H., Seb\u00e9, F.: Synthetic generation of social network data with endorsements. J. Simul. 9, 279 (2014). https:\/\/doi.org\/10.1057\/jos.2014.29","DOI":"10.1057\/jos.2014.29"},{"key":"22_CR10","unstructured":"Ali, A.M., Alvari, H., Hajibagheri, A., Lakkaraj, K., Sukthankar, G.: Synthetic generators for cloning social network data. In: Proceedings SocInfo 2014 (2014)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., et al.: Generation and analysis of large synthetic social contact networks. In: Proceedings of the 2009 Winter Simulation Conference, 13\u201316 December 2009, pp.1003\u20131014 (2009)","DOI":"10.1109\/WSC.2009.5429425"},{"key":"22_CR12","unstructured":"Boncz, P., et al.: Benchmark Design for Navigational Pattern Matching Benchmarking. LDBC Cooperative Project FP7 \u2013 317548. Coordinators: Arnau Prat, Alex Averbuch. Issue 3 28\/09\/2014 (2014)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1086\/427322","volume":"110","author":"G Robins","year":"2005","unstructured":"Robins, G., Pattison, P., Woolcock, J.: Small and other worlds: global network structures from local processes. Am. J. Sociol. (AJS) 110(4), 894\u2013936 (2005)","journal-title":"Am. J. Sociol. (AJS)"},{"key":"22_CR14","unstructured":"Nettleton, D.F.: Generating synthetic online social network graph data and topologies. In: 3rd Workshop on Graph-based Tech. & Apps, UPC, Barcelona, Spain, March 2015"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0352-y","volume":"6","author":"DF Nettleton","year":"2016","unstructured":"Nettleton, D.F.: A synthetic data generator for online social network graphs. Soc. Netw. Anal. Min. 6(1), 1\u201333 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0352-y","journal-title":"Soc. Netw. Anal. Min."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.eswa.2016.02.004","volume":"55","author":"DF Nettleton","year":"2016","unstructured":"Nettleton, D.F., Salas, J.: A data driven anonymization system for information rich online social network graphs. Expert Syst. Appl. 55, 87\u2013105 (2016)","journal-title":"Expert Syst. Appl."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Nettleton, D.F., Nettleton, S., Canal i Farriol,, M. (2021). MEDICI: A simple to use synthetic social network data generator. arXiv preprint arXiv:2101.01956","DOI":"10.1007\/978-3-030-85529-1_22"},{"key":"22_CR18","unstructured":"Nettleton, D.F.: Social Network Synthetic Data Generator [Source code, Git repository] (2021). https:\/\/github.com\/dnettlet\/MEDICI"},{"issue":"12","key":"22_CR19","doi-asserted-by":"publisher","first-page":"2364","DOI":"10.1002\/int.22034","volume":"33","author":"V Torra","year":"2018","unstructured":"Torra, V., Jonsson, A., Navarro-Arribas, G., Salas, J.: Synthetic generation of spatial graphs. Int. J. Intell. Syst. 33(12), 2364\u20132378 (2018)","journal-title":"Int. J. Intell. Syst."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C., R-MAT: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp. 442\u2013446 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebure, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Experiment 10, 1000 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks, Phys. Rev. E 69, 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TNSE.2015.2391998","volume":"1","author":"R Lambiotte","year":"2015","unstructured":"Lambiotte, R., Delvenne, J.-C., Barahona, M.: Laplacian dynamics and multiscale modular structure in networks. IEEE Trans. Network Sci. Eng. 1(2), 76\u201390 (2015)","journal-title":"IEEE Trans. Network Sci. Eng."},{"key":"22_CR24","unstructured":"Canal i Farriol, M.: Interf\u00edcie d'usuari per a una aplicaci\u00f3 de generaci\u00f3 de dades sint\u00e8tiques per a xarxes socials, Final year undergraduate project, DTIC, Universitat Pompeu Fabra (2019)"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: Proceedings 3rd International AAAI Conference on Weblogs and Social Media, pp. 361\u2013362 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85529-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:20:56Z","timestamp":1710357656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85529-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030855284","9783030855291"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85529-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MDAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Modeling Decisions for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mdai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mdai.cat\/mdai2021\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"None","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually. There were also 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}