{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:41Z","timestamp":1725536801154},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041792"},{"type":"electronic","value":"9783642041808"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_36","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"290-301","source":"Crossref","is-referenced-by-count":0,"title":["Kernel Polytope Faces Pursuit"],"prefix":"10.1007","author":[{"given":"Tom","family":"Diethe","sequence":"first","affiliation":[]},{"given":"Zakria","family":"Hussain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural Network Learning: Theoretical Foundations","author":"M. Anthony","year":"1999","unstructured":"Anthony, M., Bartlett, P.: Neural Network Learning: Theoretical Foundations. Cambridge University Press, Cambridge (1999)"},{"key":"36_CR2","unstructured":"Chen, S.: Basis Pursuit. PhD thesis, Department of Statistics, Stanford University (November 1995)"},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing\u00a020(1), 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"36_CR4","unstructured":"Donoho, D.: Neighborly polytopes and sparse solution of underdetermined linear equations. Technical report, Department of Statistics, Stanford Univ., Stanford, CA (2005)"},{"issue":"3","key":"36_CR5","first-page":"269","volume":"21","author":"S. Floyd","year":"1995","unstructured":"Floyd, S., Warmuth, M.: Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning\u00a021(3), 269\u2013304 (1995)","journal-title":"Machine Learning"},{"key":"36_CR6","unstructured":"Graepel, T., Herbrich, R., Shawe-Taylor, J.: Generalisation error bounds for sparse linear classifiers. In: Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pp. 298\u2013303 (2000)"},{"key":"36_CR7","unstructured":"Hussain, Z., Shawe-Taylor, J.: Theory of matching pursuit. In: Koller, D., Schuurmans, D., Bengio, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems, vol.\u00a021, pp. 721\u2013728 (2009)"},{"issue":"12","key":"36_CR8","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S. Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuit with time-frequency dictionaries. IEEE Transactions on Signal Processing\u00a041(12), 3397\u20133415 (1993)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"36_CR9","unstructured":"Plumbley, M.D.: Polar polytopes and recovery of sparse representations (2005)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11679363_26","volume-title":"Independent Component Analysis and Blind Signal Separation","author":"M.D. Plumbley","year":"2006","unstructured":"Plumbley, M.D.: Recovery of sparse representations by polytope faces pursuit. In: Rosca, J.P., Erdogmus, D., Pr\u00edncipe, J.C., Haykin, S. (eds.) ICA 2006. LNCS, vol.\u00a03889, pp. 206\u2013213. Springer, Heidelberg (2006)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0166-218X(93)90179-R","volume":"42","author":"J. Shawe-Taylor","year":"1993","unstructured":"Shawe-Taylor, J., Anthony, M., Biggs, N.L.: Bounding sample size with the Vapnik-Chervonenkis dimension. Discrete Applied Mathematics\u00a042(1), 65\u201373 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR12","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":"36_CR13","unstructured":"Smola, A.J., Bartlett, P.: Sparse greedy gaussian process regression. Advances in neural information processing systems\u00a013 (2001)"},{"key":"36_CR14","first-page":"911","volume-title":"Proceedings of 17th International Conference on Machine Learning","author":"A.J. Smola","year":"2000","unstructured":"Smola, A.J., Sch\u00f6lkopf, B.: Sparse greedy matrix approximation for machine learning. In: Proceedings of 17th International Conference on Machine Learning, pp. 911\u2013918. Morgan Kaufmann, San Francisco (2000)"},{"key":"36_CR15","unstructured":"Tibshirani, R.: Regression selection and shrinkage via the lasso. Technical report, Department of Statistics, University of Toronto (June 1994), \n                    \n                      ftp:\/\/utstat.toronto.edu\/pub\/tibs\/lasso.ps"},{"key":"36_CR16","first-page":"572","volume":"86","author":"J.A. Tropp","year":"2006","unstructured":"Tropp, J.A., Gilbert, A.C., Strauss, M.J.: Algorithms for simultaneous sparse approximation. part i: Greedy pursuit. Signal Processing, special issue Sparse approximations in signal and image processing\u00a086, 572\u2013588 (2006)","journal-title":"Signal Processing, special issue Sparse approximations in signal and image processing"},{"issue":"1-3","key":"36_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1013955821559","volume":"48","author":"P. Vincent","year":"2002","unstructured":"Vincent, P., Bengio, Y.: Kernel matching pursuit. Machine Learning\u00a048(1-3), 165\u2013187 (2002)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:50:07Z","timestamp":1552143007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}