{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:57:59Z","timestamp":1743141479302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934088"},{"type":"electronic","value":"9783030934095"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93409-5_42","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"501-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Motif-Role Extraction in\u00a0Uncertain Graph Based on\u00a0Efficient Ensembles"],"prefix":"10.1007","author":[{"given":"Soshi","family":"Naito","sequence":"first","affiliation":[]},{"given":"Takayasu","family":"Fushimi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.: Efficient graphlet counting for large networks. In: 2015 IEEE International Conference on Data Mining, pp. 1\u201310 (2015)","DOI":"10.1109\/ICDM.2015.141"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"JA Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_7"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Itzhack, R., Mogilevski, Y., Louzoun, Y.: An optimal algorithm for counting network motifs. Physica A: Stat. Mech. Appl. 381, 482\u2013490 (2007). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437107002257","DOI":"10.1016\/j.physa.2007.02.102"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Kv\u00e5lseth, T.O.: On normalized mutual information: measure derivations and properties. Entropy 19(11) (2017). https:\/\/www.mdpi.com\/1099-4300\/19\/11\/631","DOI":"10.3390\/e19110631"},{"key":"42_CR5","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"42_CR6","doi-asserted-by":"publisher","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V.S., Grubenmann, T., Fang, Y., Li, X.: LINC: a motif counting algorithm for uncertain graphs. Proc. VLDB Endow. 13(2), 155\u2013168 (2019). https:\/\/doi.org\/10.14778\/3364324.3364330","DOI":"10.14778\/3364324.3364330"},{"key":"42_CR7","doi-asserted-by":"publisher","unstructured":"McDonnell, M.D., Yaveroglu, O.N., Schmerl, B.A., Iannella, N., Ward, L.M.: Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. Plos One 9(12), 1\u201325 (2014). https:\/\/doi.org\/10.1371\/journal.pone.0114503","DOI":"10.1371\/journal.pone.0114503"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science (New York, N.Y.) 298(5594), 824\u2013827 (2002)","DOI":"10.1126\/science.298.5594.824"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2","key":"42_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11403-010-0066-6","volume":"5","author":"T Ohnishi","year":"2010","unstructured":"Ohnishi, T., Takayasu, H., Takayasu, M.: Network motifs in an inter-firm network. J. Econ. Interact. Coord. 5(2), 171\u2013180 (2010)","journal-title":"J. Econ. Interact. Coord."},{"key":"42_CR11","doi-asserted-by":"publisher","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: efficiently counting all 5-vertex subgraphs. In: Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Republic and Canton of Geneva, CHE, pp. 1431\u20131440 (2017). https:\/\/doi.org\/10.1145\/3038912.3052597","DOI":"10.1145\/3038912.3052597"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Tran, N., Choi, K.P., Zhang, L.: Counting motifs in the human interactome. Nature Commun. 4, 2241 (2013)","DOI":"10.1038\/ncomms3241"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11557067_14","volume-title":"Algorithms in Bioinformatics","author":"S Wernicke","year":"2005","unstructured":"Wernicke, S.: A faster algorithm for detecting network motifs. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS, vol. 3692, pp. 165\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11557067_14"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93409-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:35:38Z","timestamp":1682627738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_42","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}