{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:37:55Z","timestamp":1725471475687},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540466499"},{"type":"electronic","value":"9783540466505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894841_17","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T11:29:53Z","timestamp":1159961393000},"page":"184-198","source":"Crossref","is-referenced-by-count":0,"title":["On Exact Learning from Random Walk"],"prefix":"10.1007","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iddo","family":"Bentov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1987)","journal-title":"Machine Learning"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF01262930","volume":"6","author":"N.H. Bshouty","year":"1997","unstructured":"Bshouty, N.H.: Simple Learning Algorithms Using Divide and Conquer. Computational Complexity\u00a06(2), 174\u2013194 (1997)","journal-title":"Computational Complexity"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/inco.2002.3083","volume":"176","author":"P.L. Bartlett","year":"2002","unstructured":"Bartlett, P.L., Fischer, P., H\u00f6ffgen, K.: Exploiting Random Walks for Learning. Information and Computation\u00a0176, 121\u2013135 (2002)","journal-title":"Information and Computation"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H., Mossel, E., O\u2019Donnell, R., Servedio, R.A.: Learning DNF from Random Walks. In: FOCS 2003, page.189 (2003)","DOI":"10.1109\/SFCS.2003.1238193"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240010105","volume":"1","author":"P. Diaconis","year":"1990","unstructured":"Diaconis, P., Graham, R., Morrison, J.: Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Structures and Algorithms\u00a01, 51\u201372 (1990)","journal-title":"Random Structures and Algorithms"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0221014","volume":"21","author":"P. Ficher","year":"1992","unstructured":"Ficher, P., Simon, H.: On learning ring-sum expansions. SIAM J. Comput.\u00a021, 181\u2013192 (1992)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hancock, T., Mansour, Y.: Learning Monotone k\u03bc DNF Formulas on Product Distributions. In: Proc. 4th Ann. Workshop on Comp. Learning Theory, pp. 179\u2013183 (1991)","DOI":"10.1016\/B978-1-55860-213-7.50020-1"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M., Li, M., Pitt, L., Valiant, L.: On the Learnability of Boolean Formulae. In: Proceedings of the 19th ACM Symposium on the Theory of Computing, pp. 285\u2013195 (1987)","DOI":"10.1145\/28395.28426"},{"issue":"4","key":"17_CR9","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N.: Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm. Machine Learning\u00a02(4), 285\u2013318 (1987)","journal-title":"Machine Learning"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.jcss.2004.04.002","volume":"69","author":"E. Mossel","year":"2004","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.A.: Learning juntas. STOC 2003: 206-212. Learning functions of k relevant variables. Journal of Computer and System Sciences\u00a069(3), 421\u2013434 (2004)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"Pitt, L., Warmuth, M.K.: Prediction-preserving reducibility. Journal of Computer and System Science\u00a041(3), 430\u2013467 (1990)","journal-title":"Journal of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894841_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:36:35Z","timestamp":1619508995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894841_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540466499","9783540466505"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11894841_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}