{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T05:25:14Z","timestamp":1747459514851,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T00:00:00Z","timestamp":1531699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission","doi-asserted-by":"publisher","award":["14AZ23","C17014","ZZSDJ17021"],"award-info":[{"award-number":["14AZ23","C17014","ZZSDJ17021"]}],"id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702320"],"award-info":[{"award-number":["61702320"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11042-018-6405-7","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T01:36:05Z","timestamp":1531704965000},"page":"5989-6012","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Visualize classic play\u2019s composing patterns: a weighted motif mining framework"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0935-7757","authenticated-orcid":false,"given":"Jiandun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pin","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,16]]},"reference":[{"key":"6405_CR1","unstructured":"Alberich R, Miro-Julia J, Rossello F (2002) Marvel Universe looks almost like a real social network. arXiv preprint. https:\/\/arxiv.org\/abs\/cond-mat\/0202174 . Accessed 12 June 2015"},{"key":"6405_CR2","unstructured":"Ardanuy MC, Sporleder C (2014) Structure-based clustering of novels. Proc. of CLfL@EACL 2014, Association for Computational Linguistics 31\u201339"},{"key":"6405_CR3","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. Proc. of ICWSM 2009, Association for the Advancement of Artificial Intelligence 361\u2013362","DOI":"10.1609\/icwsm.v3i1.13937"},{"issue":"1","key":"6405_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"6405_CR5","unstructured":"Buitinck L, Louppe G, Blondel M, et al (2013) API design for machine learning software: experiences from the scikit-learn project. arXiv preprint. https:\/\/arxiv.org\/abs\/1309.0238 . Accessed 12 June 2015"},{"issue":"2","key":"6405_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.physa.2007.04.035","volume":"382","author":"YM Choi","year":"2007","unstructured":"Choi YM, Kim HJ (2007) A directed network of Greek and roman mythology. Physica A: Statistical Mechanics & Its Applications 382(2):665\u2013671","journal-title":"Physica A: Statistical Mechanics & Its Applications"},{"key":"6405_CR7","first-page":"1","volume":"2014","author":"M Condello","year":"2015","unstructured":"Condello M, Harrison R, Isasi J et al (2015) A methodology for character networks at the macro analytical level. Digital Humanity Forum 2014:1\u20134 http:\/\/idrh.ku.edu\/dhforum2014 . Accessed 12 June 2017","journal-title":"Digital Humanity Forum"},{"key":"6405_CR8","unstructured":"Elson D K, Dames N, Mckeown KR (2010) Extracting social networks from literary fiction. Proc. of ACL 2010, Association for Computational Linguistics 138\u2013147"},{"issue":"8","key":"6405_CR9","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to ROC analysis. Pattern Recogn Lett 27(8):861\u2013874","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"6405_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.patrec.2008.08.010","volume":"30","author":"C Ferri","year":"2009","unstructured":"Ferri C, Hern\u00e1ndez-Orallo J, Modroiu R (2009) An experimental comparison of performance measures for classification. Pattern Recogn Lett 30(1):27\u201338","journal-title":"Pattern Recogn Lett"},{"key":"6405_CR11","unstructured":"Gil S, Kuenzel L, Caroline S (2011) Extraction and analysis of character interaction networks from plays and movies, Stanford CS 224W Final Project Report. Accessed June 2015"},{"key":"6405_CR12","unstructured":"Holanda AJ, Matias M, Ferreira S, et al (2017) Character Networks and Book Genre Classification. arXiv preprint arXiv:1704.08197"},{"key":"6405_CR13","unstructured":"Hylton J (2011) The complete works of Shakespeare. Massachusetts Institute of Technology. http:\/\/shakespeare.mit.edu\/ . Accessed 12 June 2015"},{"issue":"3","key":"6405_CR14","first-page":"43","volume":"13","author":"HC Kwon","year":"2017","unstructured":"Kwon HC, Shim KH (2017) An improved method of character network analysis for literary criticism: a case study of < hamlet>. International Journal of Contents 13(3):43\u201348","journal-title":"International Journal of Contents"},{"key":"6405_CR15","unstructured":"Li JD (2017) The classic play parsing project. GitHub: https:\/\/github.com\/smellydog521\/classicPlayParsing\/"},{"key":"6405_CR16","doi-asserted-by":"crossref","unstructured":"Li J, Yang D, Ji C (2017) Mine weighted network motifs via Bayes' theorem. Proc. of ICSAI2017, IEEE 448\u2013452","DOI":"10.1109\/ICSAI.2017.8248334"},{"key":"6405_CR17","unstructured":"Mac P, Kenna R (2014) A quantitative approach to comparative mythology. Cosmos 1\u201322"},{"key":"6405_CR18","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S et al (2002) Network motifs: simple building blocks of complex networks. Science 298:824\u2013827","journal-title":"Science"},{"key":"6405_CR19","first-page":"80","volume":"68","author":"F Moretti","year":"2011","unstructured":"Moretti F (2011) Network theory, plot analysis. New Left Rev 68:80\u2013104","journal-title":"New Left Rev"},{"key":"6405_CR20","first-page":"103","volume":"84","author":"F Moretti","year":"2013","unstructured":"Moretti F (2013) 'Operationalizing' or, the function of measurement in literary theory. New Left Rev 84:103\u2013119","journal-title":"New Left Rev"},{"key":"6405_CR21","unstructured":"Moretti F (2017) Patterns and interpretation. Literary Lab in Stanford University 1\u201310"},{"key":"6405_CR22","doi-asserted-by":"crossref","unstructured":"M\u00fcngen AA, Kaya M (2017) Influence analysis of posts in social networks by using quad-motifs. Proc. of IDAP 2017, IEEE 1\u20135","DOI":"10.1109\/IDAP.2017.8090218"},{"key":"6405_CR23","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. Proc. of WSDM 2017, ACM 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"issue":"9","key":"6405_CR24","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.4304\/jcp.8.9.2442-2447","volume":"8","author":"GM Park","year":"2013","unstructured":"Park GM, Kim SH, Cho HG (2013) Structural analysis on social network constructed from characters in literature texts. Journal of Computers 8(9):2442\u20132447","journal-title":"Journal of Computers"},{"key":"6405_CR25","unstructured":"Pierson E (2014) Parsing is such sweet sorrow. Prezi.com . https:\/\/prezi.com\/gw5m3fbs82gv\/parsing-is-such-sweet-sorrow\/ . Accessed 12 June 2015"},{"issue":"03","key":"6405_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219525916500053","volume":"19","author":"SD Prado","year":"2016","unstructured":"Prado SD, Dahmen SR (2016) Temporal network analysis of literary texts. Advs Complex Syst 19(03):1\u201317","journal-title":"Advs Complex Syst"},{"key":"6405_CR27","unstructured":"Project Gutenberg Literary Archive Foundation (2015) Play scripts of Shaw and Ibsen. http:\/\/www.gutenberg.org . Accessed 12 June 2015"},{"issue":"3","key":"6405_CR28","first-page":"1","volume":"1","author":"J Rydberg-Cox","year":"2011","unstructured":"Rydberg-Cox J (2011) Social networks and the language of Greek tragedy. Journal of the Chicago Colloquium on Digital Humanities and Computer Science 1(3):1\u201311","journal-title":"Journal of the Chicago Colloquium on Digital Humanities and Computer Science"},{"issue":"1","key":"6405_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1556\/JCEP.3.2005.1.4","volume":"3","author":"J Stiller","year":"2005","unstructured":"Stiller J, Hudson M (2005) Weak links and scene cliques within the small world of Shakespeare. J Evol Psychol 3(1):57\u201373","journal-title":"J Evol Psychol"},{"issue":"8","key":"6405_CR30","doi-asserted-by":"publisher","first-page":"10357","DOI":"10.1007\/s11042-016-3633-6","volume":"76","author":"QD Tran","year":"2017","unstructured":"Tran QD, Hwang D, Lee OJ et al (2017) Exploiting character networks for movie summarization. Multimedia Tools and Applications 76(8):10357\u201310369","journal-title":"Multimedia Tools and Applications"},{"issue":"9","key":"6405_CR31","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F (2006) FANMOD: a tool for fast network motif detection. Bioinformatics 22(9):1152\u20131153","journal-title":"Bioinformatics"},{"key":"6405_CR32","doi-asserted-by":"crossref","unstructured":"Woloch A (2009) The one vs. the many: minor characters and the space of the protagonist in the novel. Princeton University, New Jersey, USA","DOI":"10.1515\/9781400825752"},{"key":"6405_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ins.2018.04.031","volume":"453","author":"D Yang","year":"2018","unstructured":"Yang D, Guo J, Wang ZJ et al (2018) FastPM: an approach to pattern matching via distributed stream processing. Inf Sci 453:263\u2013280","journal-title":"Inf Sci"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6405-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-018-6405-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6405-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T19:32:46Z","timestamp":1693769566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-018-6405-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,16]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["6405"],"URL":"https:\/\/doi.org\/10.1007\/s11042-018-6405-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2018,7,16]]},"assertion":[{"value":"24 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}