{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T02:06:01Z","timestamp":1706666761021},"reference-count":44,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,9,1]]},"DOI":"10.1587\/transinf.2021edp7260","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T22:22:54Z","timestamp":1661984574000},"page":"1610-1619","source":"Crossref","is-referenced-by-count":1,"title":["BCGL: Binary Classification-Based Graph Layout"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Kai","family":"YAN","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]},{"given":"Tiejun","family":"ZHAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]},{"given":"Muyun","family":"YANG","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Hu and L. Shi, \u201cVisualizing large graphs,\u201d Wiley Interdisciplinary Reviews: Computational Statistics, vol.7, no.2, pp.115-136, 2015. 10.1002\/wics.1343","DOI":"10.1002\/wics.1343"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] O.H. Kwon, T. Crnovrsanin, and K.L. Ma, \u201cWhat would a graph look like in this layout? a machine learning approach to large graph visualization,\u201d IEEE Trans. Vis. Comput. Graphics, vol.24, no.1, pp.478-488, Jan. 2017. 10.1109\/TVCG.2017.2743858","DOI":"10.1109\/TVCG.2017.2743858"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] B. Lee, C. Plaisant, C.S. Parr, J.D. Fekete, and N. Henry, \u201cTask taxonomy for graph visualization,\u201d Proc. 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, pp.1-5, May 2006. 10.1145\/1168149.1168168","DOI":"10.1145\/1168149.1168168"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] T. Von Landesberger, A. Kuijper, T. Schreck, J. Kohlhammer, J.J. van Wijk, J.D. Fekete, and D.W. Fellner, \u201cVisual analysis of large graphs: state-of-the-art and future research challenges,\u201d Computer Graphics Forum, vol.30, no.6, pp.1719-1749, Wiley Online Library, Sept. 2011. 10.1111\/j.1467-8659.2011.01898.x","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G. Xu, Z. Song, Y. Wang, D. Lin, J. Chen, T. Mao, and W. Xu, \u201cA graph layout framework combining t-distributed neighbor retrieval visualizer and energy models,\u201d IEEE Access, vol.7, pp.27515-27525, 2019. 10.1109\/ACCESS.2019.2900358","DOI":"10.1109\/ACCESS.2019.2900358"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J.F. Kruiger, P.E. Rauber, R.M. Martins, A. Kerren, S. Kobourov, and A.C. Telea, \u201cGraph layouts by t-sne,\u201d Computer Graphics Forum, vol.36, no.3, pp.283-294, Wiley Online Library, June 2017. 10.1111\/cgf.13187","DOI":"10.1111\/cgf.13187"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Kamada and S. Kawai, \u201cAn algorithm for drawing general undirected graphs,\u201d Information Processing Letters, vol.31, no.1, pp.7-15, April 1989. 10.1016\/0020-0190(89)90102-6","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T.M.J. Fruchterman and E.M. Reingold, \u201cGraph drawing by force-directed placement,\u201d Software: Practice and Experience, vol.21, no.11, pp.1129-1164, Nov. 1991. 10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J.B. Kruskal, \u201cMultidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis,\u201d Psychometrika, vol.29, no.1, pp.1-27, 1964. 10.1007\/BF02289565","DOI":"10.1007\/BF02289565"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Harel and Y. Koren, \u201cGraph drawing by high-dimensional embedding,\u201d Int. Symp. Graph Drawing, pp.207-219, Springer, 2002. 10.1007\/3-540-36151-0_20","DOI":"10.1007\/3-540-36151-0_20"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] U. Brandes and C. Pich, \u201cEigensolver methods for progressive multidimensional scaling of large data,\u201d Int. Symp. Graph Drawing, pp.42-53, Springer, 2006. 10.1007\/978-3-540-70904-6_6","DOI":"10.1007\/978-3-540-70904-6_6"},{"key":"12","unstructured":"[12] C. McGrath, J. Blythe, and D. Krackhardt, \u201cSeeing groups in graph layouts,\u201d Connections, vol.19, no.2, pp.22-29, 1996."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] C.Y.J. Peng, K.L. Lee, and G.M. Ingersoll, \u201cAn introduction to logistic regression analysis and reporting,\u201d The journal of educational research, vol.96, no.1, pp.3-14, April 2002. 10.1080\/00220670209598786","DOI":"10.1080\/00220670209598786"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] R. Tamassia, Handbook of graph drawing and visualization, CRC press, 2013. 10.1201\/b15385","DOI":"10.1201\/b15385"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] P. Eades and K. Klein, \u201cGraph visualization,\u201d in Graph Data Management, pp.33-70, Springer, 2018. 10.1007\/978-3-319-96193-4_2","DOI":"10.1007\/978-3-319-96193-4_2"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] W.T. Tutte, \u201cHow to draw a graph,\u201d Proc. London Mathematical Society, vol.3, no.1, pp.743-767, 1963. 10.1112\/plms\/s3-13.1.743","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] E.R. Gansner, Y. Koren, and S. North, \u201cGraph drawing by stress majorization,\u201d Int. Symp. Graph Drawing, pp.239-250, Springer, 2004. 10.1007\/978-3-540-31843-9_25","DOI":"10.1007\/978-3-540-31843-9_25"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M. Ortmann, M. Klimenta, and U. Brandes, \u201cA sparse stress model,\u201d Int. Symp. Graph Drawing and Network Visualization, pp.18-32, Springer, 2016. 10.1007\/978-3-319-50106-2_2","DOI":"10.1007\/978-3-319-50106-2_2"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] E.R. Gansner, Y. Hu, and S. North, \u201cA maxent-stress model for graph layout,\u201d IEEE Trans. Vis. Comput. Graphics, vol.19, no.6, pp.927-940, June 2012. 10.1109\/TVCG.2012.299","DOI":"10.1109\/TVCG.2012.299"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] M. Khoury, Y. Hu, S. Krishnan, and C. Scheidegger, \u201cDrawing large graphs by low-rank stress majorization,\u201d Computer Graphics Forum, 31, no.3pt1, pp.975-984, Wiley Online Library, June 2012. 10.1111\/j.1467-8659.2012.03090.x","DOI":"10.1111\/j.1467-8659.2012.03090.x"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J.X. Zheng, S. Pawar, and D.F.M. Goodman, \u201cGraph drawing by stochastic gradient descent,\u201d IEEE Trans. Vis. Comput. Graphics, vol.25, no.9, pp.2738-2748, Sept. 2018. 10.1109\/TVCG.2018.2859997","DOI":"10.1109\/TVCG.2018.2859997"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Jacomy, T. Venturini, 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, p.e98679, June 2014. 10.1371\/journal.pone.0098679","DOI":"10.1371\/journal.pone.0098679"},{"key":"23","unstructured":"[23] Y. Hu, \u201cEfficient, high-quality force-directed graph drawing,\u201d Mathematica Journal, vol.10, no.1, pp.37-71, 2005."},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] P. Gajer and S.G. Kobourov, \u201cGrip: Graph drawing with intelligent placement,\u201d J. Graph Algorithms and Applications, vol.6, no.3, pp.203-224, 2004. 10.1142\/9789812796608_0011","DOI":"10.1142\/9789812796608_0011"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] S. Hachul and M. J\u00fcnger, \u201cDrawing large graphs with a potential-field-based multilevel algorithm,\u201d Int. Symp. Graph Drawing, pp.285-295, Springer, 2004. 10.1007\/978-3-540-31843-9_29","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] H. Meyerhenke, M. N\u00f6llenburg, and C. Schulz, \u201cDrawing large graphs by multilevel maxent-stress optimization,\u201d IEEE Trans. Vis. Comput. Graphics, vol.24, no.5, pp.1814-1827, May 2017. 10.1109\/TVCG.2017.2689016","DOI":"10.1109\/TVCG.2017.2689016"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] A. Arleo, W. Didimo, G. Liotta, and F. Montecchiani, \u201cA distributed multilevel force-directed algorithm,\u201d IEEE Trans. Parallel Distrib. Syst., vol.30, no.4, pp.754-765, April 2018. 10.1109\/TPDS.2018.2869805","DOI":"10.1109\/TPDS.2018.2869805"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] J. Hua, M.L. Huang, and G. Wang, \u201cGraph layout performance comparisons of force-directed algorithms,\u201d Int. J. Performability Engineering, vol.14, no.1, pp.67-76, 2018. 10.23940\/ijpe.18.01.p8.6776","DOI":"10.23940\/ijpe.18.01.p8.6776"},{"key":"29","unstructured":"[29] L. Van der Maaten and G. Hinton, \u201cVisualizing data using t-sne,\u201d J. Mach. Learn. Research, vol.9, no.11, pp.2579-2605, 2008."},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] B. Han, Y. Wei, and J. Dou, \u201cGraph layout based on network embedding and improved dimensionality reduction,\u201d 2020 6th Int. Conf. Big Data and Information Analytics (BigDIA), pp.125-132, IEEE, 2020. 10.1109\/BigDIA51454.2020.00028","DOI":"10.1109\/BigDIA51454.2020.00028"},{"key":"31","unstructured":"[31] L. McInnes, J. Healy, and J. Melville, \u201cUmap: Uniform manifold approximation and projection for dimension reduction,\u201d stat, vol.1050, p.18, 2020."},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] M. Zhu, W. Chen, Y. Hu, Y. Hou, L. Liu, and K. Zhang, \u201cDrgraph: An efficient graph layout algorithm for large-scale graphs by dimensionality reduction,\u201d IEEE Trans. Vis. Comput. Graphics, vol.27, no.2, pp.1666-1676, Feb. 2020. 10.1109\/TVCG.2020.3030447","DOI":"10.1109\/TVCG.2020.3030447"},{"key":"33","unstructured":"[33] Y.Y. Leow, T. Laurent, and X. Bresson, \u201cGraphtsne: a visualization technique for graph-structured data,\u201d ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019."},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] O.H. Kwon and K.L. Ma, \u201cA deep generative model for graph layout,\u201d IEEE Trans. Vis. Comput. Graphics, vol.26, no.1, pp.665-675, Jan. 2019. 10.1109\/TVCG.2019.2934396","DOI":"10.1109\/TVCG.2019.2934396"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] Y. Wang, Z. Jin, Q. Wang, W. Cui, T. Ma, and H. Qu, \u201cDeepdrawing: A deep learning approach to graph drawing,\u201d IEEE Trans. Vis. Comput. Graphics, vol.26, no.1, pp.676-686, Jan. 2019. 10.1109\/TVCG.2019.2934798","DOI":"10.1109\/TVCG.2019.2934798"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] M.K. Rahman, M.H. Sujon, and A. Azad, \u201cForce2vec: Parallel force-directed graph embedding,\u201d 2020 IEEE Int. Conf. Data Mining (ICDM), pp.442-451, IEEE, 2020. 10.1109\/ICDM50108.2020.00053","DOI":"10.1109\/ICDM50108.2020.00053"},{"key":"37","doi-asserted-by":"publisher","unstructured":"[37] P. Wang, B. Xu, Y. Wu, and X. Zhou, \u201cLink prediction in social networks: the state-of-the-art,\u201d Science China Information Sciences, vol.58, no.1, pp.1-38, 2015. 10.1007\/s11432-014-5237-y","DOI":"10.1007\/s11432-014-5237-y"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] F. De Luca, M.I. Hossain, S. Kobourov, \u201cSymmetry detection and classification in drawings of graphs,\u201d Int. Symp. Graph Drawing and Network Visualization, pp.499-513, Springer, 2019. 10.1007\/978-3-030-35802-0_38","DOI":"10.1007\/978-3-030-35802-0_38"},{"key":"39","doi-asserted-by":"publisher","unstructured":"[39] T.A. Davis and Y. Hu, \u201cThe university of florida sparse matrix collection,\u201d ACM Trans. Mathematical Software (TOMS), vol.38, no.1, pp.1-25, 2011. 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"40","unstructured":"[40] M. Chimani, C. Gutwenger, M. J\u00fcnger, G.W. Klau, K. Klein, and P. Mutzel, \u201cThe open graph drawing framework (ogdf),\u201d in Handbook of Graph Drawing And Visualization, vol.2011, pp.543-569, 2013. 10.1201\/b15385"},{"key":"41","unstructured":"[41] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Z. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, \u201cPytorch: An imperative style, high-performance deep learning library,\u201d Advances in Neural Information Processing Systems, vol.32, pp.8026-8037, 2019."},{"key":"42","doi-asserted-by":"publisher","unstructured":"[42] H.C. Purchase, \u201cMetrics for graph drawing aesthetics,\u201d J. Visual Languages & Computing, vol.13, no.5, pp.501-516, Oct. 2002. 10.1006\/jvlc.2002.0232","DOI":"10.1006\/jvlc.2002.0232"},{"key":"43","doi-asserted-by":"publisher","unstructured":"[43] J.D. Hunter, \u201cMatplotlib: A 2d graphics environment,\u201d Computing in science & engineering, vol.9, no.3, pp.90-95, May-June 2007. 10.1109\/MCSE.2007.55","DOI":"10.1109\/MCSE.2007.55"},{"key":"44","unstructured":"[44] A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer, \u201cAutomatic differentiation in pytorch,\u201d 2017."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/9\/E105.D_2021EDP7260\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T04:54:56Z","timestamp":1662180896000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/9\/E105.D_2021EDP7260\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,1]]},"references-count":44,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021edp7260","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,1]]},"article-number":"2021EDP7260"}}