{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:42Z","timestamp":1725560142474},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_45","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"625-639","source":"Crossref","is-referenced-by-count":1,"title":["Projective DNF Formulae and Their Revision"],"prefix":"10.1007","author":[{"given":"Robert H.","family":"Sloan","sequence":"first","affiliation":[]},{"given":"Bal\u00e1zs","family":"Sz\u00f6r\u00e9nyi","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45583-3_3","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2001","unstructured":"Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 12\u201331. Springer, Heidelberg (2001)"},{"issue":"2","key":"45_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1007472513967","volume":"32","author":"P. Auer","year":"1998","unstructured":"Auer, P., Warmuth, M.K.: Tracking the best disjunction. Machine Learning\u00a032(2), 127\u2013150 (1998); Earlier version in 36th FOCS (1995)","journal-title":"Machine Learning"},{"key":"45_CR3","unstructured":"Blum, A.: On-line algorithms in machine learning (1996), Available from \n                    \n                      http:\/\/www-2.cs.cmu.edu\/~avrim\/Papers\/pubs.html"},{"key":"45_CR4","unstructured":"Goldsmith, J., Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Theory revision with queries: Horn, read-once, and parity formulas. Technical Report TR03-039, Electronic Colloquium on Computational Complexity (ECCC) (2003) (Also submitted for journal publication), Available at http:\/\/www.eccc.uni-trier.de\/eccc\/"},{"issue":"2\/3","key":"45_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1013641821190","volume":"47","author":"J. Goldsmith","year":"2002","unstructured":"Goldsmith, J., Sloan, R.H., Tur\u00e1n, G.: Theory revision with queries: DNF formulas. Machine Learning\u00a047(2\/3), 257\u2013295 (2002)","journal-title":"Machine Learning"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/225298.225311","volume-title":"Proc. 8th Annu. Conf. on Comput. Learning Theory","author":"T. Heged\u00fcs","year":"1995","unstructured":"Heged\u00fcs, T.: Generalized teaching dimensions and the query complexity of learning. In: Proc. 8th Annu. Conf. on Comput. Learning Theory, pp. 108\u2013117. ACM Press, New York (1995)"},{"issue":"5","key":"45_CR7","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., Wilkins, D.: How many queries are needed to learn? J. ACM\u00a043(5), 840\u2013862 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"45_CR8","first-page":"165","volume":"5","author":"D. Helmbold","year":"1989","unstructured":"Helmbold, D., Sloan, R., Warmuth, M.K.: Learning nested differences of intersection closed concept classes. Machine Learning\u00a05(2), 165\u2013196 (1990); Special Issue on Computational Learning Theory, first appeared in 2nd COLT conference (1989)","journal-title":"Machine Learning"},{"key":"45_CR9","first-page":"209","volume-title":"Proc. 27th Annual ACM Symposium on Theory of Computing","author":"J. Kivinen","year":"1995","unstructured":"Kivinen, J., Warmuth, M.K.: Additive versus exponentiated gradient updates for linear prediction. In: Proc. 27th Annual ACM Symposium on Theory of Computing, pp. 209\u2013218. ACM Press, New York (1995)"},{"issue":"4","key":"45_CR10","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning\u00a02(4), 285\u2013318 (1988)","journal-title":"Machine Learning"},{"key":"45_CR11","unstructured":"Littlestone, N.: A mistake-bound version of Rivest\u2019s decision-list algorithm. Personal communication to Avrim Blum (1989)"},{"key":"45_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-45435-7_10","volume-title":"Computational Learning Theory","author":"C. Mesterharm","year":"2002","unstructured":"Mesterharm, C.: Tracking linear-threshold concepts with Winnow. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 138\u2013152. Springer, Heidelberg (2002)"},{"key":"45_CR13","first-page":"229","volume":"2","author":"R.L. Rivest","year":"1987","unstructured":"Rivest, R.L.: Learning decision lists. Machine Learning\u00a02, 229\u2013246 (1987)","journal-title":"Machine Learning"},{"issue":"2","key":"45_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1007678005361","volume":"37","author":"L.G. Valiant","year":"1999","unstructured":"Valiant, L.G.: Projection learning. Machine Learning\u00a037(2), 115\u2013130 (1999)","journal-title":"Machine Learning"},{"issue":"5","key":"45_CR15","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1145\/355483.355486","volume":"47","author":"L.G. Valiant","year":"2000","unstructured":"Valiant, L.G.: A neuroidal architecture for cognitive computation. Journal of the ACM\u00a047(5), 854\u2013882 (2000)","journal-title":"Journal of the ACM"},{"key":"45_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2317-5","volume-title":"Concept Formation and Knowledge Revision","author":"S. Wrobel","year":"1994","unstructured":"Wrobel, S.: Concept Formation and Knowledge Revision. Kluwer, Dordrecht (1994)"},{"key":"45_CR17","first-page":"14","volume-title":"Advances in ILP","author":"S. Wrobel","year":"1995","unstructured":"Wrobel, S.: First order theory refinement. In: De Raedt, L. (ed.) Advances in ILP, pp. 14\u201333. IOS Press, Amsterdam (1995)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T08:30:55Z","timestamp":1552811455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}