{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:14:47Z","timestamp":1743124487960,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752240"},{"type":"electronic","value":"9783540752257"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75225-7_27","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T08:46:43Z","timestamp":1192006003000},"page":"328-342","source":"Crossref","is-referenced-by-count":9,"title":["Learning Kernel Perceptrons on Noisy Data Using Random Projections"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Stempfel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liva","family":"Ralaivola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond. MIT University Press, Cambridge (2002)"},{"key":"27_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V.: The nature of statistical learning theory. Springer, New York (1995)"},{"key":"27_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and other Kernel-Based Learning Methods","author":"N. Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and other Kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D., Laird, P.: Learning from Noisy Examples. Machine Learning\u00a02 (1988)","DOI":"10.1007\/BF00116829"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bylander, T.: Learning Linear Threshold Functions in the Presence of Classification Noise. In: Proc. of 7\n                    th\n                   Ann. Work. on Computat. Learning Theory, pp. 340\u2013347 (1994)","DOI":"10.1145\/180139.181176"},{"key":"27_CR6","first-page":"330","volume-title":"Proc. of 37th IEEE Symposium on Foundations of Computer Science","author":"A. Blum","year":"1996","unstructured":"Blum, A., Frieze, A.M., Kannan, R., Vempala, S.: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. In: Proc. of 37th IEEE Symposium on Foundations of Computer Science, pp. 330\u2013338. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"27_CR7","first-page":"514","volume-title":"Proc. of 38th IEEE Symposium on Foundations of Computer Science","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Learning Noisy Perceptrons by a Perceptron in Polynomial Time. In: Proc. of 38th IEEE Symposium on Foundations of Computer Science, pp. 514\u2013523. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"27_CR8","unstructured":"Bylander, T.: Learning Noisy Linear Threshold Functions (1998) (submitted to journal)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The Perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review\u00a065, 386\u2013407 (1958)","journal-title":"Psychological Review"},{"key":"27_CR10","unstructured":"Graepel, T., Herbrich, R., Williamson, R.C.: From Margin to Sparsity. In: Adv. in Neural Information Processing Systems, vol.\u00a013, pp. 210\u2013216 (2001)"},{"key":"27_CR11","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. John Wiley and Sons, inc., West Sussex, England (1998)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Ralaivola, L., Denis, F., Magnan, C.N.: CN=CPCN. In: Proc. of the 23rd Int. Conf. on Machine Learning (2006)","DOI":"10.1145\/1143844.1143935"},{"key":"27_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30215-5_16","volume-title":"Algorithmic Learning Theory","author":"M.F. Balcan","year":"2004","unstructured":"Balcan, M.F., Blum, A., Vempala, S.: Kernels as Features: on Kernels, Margins, and Low-dimensional Mappings. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol.\u00a03244, Springer, Heidelberg (2004)"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M. Kearns","year":"1993","unstructured":"Kearns, M., Li, M.: Learning in the presence of malicious errors. SIAM Journal on Computing\u00a022(4), 807\u2013837 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1103\/RevModPhys.34.123","volume":"34","author":"H.D. Block","year":"1962","unstructured":"Block, H.D.: The perceptron: A model for brain functioning. Reviews of Modern Physics\u00a034, 123\u2013135 (1962)","journal-title":"Reviews of Modern Physics"},{"key":"27_CR16","unstructured":"Novikoff, A.B.J.: On convergence proofs on perceptrons. In: Proc. of the Symp. on the Mathematical Theory of Automata, pp. 615\u2013622 (1962)"},{"key":"27_CR17","unstructured":"Amaldi, E., Kann, V.: On the approximability of some NP-hard minimization problems for linear systems. Electronic Colloquium on Computational Complexity (ECCC)\u00a03(015) (1996)"},{"key":"27_CR18","unstructured":"Zwald, L., Vert, R., Blanchard, G., Massart, P.: Kernel projection machine: a new tool for pattern recognition. In: Adv. in Neural Information Processing Systems, vol.\u00a017 (2004)"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1007662407062","volume":"37","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Large Margin Classification Using the Perceptron Algorithm. Machine Learning\u00a037(3), 277\u2013296 (1999)","journal-title":"Machine Learning"},{"issue":"9","key":"27_CR20","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1109\/TIT.2004.833339","volume":"50","author":"N. Cesa-Bianchi","year":"2004","unstructured":"Cesa-Bianchi, N., Conconi, A., Gentile, C.: On the generalization ability of online learning algorithms. IEEE Transactions on Information Theory\u00a050(9), 2050\u20132057 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR21","volume-title":"Proc. of the 9th ACM SIGKDD int. conf. on Knowledge discovery and data mining","author":"D. Fradkin","year":"2003","unstructured":"Fradkin, D., Madigan, D.: Experiments with random projections for machine learning. In: Proc. of the 9th ACM SIGKDD int. conf. on Knowledge discovery and data mining, ACM Press, New York (2003)"},{"key":"27_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., M\u00fcller, K.R.: Soft Margins for AdaBoost. Machine Learning\u00a042, 287\u2013320 (2001)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75225-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T23:52:57Z","timestamp":1550965977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75225-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752240","9783540752257"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75225-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}