{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T06:28:01Z","timestamp":1747117681450,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-023-16814-8","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T07:10:05Z","timestamp":1694761805000},"page":"31233-31249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Estimating feature importance in circuit network using machine learning"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2150-303X","authenticated-orcid":false,"given":"Tingyuan","family":"Nie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzhi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuyuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"issue":"1","key":"16814_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1038\/s41928-017-0005-9","volume":"1","author":"HN Khan","year":"2018","unstructured":"Khan HN, Hounshell DA, Fuchs ER (2018) Science and research policy at the end of Moore\u2019s law. Nat Electron 1(1):14\u201321","journal-title":"Nat Electron"},{"key":"16814_CR2","doi-asserted-by":"crossref","unstructured":"DHuys O, Vicente R, Erneux T, Danckaert J, Fischer I (2008) Synchronization properties of network motifs: Influence of coupling delay and symmetry. Chaos: An Interdisciplinary Journal of Nonlinear Science 18(3)","DOI":"10.1063\/1.2953582"},{"issue":"14","key":"16814_CR3","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200","journal-title":"Phys Rev Lett"},{"issue":"1","key":"16814_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1038\/nphys1130","volume":"5","author":"M Boguna","year":"2009","unstructured":"Boguna M, Krioukov D, Claffy KC (2009) Navigability of complex networks. Nat Phys 5(1):74\u201380","journal-title":"Nat Phys"},{"issue":"2","key":"16814_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.020301","volume":"101","author":"O Smith","year":"2020","unstructured":"Smith O, Crowe J, Farcot E, O\u2019Dea RD, Hopcraft KI (2020) Cascading failures in networks of heterogeneous node behavior. Phys Rev E 101(2):020301","journal-title":"Phys Rev E"},{"issue":"18","key":"16814_CR6","doi-asserted-by":"publisher","first-page":"25205","DOI":"10.1007\/s11042-022-12409-x","volume":"81","author":"ST Shishavan","year":"2022","unstructured":"Shishavan ST, Gharehchopogh FS (2022) An improved cuckoo search optimization algorithm with genetic algorithm for community detection in complex networks. Multimed Tools Appl 81(18):25205\u201325231","journal-title":"Multimed Tools Appl"},{"issue":"1\u20137","key":"16814_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Sys 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Sys"},{"issue":"5","key":"16814_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5):604\u2013632","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"16814_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TCBB.2013.2295318","volume":"11","author":"X Tang","year":"2013","unstructured":"Tang X, Wang J, Zhong J, Pan Y (2013) Predicting essential proteins based on weighted degree centrality. IEEE\/ACM Trans Comput Biol Bioinforma 11(2):407\u2013418","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"issue":"2","key":"16814_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","volume":"38","author":"M Barthelemy","year":"2004","unstructured":"Barthelemy M (2004) Betweenness centrality in large complex networks. Eur Phys J B 38(2):163\u2013168","journal-title":"Eur Phys J B"},{"key":"16814_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.neucom.2018.04.086","volume":"336","author":"C Salavati","year":"2019","unstructured":"Salavati C, Abdollahpouri A, Manbari Z (2019) Ranking nodes in complex networks based on local structure and improving closeness centrality. Neurocomputing 336:36\u201345","journal-title":"Neurocomputing"},{"issue":"3","key":"16814_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"key":"16814_CR13","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.physa.2016.02.009","volume":"453","author":"T Nie","year":"2016","unstructured":"Nie T, Guo Z, Zhao K, Lu ZM (2016) Using mapping entropy to identify node centrality in complex networks. Physica A: Stat Mech Appl 453:290\u2013297","journal-title":"Physica A: Stat Mech Appl"},{"key":"16814_CR14","doi-asserted-by":"crossref","unstructured":"Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos, Solitons Fractals 110:41\u201354","DOI":"10.1016\/j.chaos.2018.03.014"},{"key":"16814_CR15","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1007\/s00607-018-0659-9","volume":"101","author":"N Samadi","year":"2019","unstructured":"Samadi N, Bouyer A (2019) Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks. Computing 101:1147\u20131175","journal-title":"Computing"},{"issue":"5","key":"16814_CR16","first-page":"39","volume":"5","author":"DEJ Wang","year":"2006","unstructured":"Wang DEJ (2006) Fast approximation of centrality. Graph Algoritm Appl 5(5):39","journal-title":"Graph Algoritm Appl"},{"key":"16814_CR17","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Computing classic closeness centrality, at scale. In the second ACM conference on Online social networks, pp 37\u201350","DOI":"10.1145\/2660460.2660465"},{"key":"16814_CR18","doi-asserted-by":"crossref","unstructured":"Rattigan MJ, Maier M, Jensen D (2006) Using structure indices for efficient approximation of network properties. In the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 357\u2013366","DOI":"10.1145\/1150402.1150443"},{"key":"16814_CR19","unstructured":"Saxena A, Iyengar S (2020) Centrality measures in complex networks: A survey. arXiv preprint arXiv:2011.07190"},{"issue":"5","key":"16814_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3237192","volume":"51","author":"F Grando","year":"2018","unstructured":"Grando F, Granville LZ, Lamb LC (2018) Machine learning in network centrality measures: Tutorial and outlook. ACM Comput Surv (CSUR) 51(5):1\u201332","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"16814_CR21","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1109\/TNSE.2020.3035352","volume":"8","author":"MR Mendona","year":"2020","unstructured":"Mendona MR, Barreto AM, Ziviani A (2020) Approximating network centrality measures using node embedding and machine learning. IEEE Trans Netw Sci Eng 8(1):220\u2013230","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"16814_CR22","doi-asserted-by":"crossref","unstructured":"i Cancho RF, Janssen C, Sol RV, (2001) Topology of technology graphs: Small world patterns in electronic circuits. Phys Rev E 64(4):046119","DOI":"10.1103\/PhysRevE.64.046119"},{"issue":"55","key":"16814_CR23","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1098\/rsif.2010.0212","volume":"8","author":"K Raman","year":"2011","unstructured":"Raman K, Wagner A (2011) The evolvability of programmable hardware. J R Soc Interface 8(55):269\u2013281","journal-title":"J R Soc Interface"},{"key":"16814_CR24","doi-asserted-by":"publisher","first-page":"72683","DOI":"10.1109\/ACCESS.2020.2985736","volume":"8","author":"T Nie","year":"2020","unstructured":"Nie T, Fan B, Zhu Z, Zhou L (2020) Performance and Correlations of Weighted Circuit Networks. IEEE Access 8:72683\u201372693","journal-title":"IEEE Access"},{"issue":"1","key":"16814_CR25","first-page":"115","volume":"3","author":"K Aggarwal","year":"2022","unstructured":"Aggarwal K, Mijwil MM, Al-Mistarehi AH, Alomari S, Gk M, Alaabdin AMZ, Abdulrhman SH (2022) Has the future started? The current growth of artificial intelligence, machine learning, and deep learning. Iraqi J Comp Sci Math 3(1):115\u2013123","journal-title":"Iraqi J Comp Sci Math"},{"issue":"5","key":"16814_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3451179","volume":"26","author":"G Huang","year":"2021","unstructured":"Huang G, Hu J, He Y, Liu J, Ma M, Shen Z et al (2021) Machine learning for electronic design automation: A survey. ACM Trans Des Autom Electron Syst (TODAES) 26(5):1\u201346","journal-title":"ACM Trans Des Autom Electron Syst (TODAES)"},{"issue":"6","key":"16814_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.065103","volume":"71","author":"JP Onnela","year":"2005","unstructured":"Onnela JP, Saramki J, Kertsz J, Kaski K (2005) Intensity and coherence of motifs in weighted complex networks. Phys Rev E 71(6):065103","journal-title":"Phys Rev E"},{"key":"16814_CR28","doi-asserted-by":"crossref","unstructured":"Pretorius A, Bierman S, Steel SJ (2016) A meta-analysis of research in random forests for classification. In 2016 Pattern Recognition Association of South Africa and Robotics and Mechatronics International Conference (PRASA-RobMech), pp 1\u20136","DOI":"10.1109\/RoboMech.2016.7813171"},{"issue":"3","key":"16814_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1177\/096228029500400303","volume":"4","author":"JH Friedman","year":"1995","unstructured":"Friedman JH, Roosen CB (1995) An introduction to multivariate adaptive regression splines. Stat Methods Med Res 4(3):197\u2013217","journal-title":"Stat Methods Med Res"},{"key":"16814_CR30","unstructured":"Hua Y, Guo J, Zhao H (2015) Deep belief networks and deep learning. In 2015 International Conference on Intelligent Computing and Internet of Things, pp 1\u20134"},{"issue":"1","key":"16814_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-7012(00)00201-3","volume":"43","author":"IA Basheer","year":"2000","unstructured":"Basheer IA, Hajmeer M (2000) Artificial neural networks: fundamentals, computing, design, and application. J Microbiol Meth 43(1):3\u201331","journal-title":"J Microbiol Meth"},{"issue":"7","key":"16814_CR32","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TCAD.2005.855969","volume":"25","author":"JA Roy","year":"2006","unstructured":"Roy JA, Adya SN, Papa DA, Markov IL (2006) Min-cut floorplacement. IEEE Trans Comput Aided Des Integr Circ Sys 25(7):1313\u20131326","journal-title":"IEEE Trans Comput Aided Des Integr Circ Sys"},{"key":"16814_CR33","doi-asserted-by":"crossref","unstructured":"Yang X, Choi BK, Sarrafzadeh M (2002) Routability driven white space allocation for fixed-die standard-cell placement. In 2002 international symposium on Physical design, pp 42\u201347","DOI":"10.1145\/505388.505400"},{"key":"16814_CR34","doi-asserted-by":"crossref","unstructured":"Viswanathan N, Pan M, Chu C (2007) FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In 2007 Asia and South Pacific Design Automation Conference, pp 135\u2013140","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"16814_CR35","doi-asserted-by":"crossref","unstructured":"Khatkhate A, Li C, Agnihotri AR, Yildiz MC, Ono S, Koh CK, Madden PH (2004) Recursive bisection based mixed block placement. In 2004 international symposium on Physical design, pp 84\u201389","DOI":"10.1145\/981066.981084"},{"key":"16814_CR36","doi-asserted-by":"crossref","unstructured":"Chan TF, Cong J, Shinnerl JR, Sze K, Xie M (2006) mPL6: Enhanced multilevel mixed-size placement. In 2006 international symposium on Physical design, pp 212\u2013214","DOI":"10.1145\/1123008.1123055"},{"issue":"7","key":"16814_CR37","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/TCAD.2008.923063","volume":"27","author":"TC Chen","year":"2008","unstructured":"Chen TC, Jiang ZW, Hsu TC, Chen HC, Chang YW (2008) NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans Comput Aided Des Integr Circ Sys 27(7):1228\u20131240","journal-title":"IEEE Trans Comput Aided Des Integr Circ Sys"},{"key":"16814_CR38","doi-asserted-by":"crossref","unstructured":"Hu J, Roy JA, Markov IL (2010) Completing high-quality global routes. In the 19th international symposium on Physical design, pp 35\u201341","DOI":"10.1145\/1735023.1735035"},{"key":"16814_CR39","doi-asserted-by":"crossref","unstructured":"Kapre N, Chandrashekaran B, Ng H, Teo K (2015) Driving timing convergence of FPGA designs through machine learning and cloud computing. In 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines, pp 119\u2013126","DOI":"10.1109\/FCCM.2015.36"},{"issue":"5","key":"16814_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3373269","volume":"25","author":"SH Al-Hyari","year":"2020","unstructured":"Al-Hyari SH, Foxcroft A, Martin J, Noel T, Grewal DG, Areibi S (2020) Machine learning for congestion management and routability prediction within FPGA placement. ACM Trans Des Autom Electron Syst (TODAES) 25(5):1\u201325","journal-title":"ACM Trans Des Autom Electron Syst (TODAES)"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-16814-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-16814-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-16814-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T06:35:35Z","timestamp":1709879735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-16814-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,15]]},"references-count":40,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["16814"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-16814-8","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2023,9,15]]},"assertion":[{"value":"26 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2023","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}