{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T02:55:16Z","timestamp":1791082516834,"version":"4.1.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Indiana University Grand Challenge Precision Health Initiative."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10115-021-01634-9","type":"journal-article","created":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T00:03:06Z","timestamp":1642291386000},"page":"207-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Scalable force-directed graph representation learning and visualization"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8784-5406","authenticated-orcid":false,"given":"Md. Khaledur","family":"Rahman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Majedul Haque","family":"Sujon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariful","family":"Azad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,16]]},"reference":[{"key":"1634_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed A, Shervashidze N, Narayanamurthy S, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: Proceedings of WWW, pp 37\u201348","DOI":"10.1145\/2488388.2488393"},{"key":"1634_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Proceedings of PAKDD. Springer, pp 410\u2013421","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"1634_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"1634_CR4","unstructured":"Bolosky WJ, Scott ML (1993) False sharing and its effect on shared memory performance. In: 4th symposium on experimental distributed and multiprocessor systems, pp 57\u201371"},{"key":"1634_CR5","doi-asserted-by":"crossref","unstructured":"Brandes U, Pich C (2008) An experimental study on distance-based graph drawing. In: International symposium on graph drawing. Springer, pp 218\u2013229","DOI":"10.1007\/978-3-642-00219-9_21"},{"issue":"9","key":"1634_CR6","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1634_CR7","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) GraRep: learning graph representations with global structural information. In: Proceedings of CIKM, pp 891\u2013900","DOI":"10.1145\/2806416.2806512"},{"key":"1634_CR8","doi-asserted-by":"crossref","unstructured":"Chen H, Perozzi B, Hu Y, Skiena S (2018) HARP: hierarchical representation learning for networks. In: Proceedings of AAAI","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"1634_CR9","unstructured":"De\u00a0Luca F, Hossain I, Kobourov S, B\u00f6rner K (2019) Multi-level tree based approach for interactive graph visualization with semantic zoom, arXiv preprint arXiv:1906.05996"},{"issue":"2","key":"1634_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1112\/S0025579300005222","volume":"12","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s P, Harary F, Tutte WT (1965) On the dimension of a graph. Mathematika 12(2):118\u2013122","journal-title":"Mathematika"},{"key":"1634_CR11","doi-asserted-by":"crossref","unstructured":"Fruchterman TM, Reingold EM (1991) Graph drawing by force-directed placement, Softw Pract Exp 21(11):1129\u20131164","DOI":"10.1002\/spe.4380211102"},{"key":"1634_CR12","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of KDD. ACM, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"1634_CR13","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of NIPS, pp 1024\u20131034"},{"key":"1634_CR14","doi-asserted-by":"crossref","unstructured":"Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C Li L (2012) RolX: structural role extraction & mining in large graphs. In: Proceedings of KDD, pp 1231\u20131239","DOI":"10.2172\/1111134"},{"key":"1634_CR15","doi-asserted-by":"crossref","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software. PloS One 9(6)","DOI":"10.1371\/journal.pone.0098679"},{"key":"1634_CR16","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks, arXiv preprint arXiv:1609.02907"},{"issue":"14","key":"1634_CR17","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1016\/j.patrec.2010.04.013","volume":"31","author":"JA Lee","year":"2010","unstructured":"Lee JA, Verleysen M (2010) Scale-independent quality criteria for dimensionality reduction. Pattern Recognit Lett 31(14):2248\u20132257","journal-title":"Pattern Recognit Lett"},{"key":"1634_CR18","unstructured":"Luo D, Nie F, Huang H, Ding CH (2011) Cauchy graph embedding. In: Proceedings of ICML, pp 553\u2013560"},{"key":"1634_CR19","unstructured":"Maaten Lvd, Hinton G (2008) Visualizing data using t-SNE, J Mach Learn Res 9(Nov):2579\u20132605"},{"key":"1634_CR20","doi-asserted-by":"crossref","unstructured":"Martin S, Brown WM, Klavans R, Boyack KW (2011) Openord: an open-source toolbox for large graph layout. In: Visualization and data analysis 2011, Vol 7868, International society for optics and photonics, p 786806","DOI":"10.1117\/12.871402"},{"key":"1634_CR21","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Proceedings of NIPS, pp 3111\u20133119"},{"key":"1634_CR22","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web., Technical report, Stanford InfoLab"},{"key":"1634_CR23","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: online learning of social representations. In: Proceedings of KDD, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"1634_CR24","doi-asserted-by":"crossref","unstructured":"Rahman MK, Sujon MH, Azad A (2020a) BatchLayout: a batch-parallel force-directed graph layout algorithm in shared memory. In: Proceedings of PacificVis. IEEE, pp 16\u201325","DOI":"10.1109\/PacificVis48177.2020.3756"},{"key":"1634_CR25","doi-asserted-by":"crossref","unstructured":"Rahman MK, Sujon MH, Azad A (2020b), Force2Vec: parallel force-directed graph embedding. In: 20th IEEE international conference on data mining (IEEE ICDM)","DOI":"10.1109\/ICDM50108.2020.00053"},{"key":"1634_CR26","unstructured":"Recht B, Re C, Wright S, Niu F (2011) Hogwild: a lock-free approach to parallelizing stochastic gradient descent. In: Proceedings of NIPS, pp 693\u2013701"},{"key":"1634_CR27","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: Proceedings of KDD, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"1634_CR28","doi-asserted-by":"crossref","unstructured":"Tang J, Liu J, Zhang M, Mei Q (2016) Visualizing large-scale and high-dimensional data. In: Proceedings of WWW, pp 287\u2013297","DOI":"10.1145\/2872427.2883041"},{"key":"1634_CR29","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: large-scale information network embedding. In: Proceedings of WWW, pp 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"1634_CR30","doi-asserted-by":"crossref","unstructured":"Tsitsulin A, Mottin D, Karras P, M\u00fcller E (2018) Verse: versatile graph embeddings from similarity measures. In: Proceedings of WWW, pp 539\u2013548","DOI":"10.1145\/3178876.3186120"},{"issue":"1","key":"1634_CR31","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"WT Tutte","year":"1963","unstructured":"Tutte WT (1963) How to draw a graph. Proc Lond Math Soc 3(1):743\u2013767","journal-title":"Proc Lond Math Soc"},{"issue":"3","key":"1634_CR32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2006","unstructured":"Walshaw C (2006) A multilevel algorithm for force-directed graph-drawing. J Graph Algorithms Appl 7(3):253\u2013285","journal-title":"J Graph Algorithms Appl"},{"issue":"1\u20132","key":"1634_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-8191(00)00087-9","volume":"27","author":"RC Whaley","year":"2001","unstructured":"Whaley RC, Petitet A, Dongarra JJ (2001) Automated empirical optimization of software and the ATLAS project. Parallel Comput 27(1\u20132):3\u201335","journal-title":"Parallel Comput"},{"key":"1634_CR34","unstructured":"Zeng H, Zhou H, Srivastava A, Kannan R, Prasanna V (2019) GraphSAINT: graph sampling based inductive learning method, arXiv preprint arXiv:1907.04931"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01634-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01634-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01634-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T03:34:52Z","timestamp":1674444892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01634-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1634"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01634-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"26 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}