{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:08:54Z","timestamp":1759666134646},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,26]],"date-time":"2012-08-26T00:00:00Z","timestamp":1345939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10618-012-0286-6","type":"journal-article","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T08:56:16Z","timestamp":1345884976000},"page":"84-116","source":"Crossref","is-referenced-by-count":24,"title":["A regularized graph layout framework for dynamic network visualization"],"prefix":"10.1007","volume":"27","author":[{"given":"Kevin S.","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Kliger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,26]]},"reference":[{"key":"286_CR1","unstructured":"Baur M, Schank T (2008) Dynamic graph drawing in Visone. Tech. rep., Universit\u00e4t Karlsruhe"},{"key":"286_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming: theory and algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms. Wiley, New York"},{"issue":"6","key":"286_CR3","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6): 1373\u20131396","journal-title":"Neural Comput"},{"issue":"2","key":"286_CR4","first-page":"1","volume":"7","author":"S Bender-deMoll","year":"2006","unstructured":"Bender-deMoll S, McFarland DA (2006) The art and science of dynamic network visualization. J Soc Struct 7(2): 1\u201338","journal-title":"J Soc Struct"},{"key":"286_CR5","unstructured":"Bender-deMoll S, McFarland DA (2012) SoNIA\u2014Social Network Image Animator. http:\/\/www.stanford.edu\/group\/sonia\/"},{"key":"286_CR6","volume-title":"Modern multidimensional scaling. 2","author":"I Borg","year":"2005","unstructured":"Borg I, Groenen PJF (2005) Modern multidimensional scaling. Springer, New York"},{"issue":"1","key":"286_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1057\/palgrave.ivs.9500037","volume":"2","author":"U Brandes","year":"2003","unstructured":"Brandes U, Corman SR (2003) Visual unrolling of network evolution and the analysis of dynamic discourse. Inf Vis 2(1): 40\u201350","journal-title":"Inf Vis"},{"key":"286_CR8","unstructured":"Brandes U, Mader M (2011) A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In: Proceedings of the 19th international symposium on graph drawing, pp 99\u2013110"},{"key":"286_CR9","doi-asserted-by":"crossref","unstructured":"Brandes U, Wagner D (1997) A Bayesian paradigm for dynamic graph layout. In: Proceedings of the 5th international symposium on graph drawing, pp 236\u2013247","DOI":"10.1007\/3-540-63938-1_66"},{"key":"286_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-18638-7_15","volume-title":"Graph drawing software","author":"U Brandes","year":"2004","unstructured":"Brandes U, Wagner D (2004) visone\u2014analysis and visualization of social networks. In: J\u00fcnger M, Mutzel P (eds) Graph drawing software. Springer, Berlin, pp 321\u2013340"},{"issue":"2","key":"286_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.7155\/jgaa.00149","volume":"11","author":"U Brandes","year":"2007","unstructured":"Brandes U, Fleischer D, Puppe T (2007) Dynamic spectral layout with an application to small worlds. J Graph Algorithms Appl 11(2): 325\u2013343","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"286_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.socnet.2011.06.002","volume":"34","author":"U Brandes","year":"2012","unstructured":"Brandes U, Indlekofer N, Mader M (2012) Visualization methods for longitudinal social networks and stochastic actor-oriented modeling. Soc Netw 34(3): 291\u2013308","journal-title":"Soc Netw"},{"key":"286_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-44969-8_9","volume-title":"Drawing graphs: methods and models","author":"J Branke","year":"2001","unstructured":"Branke J (2001) Dynamic graph drawing. In: Kaufmann M, Wagner D (eds) Drawing graphs: methods and models. Springer, Berlin, pp 228\u2013246"},{"issue":"4","key":"286_CR14","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"RH Byrd","year":"1999","unstructured":"Byrd RH, Hribar ME, Nocedal J (1999) An interior point algorithm for large-scale nonlinear programming. SIAM J Optim 9(4): 877\u2013900","journal-title":"SIAM J Optim"},{"issue":"4","key":"286_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1631162.1631165","volume":"3","author":"Y Chi","year":"2009","unstructured":"Chi Y, Song X, Zhou D, Hino K, Tseng BL (2009) On evolutionary spectral clustering. ACM Trans Knowl Discov Data 3(4): 17","journal-title":"ACM Trans Knowl Discov Data"},{"key":"286_CR16","unstructured":"Costa JA, Hero III AO (2005) Classification constrained dimensionality reduction. In: Proceedings of the IEEE international conference on acoustics, speech, and signal processing, pp 1077\u20131080"},{"key":"286_CR17","unstructured":"de Leeuw J, Heiser WJ (1980) Multidimensional scaling with restrictions on the configuration. In: Proceedings of the 5th international symposium on multivariate analysis, pp 501\u2013522"},{"key":"286_CR18","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, Upper Saddle River"},{"issue":"3","key":"286_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P Eades","year":"2000","unstructured":"Eades P, Huang ML (2000) Navigating clustered graphs using force-directed methods. J Graph Algorithms Appl 4(3): 157\u2013181","journal-title":"J Graph Algorithms Appl"},{"issue":"36","key":"286_CR20","doi-asserted-by":"publisher","first-page":"15274","DOI":"10.1073\/pnas.0900282106","volume":"106","author":"N Eagle","year":"2009","unstructured":"Eagle N, Pentland A, Lazer D (2009) Inferring friendship network structure by using mobile phone data. Proc Natl Acad Sci USA 106(36): 15274\u201315278","journal-title":"Proc Natl Acad Sci USA"},{"key":"286_CR21","unstructured":"Erten C, Harding PJ, Kobourov SG, Wampler K, Yee G (2004) Exploring the computing literature using temporal graph visualization. In: Proceedings of the conference on visualization and data analysis, pp 45\u201356"},{"issue":"4","key":"286_CR22","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1109\/TVCG.2008.11","volume":"14","author":"Y Frishman","year":"2008","unstructured":"Frishman Y, Tal A (2008) Online dynamic graph drawing. IEEE Trans Vis Comput Graphics 14(4): 727\u2013740","journal-title":"IEEE Trans Vis Comput Graphics"},{"issue":"11","key":"286_CR23","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11): 1129\u20131164","journal-title":"Softw Pract Exp"},{"key":"286_CR24","unstructured":"Gansner ER, Koren Y, North S (2004) Graph drawing by stress majorization. In: Proceedings of the 12th international symposium on graph drawings, pp 239\u2013250"},{"issue":"3","key":"286_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"KM Hall","year":"1970","unstructured":"Hall KM (1970) An r-dimensional quadratic placement algorithm. Manag Sci 17(3): 219\u2013229","journal-title":"Manag Sci"},{"issue":"1","key":"286_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"I Herman","year":"2000","unstructured":"Herman I, Melan\u00e7on G, Marshall MS (2000) Graph visualisation and navigation in information visualisation: a survey. IEEE Trans Vis Comput Graphics 6(1): 24\u201343","journal-title":"IEEE Trans Vis Comput Graphics"},{"issue":"1","key":"286_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"AE Hoerl","year":"1970","unstructured":"Hoerl AE, Kennard RW (1970) Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12(1): 55\u201367","journal-title":"Technometrics"},{"issue":"2","key":"286_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2): 109\u2013137","journal-title":"Soc Netw"},{"issue":"12","key":"286_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(12): 7\u201315","journal-title":"Inf Process Lett"},{"issue":"11\u201312","key":"286_CR30","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/j.camwa.2004.08.015","volume":"49","author":"Y Koren","year":"2005","unstructured":"Koren Y (2005) Drawing graphs by eigenvectors: theory and practice. Comput Math Appl 49(11\u201312): 1867\u20131888","journal-title":"Comput Math Appl"},{"issue":"5757","key":"286_CR31","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets G, Watts DJ (2006) Empirical analysis of an evolving social network. Science 311(5757): 88\u201390","journal-title":"Science"},{"key":"286_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39351-3","volume-title":"Nonlinear dimensionality reduction","author":"JA Lee","year":"2007","unstructured":"Lee JA, Verleysen M (2007) Nonlinear dimensionality reduction. Springer, Berlin"},{"issue":"1","key":"286_CR33","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1): 2","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"11","key":"286_CR34","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1002\/asi.20891","volume":"59","author":"L Leydesdorff","year":"2008","unstructured":"Leydesdorff L, Schank T (2008) Dynamic animations of journal maps: indicators of structural changes and interdisciplinary developments. J Am Soc Inf Sci Technol 59(11): 1810\u20131818","journal-title":"J Am Soc Inf Sci Technol"},{"key":"286_CR35","volume-title":"Handbook of matrices","author":"H L\u00fctkepohl","year":"1997","unstructured":"L\u00fctkepohl H (1997) Handbook of matrices. Wiley, New York"},{"issue":"2","key":"286_CR36","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue K, Eades P, Lai W, Sugiyama K (1995) Layout adjustment and the mental map. J Vis Lang Comput 6(2): 183\u2013210","journal-title":"J Vis Lang Comput"},{"key":"286_CR37","unstructured":"MIT-WWW (2005) MIT Academic Calendar 2004\u20132005. http:\/\/web.mit.edu\/registrar\/www\/calendar0405.html"},{"issue":"4","key":"286_CR38","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1086\/421509","volume":"110","author":"J Moody","year":"2005","unstructured":"Moody J, McFarland D, Bender-deMoll S (2005) Dynamic network visualization. Am J Sociol 110(4): 1206\u20131241","journal-title":"Am J Sociol"},{"issue":"5980","key":"286_CR39","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha PJ, Richardson T, Macon K, Porter MA, Onnela JP (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980): 876\u2013878","journal-title":"Science"},{"key":"286_CR40","doi-asserted-by":"publisher","DOI":"10.1037\/13156-000","volume-title":"The acquaintance process","author":"TM Newcomb","year":"1961","unstructured":"Newcomb TM (1961) The acquaintance process. Holt, Rinehart and Winston, New York"},{"key":"286_CR41","first-page":"849","volume":"14","author":"AY Ng","year":"2001","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 14: 849\u2013856","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"286_CR42","unstructured":"Nordlie PG (1958) A longitudinal study of interpersonal attraction in a natural group setting. PhD thesis, University of Michigan"},{"key":"286_CR43","doi-asserted-by":"crossref","unstructured":"Sun J, Xie Y, Zhang H, Faloutsos C (2007) Less is more: compact matrix decomposition for large sparse graphs. In: Proceedings of the 7th SIAM conference on data mining, pp 366\u2013377","DOI":"10.1137\/1.9781611972771.33"},{"issue":"1","key":"286_CR44","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B 58(1): 267\u2013288","journal-title":"J R Stat Soc Ser B"},{"key":"286_CR45","doi-asserted-by":"crossref","unstructured":"Tong H, Papadimitriou S, Sun J, Yu PS, Faloutsos C (2008) Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 686\u2013694","DOI":"10.1145\/1401890.1401973"},{"key":"286_CR46","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical linear algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen LN, Bau D III (1997) Numerical linear algebra. SIAM, Philadelphia"},{"key":"286_CR47","unstructured":"Visone-WWW (2012) visone. http:\/\/www.visone.info\/"},{"key":"286_CR48","unstructured":"Wang X, Miyamoto I (1995) Generating customized layouts. In: Proceedings of the symposium on graph drawing, pp 504\u2013515"},{"issue":"1","key":"286_CR49","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.csda.2010.07.001","volume":"55","author":"DM Witten","year":"2011","unstructured":"Witten DM, Tibshirani R (2011) Supervised multidimensional scaling for visualization, classification, and bipartite ranking. Comput Stat Data Anal 55(1): 789\u2013801","journal-title":"Comput Stat Data Anal"},{"issue":"3","key":"286_CR50","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten DM, Tibshirani R, Hastie T (2009) A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10(3): 515\u2013534","journal-title":"Biostatistics"},{"key":"286_CR51","unstructured":"Xu KS, Kliger M, Hero III AO (2011a) Adaptive evolutionary clustering (submitted). arXiv:1104.1990"},{"key":"286_CR52","unstructured":"Xu KS, Kliger M, Hero III AO (2011b) Visualizing the temporal evolution of dynamic networks. In: Proceedings of the 9th workshop on mining and learning graphs"},{"key":"286_CR53","unstructured":"Xu KS, Kliger M, Hero III AO (2012) A regularized graph layout framework for dynamic network visualization: supporting website. http:\/\/tbayes.eecs.umich.edu\/xukevin\/visualization_dmkd_2012"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0286-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-012-0286-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0286-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0286-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T18:38:11Z","timestamp":1714329491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0286-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,26]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0286-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,26]]}}}