{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T14:11:53Z","timestamp":1781964713567,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772020"],"award-info":[{"award-number":["61772020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10489-023-04606-4","type":"journal-article","created":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T11:01:35Z","timestamp":1685790095000},"page":"21407-21421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast newton method to solve KLR based on multilevel circulant matrix with log-linear complexity"],"prefix":"10.1007","volume":"53","author":[{"given":"Junna","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuisheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cui","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"2","key":"4606_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-008-5055-9","volume":"71","author":"GC Cawley","year":"2008","unstructured":"Cawley GC, Talbot NLC (2008) Efficient approximate leave-one-out cross-validation for kernel logistic regression. Mach Learn 71(2):243\u2013264","journal-title":"Mach Learn"},{"issue":"1","key":"4606_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.3233\/THC-202237","volume":"29","author":"A Choudhury","year":"2021","unstructured":"Choudhury A (2021) Predicting cancer using supervised machine learning: Mesothelioma. Technol Health Care 29(1):45\u201358","journal-title":"Technol Health Care"},{"issue":"8","key":"4606_CR3","first-page":"50","volume":"34","author":"G Yang","year":"2019","unstructured":"Yang G, Zhou Y, Sun L, Shi Y (2019) Logistic model based on Benford\u2019s law and its application in fraud detection. Journal of Statistics and Information 34(8):50\u201356 ((in Chinese))","journal-title":"Journal of Statistics and Information"},{"issue":"6","key":"4606_CR4","doi-asserted-by":"publisher","first-page":"4397","DOI":"10.1007\/s10064-018-1401-8","volume":"78","author":"W Chen","year":"2019","unstructured":"Chen W, Shahabi H, Shirzadi A, Hong H, Akgun A, Tian Y, Liu J, Zhu A, Li S et al (2019) Novel hybrid artificial intelligence approach of bivariate statistical-methods-based kernel logistic regression classifier for landslide susceptibility modeling. Bull Eng Geol Env 78(6):4397\u20134419","journal-title":"Bull Eng Geol Env"},{"issue":"1","key":"4606_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1198\/106186005X25619","volume":"14","author":"J Zhu","year":"2005","unstructured":"Zhu J, Hastie T (2005) Kernel logistic regression and the import vector machine. J Comput Graph Stat 14(1):185\u2013205","journal-title":"J Comput Graph Stat"},{"key":"4606_CR6","doi-asserted-by":"crossref","unstructured":"Sugiyama M, Simm J (2010) A computationally-efficient alternative to kernel logistic regression. In Proceedings of the 2010 IEEE International Workshop on Machine Learning for Signal Processing pages 124\u2013129, Kittila, Finland","DOI":"10.1109\/MLSP.2010.5589255"},{"issue":"1","key":"4606_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10994-005-0768-5","volume":"61","author":"SS Keerthi","year":"2005","unstructured":"Keerthi SS, Duan KB, Shevade SK, Poo AN (2005) A fast dual algorithm for kernel logistic regression. Mach Learn 61(1):151\u2013165","journal-title":"Mach Learn"},{"key":"4606_CR8","doi-asserted-by":"publisher","first-page":"84242","DOI":"10.1109\/ACCESS.2019.2924542","volume":"7","author":"D Lei","year":"2019","unstructured":"Lei D, Tang J, Li Z, Wu Y (2019) Using low-rank approximations to speed up kernel logistic regression algorithm. IEEE Access 7:84242\u201384252","journal-title":"IEEE Access"},{"key":"4606_CR9","unstructured":"Williams C, Seeger M (2001) Using the Nystr\u00f6m method to speed up kernel machines. In Proceedings of the 13th International Conference on Neural Information Processing Systems pages 682\u2013688, Cambridge, MA"},{"key":"4606_CR10","doi-asserted-by":"crossref","unstructured":"Fang K, Liu F, Huang X, Yang J (2023) End-to-end kernel learning via generative random fourier features. Pattern Recogn 134:109057","DOI":"10.1016\/j.patcog.2022.109057"},{"issue":"5","key":"4606_CR11","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1109\/TIP.2018.2796860","volume":"27","author":"L He","year":"2018","unstructured":"He L, Zhang H (2018) Kernel k-means sampling for nystr\u00f6m approximation. IEEE Trans Image Process 27(5):2108\u20132120","journal-title":"IEEE Trans Image Process"},{"issue":"1","key":"4606_CR12","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/TNNLS.2014.2359798","volume":"26","author":"M Li","year":"2014","unstructured":"Li M, Bi W, Kwok JT, Lu BL (2014) Large-scale Nystr\u00f6m kernel matrix approximation using randomized SVD. IEEE Transactions on Neural Networks and Learning Systems 26(1):152\u2013164","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4606_CR13","unstructured":"Alaoui A, Mahoney MW (2015) Fast randomized kernel ridge regression with statistical guarantees. In Proceedings of the 28th International Conference on Neural Information Processing Systems pages 775\u2013783, Montreal, Canada"},{"key":"4606_CR14","unstructured":"Musco C, Musco C (2017) Recursive sampling for the Nystr\u00f6m method. In Proceedings of the 31st International Conference on Neural Information Processing Systems pages 3836\u20133848, Red Hook, NY, USA"},{"issue":"1","key":"4606_CR15","first-page":"3977","volume":"17","author":"A Gittens","year":"2016","unstructured":"Gittens A, Mahoney MW (2016) Revisiting the Nystr\u00f6m method for improved large-scale machine learning. The Journal of Machine Learning Research 17(1):3977\u20134041","journal-title":"The Journal of Machine Learning Research"},{"key":"4606_CR16","unstructured":"Rahimi A, Recht B (2007) Random features for large-scale kernel machines. In Proceedings of the 20th International Conference on Neural Information Processing Systems pages 1177\u20131184, Red Hook, NY, USA"},{"issue":"3","key":"4606_CR17","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1109\/TCYB.2018.2794998","volume":"49","author":"L He","year":"2019","unstructured":"He L, Ray N, Guan Y, Zhang H (2019) Fast large-scale spectral clustering via explicit feature mapping. IEEE Transactions on Cybernetics 49(3):1058\u20131071","journal-title":"IEEE Transactions on Cybernetics"},{"key":"4606_CR18","unstructured":"Feng C, Hu Q, Liao S (2015) Random feature mapping with signed circulant matrix projection. In Proceedings of the 24th International Joint Conference on Artificial Intelligence pages 3490\u20133496, Buenos Aires, Argentina"},{"issue":"11","key":"4606_CR19","doi-asserted-by":"publisher","first-page":"5497","DOI":"10.1109\/TCYB.2019.2959834","volume":"51","author":"K Xiong","year":"2020","unstructured":"Xiong K, Iu HHC, Wang S (2020) Kernel correntropy conjugate gradient algorithms based on half-quadratic optimization. IEEE Transactions on Cybernetics 51(11):5497\u20135510","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"108","key":"4606_CR20","first-page":"1","volume":"22","author":"Z Li","year":"2021","unstructured":"Li Z, Ton JF, Oglic D, Sejdinovic D (2021) Towards a unified analysis of random fourier features. J Mach Learn Res 22(108):1\u201351","journal-title":"J Mach Learn Res"},{"key":"4606_CR21","doi-asserted-by":"crossref","unstructured":"Liu F, Huang X, Chen Y, Suykens JAK (2021) Random features for kernel approximation: A survey on algorithms, theory, and beyond. IEEE Transactions on Pattern Analysis and Machine Intelligence","DOI":"10.1109\/TPAMI.2021.3097011"},{"key":"4606_CR22","unstructured":"Song G (2009) Approximation of kernel matrices in machine learning. PhD thesis, Department of Mathematics, Syracuse University, Syracuse, NY, USA"},{"issue":"4","key":"4606_CR23","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.jco.2010.02.003","volume":"26","author":"G Song","year":"2010","unstructured":"Song G, Xu Y (2010) Approximation of high-dimensional kernel matrices by multilevel circulant matrices. J Complex 26(4):375\u2013405","journal-title":"J Complex"},{"key":"4606_CR24","first-page":"165","volume-title":"The 3rd Asian Conference on Machine Learning","author":"L Ding","year":"2011","unstructured":"Ding L, Liao S (2011) Approximate model selection for large scale LSSVM. The 3rd Asian Conference on Machine Learning. Taoyuan, Taiwan, pp 165\u2013180"},{"key":"4606_CR25","doi-asserted-by":"crossref","unstructured":"Edwards RE, Zhang H, Parker LE, New JR (2013) Approximate $$l$$-fold cross-validation with least squares SVM and kernel ridge regression. In Proceedings of the 2013 12th International Conference on Machine Learning and Applications pages 58\u201364, NW Washington, DC, United States","DOI":"10.1109\/ICMLA.2013.18"},{"issue":"3","key":"4606_CR26","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1109\/TCYB.2016.2520582","volume":"47","author":"L Ding","year":"2017","unstructured":"Ding L, Liao S (2017) An approximate approach to automatic kernel selection. IEEE Transactions on Cybernetics 47(3):554\u2013565","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"11","key":"4606_CR27","doi-asserted-by":"publisher","first-page":"4881","DOI":"10.1109\/TNNLS.2019.2958922","volume":"31","author":"L Ding","year":"2020","unstructured":"Ding L, Liao S, Liu Y, Liu L, Zhu F, Yao Y, Shao L, Gao X (2020) Approximate kernel selection via matrix approximation. IEEE Transactions on Neural Networks and Learning Systems 31(11):4881\u20134891","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4606_CR28","doi-asserted-by":"crossref","unstructured":"Yin R, Liu Y, Wang W, Meng D (2019) Sketch kernel ridge regression using circulant matrix: Algorithm and theory. IEEE Transactions on Neural Networks and Learning Systems 31(9):3512\u20133524","DOI":"10.1109\/TNNLS.2019.2944959"},{"issue":"4","key":"4606_CR29","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/21M1464178","volume":"32","author":"H Sato","year":"2022","unstructured":"Sato H (2022) Riemannian conjugate gradient methods: General framework and specific algorithms with convergence analyses. SIAM J Optim 32(4):2690\u20132717","journal-title":"SIAM J Optim"},{"issue":"10","key":"4606_CR30","doi-asserted-by":"publisher","first-page":"4447","DOI":"10.1109\/TFUZZ.2022.3153141","volume":"30","author":"J Guevara","year":"2022","unstructured":"Guevara J, Mendel JM, Hirata R (2022) Fuzzy-system kernel machines: A kernel method based on the connections between fuzzy inference systems and kernel machines. IEEE Trans Fuzzy Syst 30(10):4447\u20134459","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"4606_CR31","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis Jr","year":"1983","unstructured":"Dennis JE Jr, Schnabel RB (1983) Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewoods Cliffs"},{"key":"4606_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(94)00025-5","volume":"232","author":"EE Tyrtyshnikov","year":"1996","unstructured":"Tyrtyshnikov EE (1996) A unifying approach to some old and new theorems on distribution and clustering. Linear Algebra Appl 232:1\u201343","journal-title":"Linear Algebra Appl"},{"key":"4606_CR33","volume-title":"Circulant Matrices","author":"PJ Davis","year":"1979","unstructured":"Davis PJ (1979) Circulant Matrices. Wiley"},{"key":"4606_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Boyd SP, Vandenberghe L (2004) Convex Optimization. Cambridge University Press"},{"issue":"7","key":"4606_CR35","doi-asserted-by":"publisher","first-page":"2828","DOI":"10.1109\/TNNLS.2020.3045836","volume":"33","author":"L Galli","year":"2022","unstructured":"Galli L, Lin CJ (2022) A study on truncated newton methods for linear classification. IEEE Transactions on Neural Networks and Learning Systems 33(7):2828\u20132841","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4606_CR36","doi-asserted-by":"crossref","unstructured":"Lin CJ, Chang CC (2011) LIBSVM: a library for support vector machines. https:\/\/www.csie.ntu.edu.tw\/~cjlin\/libSVM\/","DOI":"10.1145\/1961189.1961199"},{"key":"4606_CR37","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"4606_CR38","doi-asserted-by":"crossref","unstructured":"Ho TK, Kleinberg EM (1996) Building projectable classifiers of arbitrary complexity. In Proceedings of 13th International Conference on Pattern Recognition pages 880\u2013885, Vienna, Austria","DOI":"10.1109\/ICPR.1996.547202"},{"issue":"3","key":"4606_CR39","first-page":"161","volume":"1","author":"OL Mangasarian","year":"2001","unstructured":"Mangasarian OL, Musicant DR (2001) Lagrangian support vector machines. The Journal of Machine Learning Research 1(3):161\u2013177","journal-title":"The Journal of Machine Learning Research"},{"issue":"4","key":"4606_CR40","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TNNLS.2015.2424684","volume":"27","author":"S Zhou","year":"2016","unstructured":"Zhou S (2016) Sparse LSSVM in primal using Cholesky factorization for large-scale problems. IEEE Transactions on Neural Networks and Learning Systems 27(4):783\u2013795","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4606_CR41","doi-asserted-by":"crossref","unstructured":"Chen L, Zhou S (2018) Sparse algorithm for robust LSSVM in primal space. Neurocomputing 275(C):2880\u20132891","DOI":"10.1016\/j.neucom.2017.10.011"},{"key":"4606_CR42","unstructured":"Vapnik V (2013) The Nature of Statistical Learning Theory. Springer Science & Business Media"},{"key":"4606_CR43","doi-asserted-by":"crossref","unstructured":"Takahashi K, Yamamoto K, Kuchiba A, Koyama T (2022) Confidence interval for micro-averaged F1 and macro-averaged F1 scores. Appl Intell 52(5):4961\u20134972","DOI":"10.1007\/s10489-021-02635-5"},{"key":"4606_CR44","doi-asserted-by":"crossref","unstructured":"Zhou T, Lu H, Yang Z, Qiu S, Huo B, Dong Y (2021) The ensemble deep learning model for novel COVID-19 on CT images. Appl Soft Comput 98:106885","DOI":"10.1016\/j.asoc.2020.106885"},{"key":"4606_CR45","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1-30","journal-title":"J Mach Learn Res"},{"issue":"3","key":"4606_CR46","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s10589-013-9571-6","volume":"56","author":"S Zhou","year":"2013","unstructured":"Zhou S, Cui J, Ye F, Liu H, Zhu Q (2013) New smoothing SVM algorithm with tight error bound and efficient reduced techniques. Comput Optim Appl 56(3):599\u2013617","journal-title":"Comput Optim Appl"},{"issue":"2","key":"4606_CR47","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10462-018-9614-6","volume":"52","author":"VK Chauhan","year":"2019","unstructured":"Chauhan VK, Dahiya K, Sharma A (2019) Problem formulations and solvers in linear SVM: a review. Artif Intell Rev 52(2):803\u2013855","journal-title":"Artif Intell Rev"},{"key":"4606_CR48","doi-asserted-by":"crossref","unstructured":"Zhou S, Zhou W (2021) Unified SVM algorithm based on LS-DC loss. Machine Learning","DOI":"10.1007\/s10994-021-05996-7"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04606-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04606-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04606-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T19:24:43Z","timestamp":1729538683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04606-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,3]]},"references-count":48,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4606"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04606-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,3]]},"assertion":[{"value":"1 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2023","order":2,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}}]}}