{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T17:31:02Z","timestamp":1791912662872,"version":"4.3.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11042-020-09471-8","type":"journal-article","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T10:06:52Z","timestamp":1600423612000},"page":"2997-3015","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An empirical estimation for time and memory algorithm complexities: newly developed R package"],"prefix":"10.1007","volume":"80","author":[{"given":"Marc","family":"Agenis-Nevers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeraj Dhanraj","family":"Bokde","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaher Mundher","family":"Yaseen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mayur Kishor","family":"Shende","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"key":"9471_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10674-4","volume-title":"Feature selection and enhanced krill herd algorithm for text document clustering","author":"LMQ Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin"},{"key":"9471_CR2","doi-asserted-by":"crossref","unstructured":"Abualigah L (2020) Multi-verse optimizer algorithm: a comprehensive survey of its results, variants, and applications. Neural Comput Appl 1\u201321","DOI":"10.1007\/s00521-020-04839-1"},{"issue":"11","key":"9471_CR3","doi-asserted-by":"publisher","first-page":"4773","DOI":"10.1007\/s11227-017-2046-2","volume":"73","author":"LM Abualigah","year":"2017","unstructured":"Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773\u20134795","journal-title":"J Supercomput"},{"key":"9471_CR4","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.jocs.2017.07.018","volume":"25","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456\u2013466","journal-title":"J Comput Sci"},{"key":"9471_CR5","unstructured":"Agenis M (2019) Guesscompx. https:\/\/github.com\/agenis\/GuessCompx"},{"key":"9471_CR6","unstructured":"Agenis M (2019) Guesscompxperformancetests. https:\/\/github.com\/agenis\/GuessCompxPerformanceTests"},{"key":"9471_CR7","unstructured":"Agenis M, Bokde N (2019) GuessCompx: empirically estimates algorithm complexity. R package version 1.0.3. [Online]. Available: https:\/\/CRAN.R-project.org\/package=GuessCompx"},{"issue":"2","key":"9471_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TCOM.1984.1096023","volume":"32","author":"J Anderson","year":"1984","unstructured":"Anderson J, Mohan S (1984) Sequential coding algorithms: a survey and cost analysis. IEEE Trans Commun 32(2):169\u2013176","journal-title":"IEEE Trans Commun"},{"key":"9471_CR9","unstructured":"Bournez O, Pouly A (2018) A survey on analog models of computation. arXiv preprint arXiv:1805.05729"},{"key":"9471_CR10","doi-asserted-by":"crossref","unstructured":"Chivers I, Sleightholme J (2015) An introduction to algorithms and the big o notation. In: Introduction to programming with fortran. Springer, Berlin, pp 359\u2013364","DOI":"10.1007\/978-3-319-17701-4_23"},{"key":"9471_CR11","unstructured":"Contributors W (2019) Time complexity\u2014Wikipedia, the free encyclopedia, online; accessed 01 May 2019. [Online]. Available: https:\/\/en.wikipedia.org\/wiki\/Time_complexity"},{"issue":"4","key":"9471_CR12","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.3390\/en11041009","volume":"11","author":"Y Dong","year":"2018","unstructured":"Dong Y, Zhang Z, Hong W-C (2018) A hybrid seasonal mechanism with a chaotic cuckoo search algorithm with a support vector regression model for electric load forecasting. Energies 11(4):1009","journal-title":"Energies"},{"key":"9471_CR13","doi-asserted-by":"crossref","unstructured":"Goldsmith SF, Aiken AS, Wilkerson DS (2007) Measuring empirical computational complexity. In: Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering. ACM, pp 395\u2013404","DOI":"10.1145\/1287624.1287681"},{"issue":"1","key":"9471_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"issue":"6","key":"9471_CR15","doi-asserted-by":"publisher","first-page":"960","DOI":"10.3390\/en4060960","volume":"4","author":"W-C Hong","year":"2011","unstructured":"Hong W-C, Dong Y, Lai C-Y, Chen L-Y, Wei S-Y (2011) Svr with hybrid chaotic immune algorithm for seasonal load demand forecasting. Energies 4(6):960\u2013977","journal-title":"Energies"},{"key":"9471_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.apm.2019.03.031","volume":"72","author":"W-C Hong","year":"2019","unstructured":"Hong W-C, Li M-W, Geng J, Zhang Y (2019) Novel chaotic bat algorithm for forecasting complex motion of floating platforms. Appl Math Model 72:425\u2013443","journal-title":"Appl Math Model"},{"issue":"5","key":"9471_CR17","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen MT (2003) Reducing the run-time complexity of multiobjective eas: the nsga-ii and other algorithms. IEEE Trans Evol Comput 7(5):503\u2013515","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9471_CR18","first-page":"58","volume":"7","author":"H Kundra","year":"2015","unstructured":"Kundra H, Sadawarti H (2015) Hybrid algorithm of cuckoo search and particle swarm optimization for natural terrain feature extraction. Res J Inf Technol 7(1):58\u201369","journal-title":"Res J Inf Technol"},{"key":"9471_CR19","doi-asserted-by":"crossref","unstructured":"Min W (2010) Analysis on bubble sort algorithm optimization. In: International forum on information technology and applications, vol 1. IEEE, pp 208\u2013211","DOI":"10.1109\/IFITA.2010.9"},{"key":"9471_CR20","doi-asserted-by":"crossref","unstructured":"Min W (2010) Analysis on bubble sort algorithm optimization. In: 2010 International forum on information technology and applications, vol 1. IEEE, pp 208\u2013211","DOI":"10.1109\/IFITA.2010.9"},{"issue":"1","key":"9471_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.3390\/su12010084","volume":"12","author":"V Paliwal","year":"2020","unstructured":"Paliwal V, Ghare AD, Mirajkar AB, Bokde ND, Feijoo Lorenzo AE (2020) Computer modeling for the operation optimization of mula reservoir, upper Godavari Basin, India, using the Jaya algorithm. Sustainability 12(1):84","journal-title":"Sustainability"},{"key":"9471_CR22","unstructured":"P\u00e9gny M (2013) Computational complexity: an empirical view. In: 39th Annual convention of the society for the study of artificial intelligence and the simulation of behaviour (AISB 2013), pp 1\u20136"},{"issue":"4","key":"9471_CR23","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s11023-016-9407-0","volume":"26","author":"M P\u00e9gny","year":"2016","unstructured":"P\u00e9gny M (2016) How to make a meaningful comparison of models: the church\u2013turing thesis over the reals. Mind Mach 26(4):359\u2013388","journal-title":"Mind Mach"},{"issue":"1","key":"9471_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1186\/s13634-016-0355-x","volume":"2016","author":"J Qiu","year":"2016","unstructured":"Qiu J, Wu Q, Ding G, Xu Y, Feng S (2016) A survey of machine learning for big data processing. EURASIP J Adv Signal Process 2016(1):67","journal-title":"EURASIP J Adv Signal Process"},{"key":"9471_CR25","doi-asserted-by":"crossref","unstructured":"Salih SQ, Alsewari AA (2020) A new algorithm for normal and large-scale optimization problems: nomadic people optimizer. Neural Comput Appl 32(14), 10359\u201310386","DOI":"10.1007\/s00521-019-04575-1"},{"key":"9471_CR26","unstructured":"Shapiro JF (1979) Mathematical programming: structures and algorithms. Tech Rep."},{"key":"9471_CR27","doi-asserted-by":"crossref","unstructured":"Sharma DK, Vohra S, Gupta T, Goyal V (2018) Predicting the algorithmic time complexity of single parametric algorithms using multiclass classification with gradient boosted trees. In: 2018 Eleventh international conference on contemporary computing (IC3). IEEE, pp 1\u20136","DOI":"10.1109\/IC3.2018.8530473"},{"issue":"2","key":"9471_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of computing the permanent. Theor Comput Sci 8(2):189\u2013201","journal-title":"Theor Comput Sci"},{"key":"9471_CR29","doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2004) Space and time complexity of exact algorithms: some open problems. In: International workshop on parameterized and exact computation. Springer, pp 281\u2013290","DOI":"10.1007\/978-3-540-28639-4_25"},{"key":"9471_CR30","doi-asserted-by":"crossref","unstructured":"Wong IC, Shen Z, Evans BL, Andrews JG (2004) A low complexity algorithm for proportional resource allocation in ofdma systems. In: IEEE workshop on signal processing systems. IEEE, pp 1\u20136","DOI":"10.1109\/SIPS.2004.1363015"},{"key":"9471_CR31","doi-asserted-by":"crossref","unstructured":"Yang Y, Yu P, Gan Y (2011) Experimental study on the five sort algorithms. In: 2011 Second international conference on mechanic automation and control engineering. IEEE, pp 1314\u20131317","DOI":"10.1109\/MACE.2011.5987184"},{"issue":"2","key":"9471_CR32","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s11071-019-05252-7","volume":"98","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Hong W-C (2019) Electric load forecasting by complete ensemble empirical mode decomposition adaptive noise and support vector regression with quantum-based dragonfly algorithm. Nonlinear Dyn 98(2):1107\u20131136","journal-title":"Nonlinear Dyn"},{"key":"9471_CR33","doi-asserted-by":"publisher","first-page":"14642","DOI":"10.1109\/ACCESS.2020.2966712","volume":"8","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Hong W-C, Li J (2020) Electric load forecasting by hybrid self-recurrent support vector regression model with variational mode decomposition and improved cuckoo search algorithm. IEEE Access 8:14642\u201314658","journal-title":"IEEE Access"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09471-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-020-09471-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09471-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:47:45Z","timestamp":1631926065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-020-09471-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,18]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["9471"],"URL":"https:\/\/doi.org\/10.1007\/s11042-020-09471-8","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,18]]},"assertion":[{"value":"8 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}