{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:50:40Z","timestamp":1743108640709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934125"},{"type":"electronic","value":"9783030934132"}],"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-93413-2_36","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"428-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Summarization with\u00a0Latent Variable Probabilistic Models"],"prefix":"10.1007","author":[{"given":"Shintaro","family":"Fukushima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryoga","family":"Kanai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Yamanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Beg, M.A., Ahmad, M., Zaman, A., Khan, I.: Scalable approximation algorithm for graph summarization. In: Proceedings of the 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2018, pp. 502\u2013514 (2018)","DOI":"10.1007\/978-3-319-93040-4_40"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Fukushima, S., Yamanishi, K.: Hierarchical change detection in latent variable models. In: Proceedings of 2020 IEEE International Conference on Data Mining, ICDM2020, pp. 1128\u20131134 (2020)","DOI":"10.1109\/ICDM50108.2020.00120"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.: The Minimum Description Length Principle. MIT Press (2007)","DOI":"10.7551\/mitpress\/4643.001.0001"},{"issue":"3","key":"36_CR4","first-page":"031038","volume":"6","author":"D Hric","year":"2016","unstructured":"Hric, D., Peixoto, T.P., Fortunato, S.: Network structure, metadata, and the prediction of missing nodes and annotations. Phys. Rev. X 6(3), 031038 (2016)","journal-title":"Phys. Rev. X"},{"issue":"6","key":"36_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ipl.2007.04.003","volume":"103","author":"P Kontkanen","year":"2007","unstructured":"Kontkanen, P., Myllym\u00e4ki, P.: A linear-time algorithm for computing the multinomial stochastic complexity. Inf. Process. Lett. 103(6), 227\u2013233 (2007)","journal-title":"Inf. Process. Lett."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VOG: summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM International Conference on Data Mining, SDM 2014, pp. 91\u201399 (2014)","DOI":"10.1137\/1.9781611973440.11"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Lee, K., Jo, H., Ko, J., Lim, S., Shin, K.: SSumM: sparse summarization of massive graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2020, pp. 144\u2013154 (2020)","DOI":"10.1145\/3394486.3403057"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: Proceedings of the 2010 SIAM International Conference on Data Mining, SDM 2010, pp. 454\u2013465 (2010)","DOI":"10.1137\/1.9781611972801.40"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2005, pp. 177\u2013187 (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"2-es","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2-es (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"issue":"3","key":"36_CR12","first-page":"62:1","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. 51(3), 62:1-62:34 (2018)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1214\/10-AOAS361","volume":"4","author":"M Mariadassou","year":"2010","unstructured":"Mariadassou, M., Robin, S., Vacher, C.: Uncovering latent structure in valued graphs: a variational approach. Ann. Appl. Stat. 4(2), 715\u2013742 (2010)","journal-title":"Ann. Appl. Stat."},{"key":"36_CR14","unstructured":"McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: Proceedings of the 25th Advances in Neural Information Processing Systems, NIPS 2012, pp. 539\u2013547 (2012)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"issue":"5","key":"36_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056122","volume":"85","author":"TP Peixoto","year":"2012","unstructured":"Peixoto, T.P.: Entropy of stochastic blockmodel ensembles. Phys. Rev. E 85(5), 056122 (2012)","journal-title":"Phys. Rev. E"},{"key":"36_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.148701","volume":"110","author":"TP Peixoto","year":"2013","unstructured":"Peixoto, T.P.: Parsimonious module inference in large networks. Phys. Rev. Lett. 110, 148701 (2013)","journal-title":"Phys. Rev. Lett."},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"012804","DOI":"10.1103\/PhysRevE.89.012804","volume":"89","author":"TP Peixoto","year":"2014","unstructured":"Peixoto, T.P.: Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Phys. Rev. E 89, 012804 (2014)","journal-title":"Phys. Rev. E"},{"key":"36_CR19","volume":"4","author":"TP Peixoto","year":"2014","unstructured":"Peixoto, T.P.: Hierarchical block structures and high-resolution model selection in large networks. Phys. Rev. X 4, 011047 (2014)","journal-title":"Phys. Rev. X"},{"key":"36_CR20","volume":"5","author":"TP Peixoto","year":"2015","unstructured":"Peixoto, T.P.: Model selection and hypothesis testing for large-scale network models with overlapping groups. Phys. Rev. X 5, 011033 (2015)","journal-title":"Phys. Rev. X"},{"issue":"2","key":"36_CR21","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s10618-016-0468-8","volume":"31","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. Data Min. Knowl. Disc. 31(2), 314\u2013349 (2016). https:\/\/doi.org\/10.1007\/s10618-016-0468-8","journal-title":"Data Min. Knowl. Disc."},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14, 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"2","key":"36_CR23","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Stat. 11(2), 416\u2013431 (1983)","journal-title":"Ann. Stat."},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Rissanen, J.: Optimal Estimation of Parameters (2012)","DOI":"10.1017\/CBO9780511791635"},{"issue":"3","key":"36_CR25","first-page":"3","volume":"23","author":"YM Shtar\u2019kov","year":"1987","unstructured":"Shtar\u2019kov, Y.M.: Universal sequential coding of single messages. Probl. Inf. Transm. 23(3), 3\u201317 (1987)","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"36_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s003579900004","volume":"14","author":"TAB Snijders","year":"1997","unstructured":"Snijders, T.A.B., Nowicki, K.: Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classif. 14(1), 75\u2013100 (1997)","journal-title":"J. Classif."},{"key":"36_CR27","doi-asserted-by":"publisher","first-page":"062316","DOI":"10.1103\/PhysRevE.97.062316","volume":"97","author":"TV Catal\u00e1","year":"2018","unstructured":"Catal\u00e1, T.V., Peixoto, T.P., Pardo, M.S., Guimer\u00e1, R.: Consistencies and inconsistencies between model selection and link prediction in networks. Phys. Rev. E 97, 062316 (2018)","journal-title":"Phys. Rev. E"},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Wu, T., Sugawara, S., Yamanishi, K.: Decomposed normalized maximum likelihood codelength criterion for selecting hierarchical latent variable models. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2017, pp. 1165\u20131174 (2017)","DOI":"10.1145\/3097983.3098110"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhong, Z., Xiong, W., Jing, N.: Graph summarization for attributed graphs. In: Proceedings of 2014 International Conference on Information Science, Electronics and Electrical Engineering, ISEEE 2014, vol. 1, pp. 503\u2013507 (2014)","DOI":"10.1109\/InfoSEEE.2014.6948163"},{"issue":"64","key":"36_CR30","doi-asserted-by":"publisher","first-page":"6115","DOI":"10.1109\/TIT.2018.2852747","volume":"9","author":"K Yamanishi","year":"2018","unstructured":"Yamanishi, K., Fukushima, S.: Model change detection with the MDL principle. IEEE Trans. Inf. Theor. 9(64), 6115\u20136126 (2018)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Yamanishi, K., Miyaguchi, K.: Detecting gradual changes from data stream using MDL-change statistics. In: Proceedings of 2016 IEEE International Conference on BigData, BigData 2016, pp. 156\u2013163 (2016)","DOI":"10.1109\/BigData.2016.7840601"},{"issue":"4","key":"36_CR32","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10618-019-00624-4","volume":"33","author":"K Yamanishi","year":"2019","unstructured":"Yamanishi, K., Wu, T., Sugawara, S., Okada, M.: The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models. Data Min. Knowl. Disc. 33(4), 1017\u20131058 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00624-4","journal-title":"Data Min. Knowl. Disc."},{"key":"36_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, H., Liu, S., Lee, K., Shin, K., Shen, H., Cheng, X.: DPGS: degree-preserving graph summarization. In: Proceedings of the 2021 SIAM International Conference on Data Mining, SDM 2021, pp. 280\u2013288 (2021)","DOI":"10.1137\/1.9781611976700.32"}],"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-93413-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:27:57Z","timestamp":1682627277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93413-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934125","9783030934132"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93413-2_36","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"}}]}}