{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:00:41Z","timestamp":1778904041087,"version":"3.51.4"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board (SERB), India","doi-asserted-by":"crossref","award":["SB\/S2\/RJN-001\/2016 and ECR\/2017\/000053"],"award-info":[{"award-number":["SB\/S2\/RJN-001\/2016 and ECR\/2017\/000053"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ramanujan Fellowship and Early Career Research Award Schemes"},{"name":"Council of Scientific & Industrial Research (CSIR), New Delhi, India","award":["22(0751)\/17\/EMR-II"],"award-info":[{"award-number":["22(0751)\/17\/EMR-II"]}]},{"name":"Extra Mural Research (EMR) Scheme"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2021,6,23]]},"abstract":"<jats:p>In the last decade, twin support vector machine (TWSVM) classifiers have achieved considerable emphasis on pattern classification tasks. However, the TWSVM formulation still suffers from the following two shortcomings: (1) TWSVM deals with the inverse matrix calculation in the Wolfe-dual problems, which is intractable for large-scale datasets with numerous features and samples, and (2) TWSVM minimizes the empirical risk instead of the structural risk in its formulation. With the advent of huge amounts of data today, these disadvantages render TWSVM an ineffective choice for pattern classification tasks. In this article, we propose an efficient large-scale least squares twin support vector machine (LS-LSTSVM) for pattern classification that rectifies all the aforementioned shortcomings. The proposed LS-LSTSVM introduces different Lagrangian functions to eliminate the need for calculating inverse matrices. The proposed LS-LSTSVM also does not employ kernel-generated surfaces for the non-linear case, and thus uses the kernel trick directly. This ensures that the proposed LS-LSTSVM model is superior to the original TWSVM and LSTSVM. Lastly, the structural risk is minimized in LS-LSTSVM. This exhibits the essence of statistical learning theory, and consequently, classification accuracy on datasets can be improved due to this change. The proposed LS-LSTSVM is solved using the sequential minimal optimization (SMO) technique, making it more suitable for large-scale problems. We further proved the convergence of the proposed LS-LSTSVM. Exhaustive experiments on several real-world benchmarks and NDC-based large-scale datasets demonstrate that the proposed LS-LSTSVM is feasible for large datasets and, in most cases, performed better than existing algorithms.<\/jats:p>","DOI":"10.1145\/3398379","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:39:34Z","timestamp":1594125574000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Large-Scale Least Squares Twin SVMs"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5727-3697","authenticated-orcid":false,"given":"M.","family":"Tanveer","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Indore, Simrol, Indore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sharma","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Indore, Simrol, Indore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Muhammad","sequence":"additional","affiliation":[{"name":"Department of Software, Sejong University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"C. Blake and C. J. Merz. 1998. UCI Repository of Machine Learning Databases Dept. of Information and Computer Science Univ. of California Irvine.  C. Blake and C. J. Merz. 1998. UCI Repository of Machine Learning Databases Dept. of Information and Computer Science Univ. of California Irvine."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.172"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_2_1_5_1","volume-title":"Support Vector Machines: Theory and Applications","author":"Chu Feng","unstructured":"Feng Chu , Guosheng Jin , and Lipo Wang . 2005. Cancer diagnosis and protein secondary structure prediction using support vector machines . In Support Vector Machines: Theory and Applications . Springer , 343\u2013363. Feng Chu, Guosheng Jin, and Lipo Wang. 2005. Cancer diagnosis and protein secondary structure prediction using support vector machines. In Support Vector Machines: Theory and Applications. Springer, 343\u2013363."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/954544"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2697065"},{"key":"e_1_2_1_10_1","volume-title":"CVX: Matlab software for disciplined convex programming, version 2.1","author":"Grant Michael","year":"2014","unstructured":"Michael Grant and Stephen Boyd . 2014 . CVX: Matlab software for disciplined convex programming, version 2.1 . http:\/\/cvxr.com\/cvx\/citing\/. Michael Grant and Stephen Boyd. 2014. CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx\/citing\/."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.991427"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1068"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the International Joint Conference on Neural Networks, 2003","volume":"3","author":"Keerthi S. S.","year":"2088","unstructured":"S. S. Keerthi and S. K. Shevade . 2003. SMO algorithm for least squares SVM . In Proceedings of the International Joint Conference on Neural Networks, 2003 , Vol. 3 . IEEE, 2088 \u20132093. S. S. Keerthi and S. K. Shevade. 2003. SMO algorithm for least squares SVM. In Proceedings of the International Joint Conference on Neural Networks, 2003, Vol. 3. IEEE, 2088\u20132093."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012431217818"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014493"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2604-2"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.05.025"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.09.066"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5039-1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2455-9"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.17"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Olvi L. Mangasarian. 1994. Nonlinear Programming. SIAM.  Olvi L. Mangasarian. 1994. Nonlinear Programming. SIAM.","DOI":"10.1137\/1.9781611971255"},{"key":"e_1_2_1_24_1","volume-title":"NDC: Normally Distributed Clustered Datasets.","author":"Musicant D. R.","year":"1998","unstructured":"D. R. Musicant . 1998 . NDC: Normally Distributed Clustered Datasets. Retrieved from http:\/\/www.cs.wisc.edu\/dmi\/svm\/ndc\/. D. R. Musicant. 1998. NDC: Normally Distributed Clustered Datasets. Retrieved from http:\/\/www.cs.wisc.edu\/dmi\/svm\/ndc\/."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.04.010"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/794189.794466"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/01431160512331314083"},{"key":"e_1_2_1_28_1","volume-title":"2018 IEEE Symposium Series on Computational Intelligence (SSCI\u201918)","author":"Richhariya B.","year":"2045","unstructured":"B. Richhariya , A. Sharma , and M. Tanveer . 2018. Improved universum twin support vector machine . In 2018 IEEE Symposium Series on Computational Intelligence (SSCI\u201918) . IEEE, 2045 \u20132052. B. Richhariya, A. Sharma, and M. Tanveer. 2018. Improved universum twin support vector machine. In 2018 IEEE Symposium Series on Computational Intelligence (SSCI\u201918). IEEE, 2045\u20132052."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.03.053"},{"key":"#cr-split#-e_1_2_1_30_1.1","doi-asserted-by":"crossref","unstructured":"B. Richhariya and M. Tanveer. 2021. An efficient angle based universum least squares twin support vector machine for pattern classification. ACM Transactions on Internet Technology (TOIT) (In press) (2021). https:\/\/doi.org\/10.1145\/3387131 10.1145\/3387131","DOI":"10.1145\/3387131"},{"key":"#cr-split#-e_1_2_1_30_1.2","doi-asserted-by":"crossref","unstructured":"B. Richhariya and M. Tanveer. 2021. An efficient angle based universum least squares twin support vector machine for pattern classification. ACM Transactions on Internet Technology (TOIT) (In press) (2021). https:\/\/doi.org\/10.1145\/3387131","DOI":"10.1145\/3387131"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107150"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2020.101903"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/559923"},{"key":"e_1_2_1_34_1","volume-title":"Single directional SMO algorithm for least squares support vector machines. Computational Intelligence and Neuroscience","author":"Shao Xigao","year":"2013","unstructured":"Xigao Shao , Kun Wu , and Bifeng Liao . 2013. Single directional SMO algorithm for least squares support vector machines. Computational Intelligence and Neuroscience 2013 , Article 968438 (2013). Xigao Shao, Kun Wu, and Bifeng Liao. 2013. Single directional SMO algorithm for least squares support vector machines. Computational Intelligence and Neuroscience 2013, Article 968438 (2013)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.10.011"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.01.016"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2130540"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2896642"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.870050"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0786-3"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-015-0414-x"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-014-9278-8"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105617"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0751-1"},{"key":"e_1_2_1_45_1","volume-title":"2019 IEEE International Conference on Systems, Man and Cybernetics (SMC\u201919)","author":"Tanveer M.","unstructured":"M. Tanveer , T. Rajani , and M. A. Ganaie . 2019. Improved sparse pinball twin SVM . In 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC\u201919) . IEEE, 3287\u20133291. M. Tanveer, T. Rajani, and M. A. Ganaie. 2019. Improved sparse pinball twin SVM. In 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC\u201919). IEEE, 3287\u20133291."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3344998"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.04.032"},{"key":"e_1_2_1_48_1","volume-title":"Suganthan","author":"Tanveer M.","year":"2020","unstructured":"M. Tanveer , A. Sharma , and Ponnuthurai N . Suganthan . 2020 . Least squares KNN-based weighted multiclass twin SVM. Neurocomputing (In Press) ( 2020). DOI:https:\/\/doi.org\/10.1016\/j.neucom.2020.02.132 10.1016\/j.neucom.2020.02.132 M. Tanveer, A. Sharma, and Ponnuthurai N. Suganthan. 2020. Least squares KNN-based weighted multiclass twin SVM. Neurocomputing (In Press) (2020). DOI:https:\/\/doi.org\/10.1016\/j.neucom.2020.02.132"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.2298\/FIL1708195T"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.02.022"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-013-4718-6"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/211359"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.007"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2513006"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISKE.2008.4731075"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:54Z","timestamp":1750199934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6,23]]}},"alternative-id":["10.1145\/3398379"],"URL":"https:\/\/doi.org\/10.1145\/3398379","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}