{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T15:40:12Z","timestamp":1687621212011},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2012,7,22]],"date-time":"2012-07-22T00:00:00Z","timestamp":1342915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00521-012-1076-1","type":"journal-article","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T11:01:42Z","timestamp":1342868502000},"page":"1279-1289","source":"Crossref","is-referenced-by-count":0,"title":["Efficient nonlinear classification via low-rank regularised least squares"],"prefix":"10.1007","volume":"22","author":[{"given":"Zhouyu","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai Ming","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dengsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,22]]},"reference":[{"key":"1076_CR1","doi-asserted-by":"crossref","unstructured":"Boser B, Guyon I, Vapnik V (1992) A training algorithm for optimal margin classifiers. In: ACM conference on computational learning theory","DOI":"10.1145\/130385.130401"},{"key":"1076_CR2","unstructured":"Chang K.-W, Hsieh C.-J, Lin C.-J, Keerthi S, Sundararajan S (2008) A dual coordinate descent method for large-scale linear SVM. In: International conference on machine learning"},{"key":"1076_CR3","volume-title":"Pattern classification","author":"RO Duda","year":"2000","unstructured":"Duda RO, Hart PE, Stock DG (2000) Pattern classification. 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"1076_CR4","first-page":"1889","volume":"6","author":"R.-E Fan","year":"2005","unstructured":"Fan R-E, Chen P-H, Lin C-J (2005) Working set selection using the second order information for training SVM. J Mach Learn Res 6:1889\u20131918","journal-title":"J Mach Learn Res"},{"key":"1076_CR5","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository. Irvine, CA: University of California, School of Information and Computer Science. http:\/\/archive.ics.uci.edu\/ml"},{"key":"1076_CR6","doi-asserted-by":"crossref","unstructured":"Fu Z, Lu G, Ting K.-M, Zhang D (2011) On low-rank regularized least squares for scalable nonlinear classification. In: International conference neural information processing, pp. 490\u2013499","DOI":"10.1007\/978-3-642-24958-7_57"},{"key":"1076_CR7","doi-asserted-by":"crossref","unstructured":"Joachims T (2006) Training linear SVMs in linear time? In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1150402.1150429"},{"key":"1076_CR8","first-page":"627","volume":"9","author":"C.-J Lin","year":"2008","unstructured":"Lin C-J, Weng RC, Keerthi SS (2008) Trust region newton method for large-scale logistic regression. J Mach Learn Res 9:627\u2013650","journal-title":"J Mach Learn Res"},{"key":"1076_CR9","doi-asserted-by":"crossref","unstructured":"Moody J (1994) Prediction risk and neural network architecture selection. In: From statistics to neural networks: theory and pattern recognition applications. Springer","DOI":"10.1007\/978-3-642-79119-2_7"},{"key":"1076_CR10","unstructured":"Pahikkala T, Boberg J, Salakoski T (2006) Fast n-fold cross-validation for regularized least-squares. In: Scandinavian conference. Artificial Intelligence"},{"key":"1076_CR11","doi-asserted-by":"crossref","unstructured":"Platt J (1998) Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel methods\u2014support vector learning. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"1076_CR12","unstructured":"Rifkin R (2002) Everything old is new again: a fresh look at historical approaches. PhD thesis, Mass. Inst. of Tech."},{"key":"1076_CR13","first-page":"101","volume":"5","author":"Ryan Rifkin","year":"2004","unstructured":"Rifkin Ryan, Klautau Aldebaro (2004) In defense of one-vs-all classification. J Mach Learn Res 5:101\u2013141","journal-title":"J Mach Learn Res"},{"key":"1076_CR14","volume-title":"Learning with Kernels: support vector machines, regularization, optimization, and beyond","author":"B Scholkopf","year":"2002","unstructured":"Scholkopf B, Smola A (2002) Learning with Kernels: support vector machines, regularization, optimization, and beyond. MIT Press, Cambridge"},{"key":"1076_CR15","unstructured":"Tsoumakas G, Katakis I, Vlahavas I (2010) Mining multi-label data, data mining and knowledge discovery handbook, pp. 667\u2013685"},{"key":"1076_CR16","volume-title":"Statistical learning theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik V (1998) Statistical learning theory. Wiley, Hoboken"},{"key":"1076_CR17","first-page":"603","volume":"7","author":"M Wu","year":"2006","unstructured":"Wu M, Scholkopf B, Bakir G (2006) A direct method for building sparse kernel learning algorithms. J Mach Learn Res 7:603\u2013624","journal-title":"J Mach Learn Res"},{"key":"1076_CR18","doi-asserted-by":"crossref","unstructured":"Zhang P, Peng J (2004) Svm vs regularized least squares classification. In: International conference pattern recognition","DOI":"10.1109\/ICPR.2004.1334050"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-012-1076-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1076-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T15:27:29Z","timestamp":1687620449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-012-1076-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,22]]},"references-count":18,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["1076"],"URL":"https:\/\/doi.org\/10.1007\/s00521-012-1076-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,22]]}}}