{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:18:30Z","timestamp":1743038310906,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318290"},{"type":"electronic","value":"9783642318306"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","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-31830-6_14","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T10:02:38Z","timestamp":1340791358000},"page":"199-217","source":"Crossref","is-referenced-by-count":5,"title":["Network Compression by Node and Edge Mergers"],"prefix":"10.1007","author":[{"given":"Hannu","family":"Toivonen","sequence":"first","affiliation":[]},{"given":"Fang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Aleksi","family":"Hartikainen","sequence":"additional","affiliation":[]},{"given":"Atte","family":"Hinkka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: The 17th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, USA (2011)","DOI":"10.1145\/2020408.2020566"},{"key":"14_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-31830-6_3","volume-title":"Bisociative Knowledge Discovery","author":"T. K\u00f6tter","year":"2012","unstructured":"K\u00f6tter, T., Berthold, M.R.: From Information Networks to Bisociative Information Networks. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS (LNAI), vol.\u00a07250, pp. 33\u201350. Springer, Heidelberg (2012)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/1376616.1376661","volume-title":"SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"S. Navlakha","year":"2008","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 419\u2013432. ACM, New York (2008)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/1376616.1376675","volume-title":"SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"Y. Tian","year":"2008","unstructured":"Tian, Y., Hankins, R., Patel, J.: Efficient aggregation for graph summarization. In: SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 567\u2013580. ACM, New York (2008)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F. Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. Journal of Mathematical Sociology\u00a01, 49\u201380 (1971)","journal-title":"Journal of Mathematical Sociology"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0378-8733(92)90015-Y","volume":"14","author":"S.P. Borgatti","year":"1992","unstructured":"Borgatti, S.P., Everett, M.G.: Regular blockmodels of multiway, multimode matrices. Social Networks\u00a014, 91\u2013120 (1992)","journal-title":"Social Networks"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, N., Tian, Y., Patel, J.: Discovery-driven graph summarization. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE), pp. 880\u2013891. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447830"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"742","DOI":"10.14778\/1687627.1687711","volume":"2","author":"Chen Chen","year":"2009","unstructured":"Chen, C., Lin, C., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. In: 2009 Int. Conf. on Very Large Data Bases, Lyon, France, pp. 742\u2013753. VLDB Endowment (August 2009)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"Saket Navlakha","year":"2009","unstructured":"Navlakha, S., Schatz, M., Kingsford, C.: Revealing biological modules via graph summarization. Presented at the RECOMB Systems Biology Satellite Conference; J. Comp. Bio.\u00a016, 253\u2013264 (2009)","journal-title":"Journal of Computational Biology"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/ICDM.2008.30","volume-title":"ICDM 2008: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining","author":"C. Chen","year":"2008","unstructured":"Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.: Graph OLAP: Towards online analytical processing on graphs. In: ICDM 2008: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, pp. 103\u2013112. IEEE Computer Society, Washington, DC (2008)"},{"key":"14_CR11","unstructured":"Fj\u00e4llstr\u00f6m, P.O.: Algorithms for graph partitioning: A Survey. Link\u00f6ping Electronic Atricles in Computer and Information Science, vol. 3 (1998)"},{"key":"14_CR12","unstructured":"Elsner, U.: Graph partitioning - a survey. Technical Report SFB393\/97-27, Technische Universit\u00e4t Chemnitz (1997)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1014052.1014068","volume-title":"KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C. Faloutsos","year":"2004","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 118\u2013127. ACM, New York (2004)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P. Hintsanen","year":"2008","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery\u00a017, 3\u201323 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Hauguel, S., Zhai, C.X., Han, J.: Parallel PathFinder algorithms for mining structures from graphs. In: 2009 Ninth IEEE International Conference on Data Mining, pp. 812\u2013817. IEEE (2009)","DOI":"10.1109\/ICDM.2009.142"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-13062-5_21","volume-title":"Advances in Intelligent Data Analysis IX","author":"H. Toivonen","year":"2010","unstructured":"Toivonen, H., Mahler, S., Zhou, F.: A Framework for Path-Oriented Network Simplification. In: Cohen, P.R., Adams, N.M., Berthold, M.R. (eds.) IDA 2010. LNCS, vol.\u00a06065, pp. 220\u2013231. Springer, Heidelberg (2010)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Data Compression Conference, pp. 203\u2013212 (2001)","DOI":"10.1109\/DCC.2001.917151"},{"key":"14_CR19","first-page":"595","volume-title":"WWW 2004: Proceedings of the 13th International Conference on World Wide Web","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW 2004: Proceedings of the 13th International Conference on World Wide Web, pp. 595\u2013602. ACM, New York (2004)"},{"key":"14_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-31830-6_12","volume-title":"Bisociative Knowledge Discovery","author":"F. Zhou","year":"2012","unstructured":"Zhou, F., Mahler, S., Toivonen, H.: Review of BisoNet Abstraction Techniques. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS (LNAI), pp. 166\u2013178. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Bisociative Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31830-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T05:35:21Z","timestamp":1548567321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31830-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318290","9783642318306"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31830-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}