{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:35:31Z","timestamp":1768523731639,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T00:00:00Z","timestamp":1472774400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61472390"],"award-info":[{"award-number":["61472390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11271361"],"award-info":[{"award-number":["11271361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["71331005"],"award-info":[{"award-number":["71331005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major International (Regional) Joint Research Project","award":["71110107026"],"award-info":[{"award-number":["71110107026"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00521-016-2574-3","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T07:52:19Z","timestamp":1472802739000},"page":"497-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A divide-and-conquer method for large scale \u03bd-nonparallel support vector machines"],"prefix":"10.1007","volume":"29","author":[{"given":"Xuchan","family":"Ju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjie","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"issue":"3","key":"2574_CR1","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik VN (1995) Support-vector networks. Mach Learn 20(3):273\u2013297","journal-title":"Mach Learn"},{"key":"2574_CR2","volume-title":"The nature of statistical learning theory","author":"VN Vapnik","year":"1996","unstructured":"Vapnik VN (1996) The nature of statistical learning theory. Springer, New York"},{"key":"2574_CR3","volume-title":"Statistical learning theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik VN (1998) Statistical learning theory. Wiley, New York"},{"key":"2574_CR4","doi-asserted-by":"crossref","unstructured":"Trafalis TB, Ince H (2000) Support vector machine for regression and applications to financial forecasting. In: Proceedings of the IEEE-INNS-ENNS international joint conference on neural networks, vol 6, pp 348\u2013353","DOI":"10.1109\/IJCNN.2000.859420"},{"key":"2574_CR5","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1162\/089976600300015565","volume":"12","author":"B Sch\u00f6lkopf","year":"2000","unstructured":"Sch\u00f6lkopf B, Smola AJ, Williamson RC, Bartlett PL (2000) New support vector algorithms. Neural Comput 12:1207\u20131245","journal-title":"Neural Comput"},{"key":"2574_CR6","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/s00521-014-1575-3","volume":"25","author":"YJ Tian","year":"2014","unstructured":"Tian YJ, Zhang Q, Liu DL (2014) \u03bd-Nonparallel support vector machine for pattern classification. Neural Comput Appl 25:1007\u20131020","journal-title":"Neural Comput Appl"},{"key":"2574_CR7","doi-asserted-by":"crossref","unstructured":"Platt JC (1998) Fast training of support vector machines using sequential minimal optimization. In: Sch\u00f6lkopf B, Burges CJC, Smola AJ (eds) Advances in Kernel Methods-Support Vector Learning. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/1130.003.0016"},{"issue":"27","key":"2574_CR8","first-page":"1","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang CC, Lin CJ (2011) Libsvm: a linrary for support vector machines. ACM Trans Intell Syst Tecnol 2(27):1\u201327","journal-title":"ACM Trans Intell Syst Tecnol"},{"key":"2574_CR9","doi-asserted-by":"crossref","unstructured":"Hsieh CJ, Chang KW, Lin CJ, Keerthi SS, Sundararajan S (2008) A dual coordinate descent method for large-scale linear svm. In: Proceedings of the 25th international conference on machine learning, pp 408\u2013415","DOI":"10.1145\/1390156.1390208"},{"key":"2574_CR10","first-page":"243","volume":"2","author":"S Fine","year":"2001","unstructured":"Fine S, Scheinberg K (2001) Efficient svm training using low-rank kernel representations. J Mach Learn Res 2:243\u2013264","journal-title":"J Mach Learn Res"},{"key":"2574_CR11","unstructured":"Zhang K, Lan L, Wang Z, Moerchen F (2012) Scaling up kernel SVM on Limited resources: a low-rank linearization approach. In: Proceedings of 15th internation conference on artificial intelligence and statistics (AISTATS)"},{"key":"2574_CR12","unstructured":"Le Q, Sarl\u00f3s T, Smola A (2013) Fastfood-approximating kernel expansions in loglinear time. In: Proceedings of the 30th international conference on machine learning"},{"key":"2574_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1162\/neco.1989.1.2.281","volume":"1","author":"M John","year":"1989","unstructured":"John M, Christian JD (1989) Fast learning in networks of locally-tuned processing units. Neural Comput 1:281\u2013294","journal-title":"Neural Comput"},{"issue":"3","key":"2574_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10618-005-0005-7","volume":"11","author":"H Yu","year":"2005","unstructured":"Yu H, Yang J, Han J, Li X (2005) Making SVMs scalable to large data sets using hierarchical cluster indexing. Data Min Knowl Discov 11(3):295\u2013321","journal-title":"Data Min Knowl Discov"},{"key":"2574_CR15","doi-asserted-by":"crossref","unstructured":"Zhang K, Tsang IW, Kwok JT (2008) Improved Nystr\u00f6m low rank approximation and error analysis. In: Proceedings of the 25st international conference on machine learning","DOI":"10.1145\/1390156.1390311"},{"issue":"1","key":"2574_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1162\/neco.1991.3.1.79","volume":"3","author":"RA Jacobs","year":"1991","unstructured":"Jacobs RA, Jordan MI, Nowlan SJ, Hinton GE (1991) Adaptive mixtures of local experts. Neural Comput 3(1):79\u201387","journal-title":"Neural Comput"},{"key":"2574_CR17","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1162\/089976600300014908","volume":"12","author":"V Tresp","year":"2000","unstructured":"Tresp V (2000) A bayesian committee machine. Neural Comput 12:2719\u20132741","journal-title":"Neural Comput"},{"key":"2574_CR18","unstructured":"Graf HP, Cosatto E, Bottou L, Durdanovic I, Vapnik VN (2005) Parallel support vector machines: the cascade SVM. In: Proceedings of conference on neural information processing systems (NIPS)"},{"key":"2574_CR19","unstructured":"Hsieh CJ, Si S, Dhillon IS (2014) A divide-and-conquer solver for kernel support vector machines. In: Proceedings of the 31st international conference on machine learning"},{"key":"2574_CR20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.neunet.2015.11.008","volume":"75","author":"YJ Tian","year":"2016","unstructured":"Tian YJ, Ju XC, Shi Y (2016) A divide-and-combine method for large scale nonparallel support vector machines. Neural Netw 75:12\u201321","journal-title":"Neural Netw"},{"key":"2574_CR21","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang IW, Kwok JT, Cheung PM (2005) Core vector machines: fast svm training on very large data sets. J Mach Learn Res 6:363\u2013392","journal-title":"J Mach Learn Res"},{"key":"2574_CR22","doi-asserted-by":"crossref","unstructured":"Tsang IW, Kocsor A, Kwok JT (2007) Simpler core vector machines with enclosing balls. In: Proceedings of the 24th international conference on machine learning","DOI":"10.1145\/1273496.1273611"},{"issue":"10","key":"2574_CR23","doi-asserted-by":"crossref","first-page":"3468","DOI":"10.1016\/j.patcog.2010.05.020","volume":"42","author":"D Wang","year":"2010","unstructured":"Wang D, Zhang B, Zhang P, Qiao H (2010) An online core vector machine with adaptive meb adjustment. Pattern Recognit 42(10):3468\u20133482","journal-title":"Pattern Recognit"},{"key":"2574_CR24","unstructured":"Rahimi A, Recht B (2007) Random features for large-scale kernel machines. In: Advances in neural information processing systems"},{"issue":"4","key":"2574_CR25","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J Kelley","year":"1960","unstructured":"Kelley J (1960) The cutting-plane method for solving convex programs. J Soc Ind Appl Math 8(4):703\u2013712","journal-title":"J Soc Ind Appl Math"},{"key":"2574_CR26","doi-asserted-by":"crossref","unstructured":"Joachims T (2006) Training linear svms in linear time. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1150402.1150429"},{"key":"2574_CR27","doi-asserted-by":"crossref","unstructured":"Franc V, Sonnenburg S (2008) Optimized cutting plane algorithm for support vector machines. In: Proceedings of the 25th international conference on machine learning, pp 320\u2013327","DOI":"10.1145\/1390156.1390197"},{"key":"2574_CR28","first-page":"311","volume":"11","author":"CH Teo","year":"2010","unstructured":"Teo CH, Vishwanathan S, Smola A, Le QV (2010) Bundle methods for regularized risk minimization. J Mach Learn Res 11:311\u2013365","journal-title":"J Mach Learn Res"},{"key":"2574_CR29","doi-asserted-by":"crossref","unstructured":"Zhang T (2004) Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: Proceedings of the 21st international conference on machine learning","DOI":"10.1145\/1015330.1015332"},{"key":"2574_CR30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz S, Singer Y, Srebro N, Cotter A (2011) Pegasos: primal estimated sub-gradient solver for SVM. Math Program 127:3\u201330","journal-title":"Math Program"},{"key":"2574_CR31","first-page":"1579","volume":"6","author":"A Bordes","year":"2005","unstructured":"Bordes A, Ertekin S, Weston J, Bottou L (2005) Fast kernel classifiers with online and active learning. J Mach Learn Res 6:1579\u20131619","journal-title":"J Mach Learn Res"},{"key":"2574_CR32","first-page":"1889","volume":"6","author":"RE Fan","year":"2005","unstructured":"Fan RE, Chen PH, Lin CJ (2005) Working set selection using second order information for training SVM. J Mach Learn Res 6:1889\u20131918","journal-title":"J Mach Learn Res"},{"key":"2574_CR33","unstructured":"Radha C, Rong J, Timothy CH, Anil KJ (2011) Approximate kernel k-means: solution to large scale kernel clustering. In: ACM SIGKDD conference on knowledge discovery and data mining"},{"issue":"7","key":"2574_CR34","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1109\/TCYB.2013.2279167","volume":"44","author":"YJ Tian","year":"2013","unstructured":"Tian YJ, Qi ZQ, Ju XC, Shi Y, Liu XH (2013) Nonparallel support vector machines for pattern classification. IEEE Trans Cybern 44(7):1067\u20131079","journal-title":"IEEE Trans Cybern"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2574-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2574-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2574-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2574-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T22:52:21Z","timestamp":1692485541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2574-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,2]]},"references-count":34,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2574"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2574-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,2]]}}}