{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:57:36Z","timestamp":1743137856050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534980"},{"type":"electronic","value":"9783031534997"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53499-7_36","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:03:01Z","timestamp":1709150581000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Method for\u00a0Vertex Clustering in\u00a0Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Devavrat Vivek","family":"Dabke","sequence":"first","affiliation":[]},{"given":"Olga","family":"Dorabiala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"36_CR1","unstructured":"Becker, R., et al.: Giant components in random temporal graphs. arXiv preprint arXiv:2205.14888 (2022)"},{"issue":"5","key":"36_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/15427951.2016.1177802","volume":"12","author":"E Bergamini","year":"2016","unstructured":"Bergamini, E., Meyerhenke, H.: Approximating betweenness centrality in fully dynamic networks. Internet Math. 12(5), 281\u2013314 (2016)","journal-title":"Internet Math."},{"issue":"5","key":"36_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 554\u2013560 (2006)","DOI":"10.1145\/1150402.1150467"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Chi, Y., Song, X., Zhou, D., Hino, K., Tseng, B.L.: Evolutionary spectral clustering by incorporating temporal smoothness. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 153\u2013162 (2007)","DOI":"10.1145\/1281192.1281212"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Cleveland, J., et al.: Introducing tropical geometric approaches to delay tolerant networking optimization. In: 2022 IEEE Aerospace Conference (AERO), pp. 1\u201311 (2022)","DOI":"10.1109\/AERO53065.2022.9843242"},{"key":"36_CR7","unstructured":"Dabke, D.V., Dorabiala, O.: Spatiotemporal graph k-means. In: Proceedings of the Communities in Networks ComNets @ NetSci 2023 (2023)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"vbad082","DOI":"10.1093\/bioadv\/vbad082","volume":"3","author":"DV Dabke","year":"2023","unstructured":"Dabke, D.V., Karntikoon, K., Aluru, C., Singh, M., Chazelle, B.: Network-augmented compartmental models to track asymptomatic disease spread. Bioinform. Adv. 3, vbad082 (2023)","journal-title":"Bioinform. Adv."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"DiTursi, D.J., Ghosh, G., Bogdanov, P.: Local community detection in dynamic networks. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 847\u2013852 (2017)","DOI":"10.1109\/ICDM.2017.103"},{"key":"36_CR10","unstructured":"Dorabiala, O., Webster, J., Kutz, N., Aravkin, A.: Spatiotemporal k-means. arXiv preprint arXiv:2211.05337 (2022)"},{"issue":"3\u20135","key":"36_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2444016.2444021","volume":"18","author":"R G\u00f6rke","year":"2013","unstructured":"G\u00f6rke, R., Maillard, P., Schumm, A., Staudt, C., Wagner, D.: Dynamic graph clustering combining modularity and smoothness. J. Exp. Algorithmics 18, 1\u20131 (2013)","journal-title":"J. Exp. Algorithmics"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Gurukar, S., Ranu, S., Ravindran, B.: Commit: a scalable approach to mining communication motifs from dynamic networks. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 475\u2013489. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2723372.2737791"},{"key":"36_CR14","unstructured":"Habiba, C.T., Tanya, Y.: Berger-Wolf. Betweenness centrality measure in dynamic networks, Technical Report 19, DIMACS (2007)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Hylton, A., et al.: A survey of mathematical structures for lunar networks. In: 2022 IEEE Aerospace Conference (AERO), pp. 1\u201317 (2022)","DOI":"10.1109\/AERO53065.2022.9843305"},{"issue":"6","key":"36_CR16","first-page":"90","volume":"1","author":"TM Kodinariya","year":"2013","unstructured":"Kodinariya, T.M., Makwana, P.R., et al.: Review on determining number of cluster in k-means clustering. Int. J. 1(6), 90\u201395 (2013)","journal-title":"Int. J."},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 61 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Lerman, K., Ghosh, R., Kang, J.H.: Centrality metric for dynamic networks. In: Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG 2010, pp. 70\u201477. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1830252.1830262"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Lin, Y.-R., Chi, Y., Zhu, S., Sundaram, H., Tseng, B.L.: FacetNet: a framework for analyzing communities and their evolutions in dynamic networks. In: Proceedings of the 17th International Conference on World Wide Web, pp. 685\u2013694 (2008)","DOI":"10.1145\/1367497.1367590"},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Reda, K., Tantipathananandh, C., Johnson, A., Leigh, J., Berger-Wolf, T.: Visualizing the evolution of community structures in dynamic social networks. In: Computer Graphics Forum, vol. 30, pp. 1061\u20131070. Wiley Online Library (2011)","DOI":"10.1111\/j.1467-8659.2011.01955.x"},{"issue":"2","key":"36_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. 51(2), 1\u201337 (2018)","journal-title":"ACM Comput. Surv."},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Ruan, B., Gan, J., Wu, H., Wirth, A.: Dynamic structural clustering on graphs. In: Proceedings of the 2021 International Conference on Management of Data, pp. 1491\u20131503 (2021)","DOI":"10.1145\/3448016.3452828"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Yao, Y., Joe-Wong, C.: Interpretable clustering on dynamic graphs with recurrent graph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 4608\u20134616 (2021)","DOI":"10.1609\/aaai.v35i5.16590"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Yen, C.-C., Yeh, M.-Y., Chen, M.-S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: 2013 IEEE 13th International Conference on Data Mining, pp. 867\u2013876 (2013)","DOI":"10.1109\/ICDM.2013.135"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53499-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:09:16Z","timestamp":1709150956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53499-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534980","9783031534997"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53499-7_36","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","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":"Menton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2023","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"}}]}}