{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:49:51Z","timestamp":1725702591060},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332654"},{"type":"electronic","value":"9783642332661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33266-1_45","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T19:42:31Z","timestamp":1347997351000},"page":"363-370","source":"Crossref","is-referenced-by-count":3,"title":["Self-Organizing Map and Tree Topology for Graph Summarization"],"prefix":"10.1007","author":[{"given":"Nhat-Quang","family":"Doan","sequence":"first","affiliation":[]},{"given":"Hanane","family":"Azzag","sequence":"additional","affiliation":[]},{"given":"Mustapha","family":"Lebbah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD Conference, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/2020408.2020566","volume-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011","author":"H. Toivonen","year":"2011","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011, pp. 965\u2013973. ACM, New York (2011)"},{"issue":"3","key":"45_CR3","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.ejor.2005.03.062","volume":"179","author":"H. Azzag","year":"2007","unstructured":"Azzag, H., Venturini, G., Oliver, A., Guinot, C.: A hierarchical ant based clustering algorithm and its use in three real-world applications. European Journal of Operational Research\u00a0179(3), 906\u2013922 (2007)","journal-title":"European Journal of Operational Research"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/347090.347121","volume-title":"Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2000","author":"G.W. Flake","year":"2000","unstructured":"Flake, G.W., Lawrence, S., Lee Giles, C.: Efficient identification of web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2000, pp. 150\u2013160. ACM, New York (2000)"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1145\/1060745.1060841","volume-title":"Proceedings of the 14th International Conference on World Wide Web, WWW 2005","author":"H. Ino","year":"2005","unstructured":"Ino, H., Kudo, M., Nakamura, A.: Partitioning of web graphs by community topology. In: Proceedings of the 14th International Conference on World Wide Web, WWW 2005, pp. 661\u2013669. ACM, New York (2005)"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.neucom.2009.11.023","volume":"73","author":"F. Rossi","year":"2010","unstructured":"Rossi, F., Villa-Vialaneix, N.: Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach. Neurocomput.\u00a073, 1142\u20131163 (2010)","journal-title":"Neurocomput."},{"issue":"23","key":"45_CR7","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proceedings of the National Academy of Sciences\u00a0103(23), 8577\u20138582 (2006)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Comput. Surv.\u00a038 (June 2006)","DOI":"10.1145\/1132952.1132954"},{"issue":"5","key":"45_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.ijhcs.2006.11.002","volume":"65","author":"D. Chakrabarti","year":"2007","unstructured":"Chakrabarti, D., Faloutsos, C., Zhan, Y.: Visualization of large networks with min-cut plots, a-plots and r-mat. Int. J. Hum.-Comput. Stud.\u00a065(5), 434\u2013445 (2007)","journal-title":"Int. J. Hum.-Comput. Stud."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society (February 1997)","DOI":"10.1090\/cbms\/092"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Luxburg","year":"2007","unstructured":"Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing\u00a017, 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Stanoev, A., Smilkov, D., Kocarev, L.: Identifying communities by influence dynamics in social networks. CoRR, abs\/1104.5247 (2011)","DOI":"10.1103\/PhysRevE.84.046102"},{"key":"45_CR13","first-page":"73","volume-title":"Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006","author":"O. Grygorash","year":"2006","unstructured":"Grygorash, O., Zhou, Y., Jorgensen, Z.: Minimum spanning tree based clustering algorithms. In: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006, pp. 73\u201381. IEEE Computer Society, Washington, DC (2006)"},{"key":"45_CR14","first-page":"583","volume":"3","author":"A. Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J., Cardie, C.: Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research\u00a03, 583\u2013617 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Auber, D.: Tulip: A huge graph visualisation framework. In: Mutzel, P., J\u00fcnger, M. (eds.) Graph Drawing Softwares. Mathematics and Visualization, pp. 105\u2013126. Springer (2003)","DOI":"10.1007\/978-3-642-18638-7_5"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33266-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T05:24:16Z","timestamp":1643433856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33266-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332654","9783642332661"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33266-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}