{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:44:48Z","timestamp":1752461088330,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s41060-023-00495-5","type":"journal-article","created":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T21:13:56Z","timestamp":1706908436000},"page":"283-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How to create graphs in hardware-constrained environments? Choosing the best creation approach via machine learning-based predictive models"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6303-7180","authenticated-orcid":false,"given":"Mariem","family":"Loukil","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-5961","authenticated-orcid":false,"given":"Lilia","family":"Sfaxi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5736-4137","authenticated-orcid":false,"given":"Riadh","family":"Robbana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,2]]},"reference":[{"key":"495_CR1","unstructured":"Ageyev, D., Ignatenko, A., Wehbe, F.: Design of information and telecommunication systems with the usage of the multi-layer graph model. In: 2013 12th International Conference on the Experience of Designing and Application of CAD Systems in Microelectronics (CADSM), pp. 1\u20134. IEEE (2013)"},{"key":"495_CR2","volume-title":"Design of Experiments for Engineers and Scientists","author":"J Antony","year":"2023","unstructured":"Antony, J.: Design of Experiments for Engineers and Scientists. Elsevier, Amsterdam (2023)"},{"issue":"2","key":"495_CR3","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1002\/qre.3025","volume":"38","author":"R Arboretti","year":"2022","unstructured":"Arboretti, R., Ceccato, R., Pegoraro, L., et al.: Design of experiments and machine learning for product innovation: a systematic literature review. Qual. Reliab. Eng. Int. 38(2), 1131\u20131156 (2022)","journal-title":"Qual. Reliab. Eng. Int."},{"key":"495_CR4","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1007\/s11227-020-03307-w","volume":"77","author":"D Ardagna","year":"2021","unstructured":"Ardagna, D., Barbierato, E., Gianniti, E., et al.: Predicting the performance of big data applications on the cloud. J. Supercomput. 77, 1321\u20131353 (2021)","journal-title":"J. Supercomput."},{"key":"495_CR5","unstructured":"Arifuzzaman, S., Khan, M.: Fast parallel conversion of edge list to adjacency list for large-scale graphs. In: Proceedings of the Symposium on High Performance Computing, pp. 17\u201324 (2015)"},{"key":"495_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105766","volume":"147","author":"S Azadifar","year":"2022","unstructured":"Azadifar, S., Rostami, M., Berahmand, K., et al.: Graph-based relevancy-redundancy gene selection method for cancer diagnosis. Comput. Biol. Med. 147, 105766 (2022)","journal-title":"Comput. Biol. Med."},{"issue":"1","key":"495_CR7","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0016591","volume":"6","author":"P Bajardi","year":"2011","unstructured":"Bajardi, P., Poletto, C., Ramasco, J.J., et al.: Human mobility networks, travel restrictions, and the global spread of 2009 h1n1 pandemic. PLoS ONE 6(1), e16591 (2011)","journal-title":"PLoS ONE"},{"key":"495_CR8","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., P\u00f3sfai, M.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"495_CR9","first-page":"1736","volume-title":"Graph Theory","author":"N Biggs","year":"1986","unstructured":"Biggs, N., Lloyd, E.K., Wilson, R.J.: Graph Theory, pp. 1736\u20131936. Oxford University Press (1986)"},{"key":"495_CR10","unstructured":"Carbone, P., Katsifodimos, A., Ewen, S., et\u00a0al.: Apache flink: stream and batch processing in a single engine. Bull. IEEE Comput. Soc. Tech. Committee Data Eng. 36(4) (2015)"},{"issue":"2","key":"495_CR11","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.31801\/cfsuasmas.800452","volume":"70","author":"M \u00c7avu\u015f","year":"2021","unstructured":"\u00c7avu\u015f, M., Yazici, B., Sezer, A.: A revised generalized f-test for testing the equality of group means under non-normality caused by skewness. Commun. Facul. of Sci. Univ. Ankara Ser. A1 Math. Stat. 70(2), 1036\u20131054 (2021)","journal-title":"Commun. Facul. of Sci. Univ. Ankara Ser. A1 Math. Stat."},{"issue":"1","key":"495_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00443-9","volume":"8","author":"ME Coimbra","year":"2021","unstructured":"Coimbra, M.E., Francisco, A.P., Veiga, L.: An analysis of the graph processing landscape. J. Big Data 8(1), 1\u201341 (2021)","journal-title":"J. Big Data"},{"issue":"1","key":"495_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das, K., Samanta, S., Pal, M.: Study on centrality measures in social networks: a survey. Soc. Netw. Anal. Min. 8(1), 1\u201311 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"495_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434393","volume":"8","author":"L Dhulipala","year":"2021","unstructured":"Dhulipala, L., Blelloch, G.E., Shun, J.: Theoretically efficient parallel graph algorithms can be fast and scalable. ACM Trans. Parallel Comput. (TOPC) 8(1), 1\u201370 (2021)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"key":"495_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.3389\/fnins.2019.00585","volume":"13","author":"FV Farahani","year":"2019","unstructured":"Farahani, F.V., Karwowski, W., Lighthall, N.R.: Application of graph theory for identifying connectivity patterns in human brain networks: a systematic review. Front. Neurosci. 13, 585 (2019)","journal-title":"Front. Neurosci."},{"key":"495_CR16","doi-asserted-by":"crossref","unstructured":"Fontana, R., Molena, A., Pegoraro, L., et\u00a0al.: Design of experiments and machine learning with application to industrial experiments. In: Statistical Papers, pp. 1\u201324 (2023)","DOI":"10.1007\/s00362-023-01437-w"},{"key":"495_CR17","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., et\u00a0al.: $$\\{$$GraphX$$\\}$$: graph processing in a distributed dataflow framework. In: 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14), pp. 599\u2013613 (2014)"},{"key":"495_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, P., Goel, A., Lin, J., et\u00a0al.: Wtf: the who to follow service at twitter. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 505\u2013514 (2013)","DOI":"10.1145\/2488388.2488433"},{"issue":"9","key":"495_CR19","doi-asserted-by":"publisher","first-page":"950","DOI":"10.14778\/2777598.2777604","volume":"8","author":"M Han","year":"2015","unstructured":"Han, M., Daudjee, K.: Giraph unchained: barrierless asynchronous parallel execution in pregel-like graph processing systems. Proc. VLDB Endow. 8(9), 950\u2013961 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"495_CR20","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, S., Park, K., et\u00a0al.: Turbograph: a fast parallel graph engine handling billion-scale graphs in a single PC. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 77\u201385 (2013)","DOI":"10.1145\/2487575.2487581"},{"issue":"3","key":"495_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3199523","volume":"51","author":"S Heidari","year":"2018","unstructured":"Heidari, S., Simmhan, Y., Calheiros, R.N., et al.: Scalable graph processing frameworks: a taxonomy and open challenges. ACM Comput. Surv. (CSUR) 51(3), 1\u201353 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"495_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42005-020-0359-6","volume":"3","author":"G I\u00f1iguez","year":"2020","unstructured":"I\u00f1iguez, G., Battiston, F., Karsai, M.: Bridging the gap between graphs and networks. Commun. Phys. 3(1), 1\u20135 (2020)","journal-title":"Commun. Phys."},{"issue":"2","key":"495_CR23","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160863","volume":"4","author":"M Jalili","year":"2017","unstructured":"Jalili, M., Orouskhani, Y., Asgari, M., et al.: Link prediction in multiplex online social networks. R. Soc. Open Sci. 4(2), 160863 (2017)","journal-title":"R. Soc. Open Sci."},{"key":"495_CR24","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Vora, K., Gupta, R., et\u00a0al.: Cusha: vertex-centric graph processing on GPUS. In: Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing, pp. 239\u2013252 (2014)","DOI":"10.1145\/2600212.2600227"},{"key":"495_CR25","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M,. Kumar, R., Raghavan, P., et\u00a0al.: The web as a graph: measurements, models, and methods. In: International Computing and Combinatorics Conference, pp. 1\u201317. Springer (1999)","DOI":"10.1007\/3-540-48686-0_1"},{"key":"495_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3389\/fbioe.2020.00034","volume":"8","author":"M Koutrouli","year":"2020","unstructured":"Koutrouli, M., Karatzas, E., Paez-Espino, D., et al.: A guide to conquer the biological network era using graph theory. Front. Bioeng. Biotechnol. 8, 34 (2020)","journal-title":"Front. Bioeng. Biotechnol."},{"issue":"260","key":"495_CR27","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1080\/01621459.1952.10483441","volume":"47","author":"WH Kruskal","year":"1952","unstructured":"Kruskal, W.H., Wallis, W.A.: Use of ranks in one-criterion variance analysis. J. Am. Stat. Assoc. 47(260), 583\u2013621 (1952)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"495_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s41060-021-00303-y","volume":"13","author":"DS Kumar","year":"2022","unstructured":"Kumar, D.S., D\u2019Mello, D.A.: Dpiscan: distributed and parallel architecture with indexing for structural clustering of massive dynamic graphs. Int. J. Data Sci. Anal. 13(3), 199\u2013223 (2022)","journal-title":"Int. J. Data Sci. Anal."},{"key":"495_CR29","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., et\u00a0al.: The web as a graph. In: Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 1\u201310 (2000)","DOI":"10.1145\/335168.335170"},{"key":"495_CR30","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a PC. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), pp. 31\u201346 (2012)"},{"key":"495_CR31","unstructured":"Lan, S., Ma, Y., Huang, W., et\u00a0al.: Dstagnn: dynamic spatial-temporal aware graph neural network for traffic flow forecasting. In: International Conference on Machine Learning, PMLR, pp. 11906\u201311917 (2022)"},{"key":"495_CR32","doi-asserted-by":"crossref","unstructured":"Lannelongue, L., Grealey, J., Bateman, A., et\u00a0al.: Ten simple rules to make your computing more environmentally sustainable (2021)","DOI":"10.1371\/journal.pcbi.1009324"},{"key":"495_CR33","volume-title":"Large Networks and Graph Limits","author":"L Lov\u00e1sz","year":"2012","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits, vol. 60. American Mathematical Soc, Providence (2012)"},{"key":"495_CR34","doi-asserted-by":"crossref","unstructured":"Maass, S., Min, C., Kashyap, S., et\u00a0al.: Mosaic: processing a trillion-edge graph on a single machine. In: Proceedings of the 12th European Conference on Computer Systems, pp. 527\u2013543 (2017)","DOI":"10.1145\/3064176.3064191"},{"key":"495_CR35","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., et\u00a0al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"495_CR36","unstructured":"Malicevic, J., Lepers, B., Zwaenepoel, W.: Everything you always wanted to know about multicore graph processing but were afraid to ask. In: 2017 USENIX Annual Technical Conference (USENIX ATC 17), pp. 631\u2013643 (2017)"},{"issue":"7453","key":"495_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1038\/498255a","volume":"498","author":"V Marx","year":"2013","unstructured":"Marx, V.: The big challenges of big data. Nature 498(7453), 255\u2013260 (2013)","journal-title":"Nature"},{"key":"495_CR38","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! but at what $$\\{$$COST$$\\}$$? In: 15th Workshop on Hot Topics in Operating Systems (HotOS XV) (2015)"},{"key":"495_CR39","doi-asserted-by":"crossref","unstructured":"Rathore, M.M., Ahmad, A., Paul, A., et\u00a0al.: Exploiting real-time big data to empower smart transportation using big graphs. In: 2016 IEEE Region 10 Symposium (TENSYMP), IEEE, pp 135\u2013139 (2016)","DOI":"10.1109\/TENCONSpring.2016.7519392"},{"key":"495_CR40","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, https:\/\/networkrepository.com (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"495_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41060-021-00306-9","volume":"14","author":"S Saha","year":"2022","unstructured":"Saha, S., Gao, J., Gerlach, R.: A survey of the application of graph-based approaches in stock market analysis and prediction. Int. J. Data Sci. Anal. 14(1), 1\u201315 (2022)","journal-title":"Int. J. Data Sci. Anal."},{"key":"495_CR42","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 135\u2013146 (2013)","DOI":"10.1145\/2442516.2442530"},{"key":"495_CR43","unstructured":"Sporns, O.: Graph theory methods: applications in brain networks. Dialogues Clin. Neurosci.(2022)"},{"key":"495_CR44","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139111","volume-title":"Chemical Graph Theory","author":"N Trinajstic","year":"2018","unstructured":"Trinajstic, N.: Chemical Graph Theory. CRC Press, Boca Raton (2018)"},{"key":"495_CR45","doi-asserted-by":"crossref","unstructured":"Wang, Y., Davidson, A., Pan, Y., et\u00a0al.: Gunrock: a high-performance graph processing library on the GPU. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1\u201312 (2016)","DOI":"10.1145\/2851141.2851145"},{"issue":"3","key":"495_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494523","volume":"55","author":"N Wu","year":"2022","unstructured":"Wu, N., Xie, Y.: A survey of machine learning for computer architecture and systems. ACM Comput. Surv. (CSUR) 55(3), 1\u201339 (2022)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"495_CR47","unstructured":"Zheng, D., Mhembere, D., Burns, R., et\u00a0al.: $$\\{$$FlashGraph$$\\}$$: Processing $$\\{$$Billion-Node$$\\}$$ graphs on an array of commodity $$\\{$$SSDs$$\\}$$. In: 13th USENIX Conference on File and Storage Technologies (FAST 15), pp. 45\u201358 (2015)"},{"issue":"6","key":"495_CR48","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/TPDS.2013.111","volume":"25","author":"J Zhong","year":"2013","unstructured":"Zhong, J., He, B.: Medusa: simplified graph processing on GPUS. IEEE Trans. Parallel Distrib. Syst. 25(6), 1543\u20131552 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"495_CR49","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.future.2019.09.052","volume":"111","author":"H Zhu","year":"2020","unstructured":"Zhu, H., He, L., Leeke, M., et al.: Wolfgraph: the edge-centric graph processing on GPU. Futur. Gener. Comput. Syst. 111, 552\u2013569 (2020)","journal-title":"Futur. Gener. Comput. Syst."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-023-00495-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-023-00495-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-023-00495-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T09:15:51Z","timestamp":1738833351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-023-00495-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,2]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1007\/s41060-023-00495-5","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2024,2,2]]},"assertion":[{"value":"8 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}