{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:00:10Z","timestamp":1725843610124},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319273075"},{"type":"electronic","value":"9783319273082"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27308-2_39","type":"book-chapter","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T13:29:53Z","timestamp":1450358993000},"page":"481-492","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Can Embedding Solve Scalability Issues for Mixed-Data Graph Clustering?"],"prefix":"10.1007","author":[{"given":"Nadezhda","family":"Fedorova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Blat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Nettleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,18]]},"reference":[{"key":"39_CR1","unstructured":"Bastian, M.: Visualize big graph data. Data Visualization Summit, San Francisco, 11\u201312 April 2013 (2013). \n                      http:\/\/www.slideshare.net\/mathieu-bastian\/visualize-big-graph-data"},{"issue":"11","key":"39_CR2","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/TVCG.2010.265","volume":"17","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Brandenburg, F.J., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. IEEE Trans. Vis. Comput. Graph. 17(11), 1587\u20131598 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"39_CR3","unstructured":"Isenberg, P., Carpendale, S., Hesselmann, T., Isenberg, T., Lee, B. (eds): Research Report N0421. In: Proceedings Workshop on Data Exploration for Interactive Surfaces, DEXIS 2011, pp. 1\u201347 (2012)"},{"key":"39_CR4","unstructured":"Keim, D.A.: Exploring big data using visual analytics. In: Proceedings Workshops of the EDBT\/ICDT 2014 Joint Conference (28 March 2014)"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-70956-5_7","volume-title":"Information Visualization","author":"DA Keim","year":"2008","unstructured":"Keim, D.A., Andrienko, G., Fekete, J.-D., G\u00f6rg, C., Kohlhammer, J., Melan\u00e7on, G.: Visual analytics: definition, process, and challenges. In: Kerren, A., Stasko, J.T., Fekete, J.-D., North, C. (eds.) Information Visualization. LNCS, vol. 4950, pp. 154\u2013175. Springer, Heidelberg (2008)"},{"key":"39_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5158-6","volume-title":"Graph-Based Clustering and Data Visualization Algorithms","author":"A Vathy-Fogarassy","year":"2013","unstructured":"Vathy-Fogarassy, A., Abonyi, J.: Graph-Based Clustering and Data Visualization Algorithms. Springer, London (2013). ISBN 978\u20131-4471-5158-6"},{"issue":"6","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/TVCG.2008.135","volume":"14","author":"W Cui","year":"2008","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE Trans. Vis. Comput. Graph. 14(6), 1277\u20131284 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"I Herman","year":"2000","unstructured":"Herman, I., Melancon, G., Marshall, M.S.: Graph visualization and navigation in information visualization: a survey. IEEE Trans. Visual Comput. Graph. 6(1), 24\u201343 (2000)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endowment 2(1), 718\u2013729 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering categories and subject descriptors. In: Proceeding ACM SIGMOD International Conference on Management of Data, pp. 505\u2013516 (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, L.: Social influence based clustering of heterogeneous information networks. In: Proceeding 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 2013, pp. 338\u2013346 (2013)","DOI":"10.1145\/2487575.2487640"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: an efficient incremental approach. In: Proceeding 2010 IEEE International Conference on Data Mining, pp. 689\u2013698 (2010)","DOI":"10.1109\/ICDM.2010.41"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Elhadi, H.: Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods. In: Proceeding 7th Workshop on Social Network Mining and Analysis SNAKDD 2013, Article no. 10 (2013)","DOI":"10.1145\/2501025.2501034"},{"issue":"4","key":"39_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10791-008-9066-8","volume":"12","author":"E Amig\u00f3","year":"2009","unstructured":"Amig\u00f3, E., Gonzalo, J., Artiles, J., Verdejo, F.: A comparison of extrinsic clustering evaluation metrics based on formal constraints. Inf. Retrieval 12(4), 461\u2013486 (2009)","journal-title":"Inf. Retrieval"},{"issue":"2","key":"39_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"1","author":"DL Davies","year":"1979","unstructured":"Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1(2), 224\u2013227 (1979)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"39_CR16","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a k-means clustering algorithm. J. Roy. Stat. Soc.: Ser. C (Appl. Stat.) 28(1), 100\u2013108 (1979)","journal-title":"J. Roy. Stat. Soc.: Ser. C (Appl. Stat.)"},{"key":"39_CR17","unstructured":"Zhao, X., Sala, A., Wilson, C., Zheng, H., Zhao, B.Y.: Orion: shortest path estimation for large social graphs. networks, vol. 1 (2010)"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs (invited paper). In: Proceedings of 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), pp. 77\u201386 (2011)","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"issue":"1","key":"39_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoret. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: Proceeding SIAM Data Mining Conference, SIAM, Philadelphia, PA (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"2","key":"39_CR21","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.14778\/1687553.1687577","volume":"2","author":"M Ley","year":"2009","unstructured":"Ley, M.: DBLP \u2014 some lessons learned. Proc VLDB Endowment 2(2), 1493\u20131500 (2009)","journal-title":"Proc VLDB Endowment"},{"key":"39_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-642-10665-1_71","volume-title":"Cloud Computing","author":"W Zhao","year":"2009","unstructured":"Zhao, W., Ma, H., He, Q.: Parallel K-Means clustering based on MapReduce. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud Computing. LNCS, vol. 5931, pp. 674\u2013679. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27308-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:40:46Z","timestamp":1587343246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27308-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319273075","9783319273082"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27308-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}