{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:09:12Z","timestamp":1704931752943},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transcom.2017ebp3303","type":"journal-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T22:10:47Z","timestamp":1508191847000},"page":"1000-1009","source":"Crossref","is-referenced-by-count":0,"title":["Visual Analysis of Geometry Constrained Large-Scale Network"],"prefix":"10.23919","volume":"E101.B","author":[{"given":"Zhonghua","family":"YAO","sequence":"first","affiliation":[{"name":"Space Engineering University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingda","family":"WU","sequence":"additional","affiliation":[{"name":"Space Engineering University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"SUN","sequence":"additional","affiliation":[{"name":"Space Engineering University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] H. Sch\u00e4fer and H. Schaefer, \u201cProcessing dynamic computer network data for visual analysis,\u201d OPUS, 2013. 10.18419\/opus-3179"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D. Holten and J.J. van Wijk, \u201cA user study on visualizing directed edges in graphs,\u201d Proc. SIGCHI Conference on Human Factors in Computing Systems (CHI'09), pp.2299-2308, 2009. 10.1145\/1518701.1519054","DOI":"10.1145\/1518701.1519054"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Holten, P. Isenberg, J.J. Van Wijk, and J.-D.D. Fekete, \u201cAn extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs,\u201d IEEE Pacific Visualization Symposium 2011, PacificVis 2011-Proceedings, pp.195-202, 2011. 10.1109\/pacificvis.2011.5742390","DOI":"10.1109\/PACIFICVIS.2011.5742390"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] A. Perer and B. Shneiderman, \u201cBalancing systematic and flexible exploration of social networks,\u201d IEEE Trans. Vis. Comput. Graphics, vol.12, no.5, pp.693-700, 2006. 10.1109\/tvcg.2006.122","DOI":"10.1109\/TVCG.2006.122"},{"key":"5","unstructured":"[5] Y. Sun, \u201cResearch on Visualization Method of Multivariate Network Data,\u201d 2010."},{"key":"6","unstructured":"[6] P. Eades, \u201cA heuristic for graph drawing,\u201d Congressus Numerantium, vol.42, pp.149-160, 1984."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Kamada and S. Kawai, \u201cAn algorithm for drawing general undirected graphs,\u201d Inf. Process. Lett., vol.31, no.1, pp.7-15, 1989. 10.1016\/0020-0190(89)90102-6","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R. Davidson and D. Harel, \u201cDrawing graphs nicely using simulated annealing,\u201d ACM Trans. Graph., vol.15, no.4, pp.301-331, Oct. 1996. 10.1145\/234535.234538","DOI":"10.1145\/234535.234538"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T.M. Fruchterman and E.M. Reingold, \u201cGraph drawing by force-directed placement,\u201d Softw. Pract. Exp., vol.21, no.11, pp.1129-1164, 1991. 10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] A. Frick, A. Ludwig, and H. Mehldau, \u201cA fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration),\u201d Graph Drawing, Lecture Notes in Computer Science, vol.894, pp.388-403, 1994. 10.1007\/3-540-58950-3_393","DOI":"10.1007\/3-540-58950-3_393"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] D. Harel and Y. Koren, \u201cA fast multi-scale method for drawing large graphs,\u201d Graph Drawing, Lecture Notes in Computer Science, vol.1984, pp.183-196, 2001. 10.1007\/3-540-44541-2_18","DOI":"10.1007\/3-540-44541-2_18"},{"key":"12","unstructured":"[12] Z. Lin, N. Cao, H. Tong, F. Wang, U. Kang, and D.H. Chau, \u201cInteractive multi-resolution exploration of million node graphs,\u201d 2013."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Y. Hu, L. Shi, Y.H. Yahoo, Y. Hu, and L. Shi, \u201cVisualizing large graphs,\u201d Wiley Interdiscip. Rev. Comput. Stat., vol.7, no.2, pp.115-136, 2015. 10.1002\/wics.1343","DOI":"10.1002\/wics.1343"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] L. Nachmanson, R. Prutkin, B. Lee, N.H. Riche, A.E. Holroyd, and X. Chen, \u201cGraphmaps: Browsing large graphs as interactive maps,\u201d Graph Drawing and Network Visualization, Lecture Notes in Computer Science, vol.9411, pp.3-15, 2015. 10.1007\/978-3-319-27261-0_1","DOI":"10.1007\/978-3-319-27261-0_1"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] N. Bikakis, J. Liagouris, M. Krommyda, G. Papastefanatos, and T. Sellis, \u201cgraphVizdb: A scalable platform for interactive large graph visualization,\u201d 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp.1342-1345, 2016. 10.1109\/icde.2016.7498340","DOI":"10.1109\/ICDE.2016.7498340"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] C. Vehlow, J. Hasenauer, F.J. Theis, and D. Weiskopf, \u201cVisualizing edge-edge relations in graphs,\u201d 2013 IEEE Pacific Visualization Symposium (PacificVis), vol.2, pp.201-208, 2013. 10.1109\/pacificvis.2013.6596146","DOI":"10.1109\/PacificVis.2013.6596146"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] A. Kobayashi, S. Kashima, H. Kurakami, and K. Ishibashi, \u201cTraffic monitoring system based on correlation between BGP messages and traffic data,\u201d IEICE Trans. Commun., vol.E94-B, no.9, pp.2532-2542, Sept. 2011. 10.1587\/transcom.e94.b.2532","DOI":"10.1587\/transcom.E94.B.2532"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M. Girvan and M.E. Newman, \u201cCommunity structure in social and biological networks,\u201d Proc. Natl. Acad. Sci., vol.99, no.12, pp.7821-7826, 2002. 10.1073\/pnas.122653799","DOI":"10.1073\/pnas.122653799"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] S. Fortunato, \u201cCommunity detection in graphs,\u201d Phys. Rep., vol.486, no.3, pp.75-174, 2010. 10.1016\/j.physrep.2009.11.002","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] F.D. Malliaros and M. Vazirgiannis, \u201cClustering and community detection in directed networks: A survey,\u201d Phys. Rep., vol.533, no.4, pp.95-142, 2013. 10.1016\/j.physrep.2013.08.002","DOI":"10.1016\/j.physrep.2013.08.002"},{"key":"21","unstructured":"[21] M.A. Porter, J.-P. Onnela, and P.J. Mucha, \u201cCommunities in Networks,\u201d Am. Math. Soc., vol.56, no.9, pp.0-26, 2009."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] S. Fortunato and D. Hric, \u201cCommunity detection in networks: A user guide,\u201d Phys. Rep., vol.659, pp.1-44, Nov. 2016. 10.1016\/j.physrep.2016.09.002","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] A.J. Alvarez, C.E. Sanz-Rodr\u00edguez, and J.L. Cabrera, \u201cWeighting dissimilarities to detect communities in networks,\u201d Phil. Trans. R. Soc. A, vol.373, no.2056, p.20150108, 2015. 10.1098\/rsta.2015.0108","DOI":"10.1098\/rsta.2015.0108"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] L. Duan, W.N. Street, Y. Liu, and H. Lu, \u201cCommunity detection in graphs through correlation,\u201d Proc. 20th ACM SIGKDD international conference on Knowledge discovery and data mining-KDD'14, pp.1376-1385, 2014. 10.1145\/2623330.2623629","DOI":"10.1145\/2623330.2623629"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] R. Guimera and L.A.N. Amaral, \u201cFunctional cartography of complex metabolic networks,\u201d Nature, vol.433, no.7028, pp.895-900, 2005. 10.1038\/nature03288","DOI":"10.1038\/nature03288"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] K. Wakita and T. Tsurumi, \u201cFinding community structure in mega-scale social networks: [extended abstract],\u201d Proc. 16th international conference on World Wide Web-WWW'07, pp.1275-1276, 2007. 10.1145\/1242572.1242805","DOI":"10.1145\/1242572.1242805"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] P. Schuetz and A. Caflisch, \u201cEfficient modularity optimization by multistep greedy algorithm and vertex mover refinement,\u201d Phys. Rev. E-Stat. Nonlinear, Soft Matter Phys., vol.77, no.4, p.46112, 2008. 10.1103\/physreve.77.046112","DOI":"10.1103\/PhysRevE.77.046112"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] V.D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, \u201cFast unfolding of communities in large networks,\u201d J. Stat. Mech. Theory Exp., vol.2008, no.10, p.P10008, 2008. 10.1088\/1742-5468\/2008\/10\/p10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"29","unstructured":"[29] \u201cStanford Large Network Dataset Collection,\u201d [Online]. Available: http:\/\/snap.stanford.edu\/data\/index.html. [Accessed: 11-Sep-2017]."},{"key":"30","unstructured":"[30] \u201cChinaVis 2016,\u201d [Online]. Available: http:\/\/chinavis.org\/2016\/challenge.html. [Accessed: 11-Sep-2017]."},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] M. Jacomy, T. Venturini, S. Heymann, M. Bastian, T. Venturini, M. Bastian, S. Heymann, and M. Bastian, \u201cForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software,\u201d PLoS One, vol.9, no.6, pp.1-12, 2014. 10.1371\/journal.pone.0098679","DOI":"10.1371\/journal.pone.0098679"},{"key":"32","unstructured":"[32] M. Jacomy, S. Heymann, T. Venturini, and M. Bastian, \u201cForceatlas2, a continuous graph layout algorithm for handy network visualization,\u201d Medialab Cent. Res., vol.560, 2011."},{"key":"33","unstructured":"[33] Y. Hu, \u201cEfficient, high-quality force-directed graph drawing,\u201d Math. J., vol.10, no.1, pp.37-71, 2005. 10.1007\/978-3-540-31843-9_46"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] A. Clauset, M.E. J.E. Newman, and C. Moore, \u201cFinding community structure in very large networks,\u201d Phys. Rev. E, vol.70, no.6, p.66111, Dec. 2004. 10.1103\/physreve.70.066111","DOI":"10.1103\/PhysRevE.70.066111"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E101.B\/4\/E101.B_2017EBP3303\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:01:18Z","timestamp":1704898878000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E101.B\/4\/E101.B_2017EBP3303\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2017ebp3303","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}