{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:11:17Z","timestamp":1743019877417,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668220"},{"type":"electronic","value":"9783540466956"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46695-9_17","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:37:07Z","timestamp":1186907827000},"page":"193-204","source":"Crossref","is-referenced-by-count":0,"title":["A Simulated Annealing-Based Learning Algorithm for Boolean DNF"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen","family":"Steinh\u00f6fel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach","author":"E.H.L. Aarts","year":"1989","unstructured":"E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach (Wiley & Sons, New York, 1989)."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF00996269","volume":"19","author":"H. Aizenstein","year":"1995","unstructured":"H. Aizenstein and L. Pitt. On the Learnability of Disjunctive Normal Form Formulas. Machine Learning, 19:183\u2013208, 1995.","journal-title":"Machine Learning"},{"key":"17_CR3","unstructured":"A. Albrecht and C.K. Wong. A DNF Approximation Algorithm Based on Inhomogeneous Markov Chains (submitted for publication, 1999)."},{"key":"17_CR4","unstructured":"A. Albrecht, R. M\u00fcller, and M. Patze. A Stochastic Learning Procedure for Boolean Functions. In: Derek Bridge et al., editors, Proc. l0\nth\nAnnual Irish Conference on Artificial Intelligence & Cognitive Science, pp. 65\u201371, 1999."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00116828","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and Concept Learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","unstructured":"O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Applications to Exponential Schedules. The Annals of Probability, 20(3):1109\u20131146, 1992.","journal-title":"The Annals of Probability"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1006\/jcom.1996.0035","volume":"12","author":"O. Catoni","year":"1996","unstructured":"O. Catoni. Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. Journal of Complexity, 12(4):595\u2013623, 1996.","journal-title":"Journal of Complexity"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"V. \u010cerny. A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Preprint, Inst. of Physics and Biophysics, Comenius Univ., Bratislava, 1982 (see also: J. Optim. Theory Appi, 45:41\u201351, 1985).","DOI":"10.1007\/BF00940812"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00116835","volume":"3","author":"P. Clark","year":"1989","unstructured":"P. Clark and T. Niblett. The CN2 Induction Algorithm. Machine Learning, 3:261\u2013283, 1989.","journal-title":"Machine Learning"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"B. Hajek. Cooling Schedules for Optimal Annealing. Mathem. Oper. Res., 13:311\u2013329, 1988.","journal-title":"Mathem. Oper. Res."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"J. Jackson. An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution. In Proc. of the 35\nth\nAnnual Symposium on Foundations of Computer Science, pp. 42\u201353, 1994.","DOI":"10.1109\/SFCS.1994.365706"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"M. Kearns, M. Li, L. Pitt, and L.G. Valiant. Recent Results on Boolean Concept Learning. In Proc. 4\nth\nInt. Workshop on Machine Learning, pp. 337\u2013352, 1987.","DOI":"10.1016\/B978-0-934613-41-5.50037-4"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"M. Kearns and M. Li. Learning in the Presence of Malicious Errors. In Proc. of the 20\nth\nAnnual Symposium on the Theory of Computations, pp. 267\u2013279, 1988.","DOI":"10.1145\/62212.62238"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, CD. Gelatt, Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00117833","volume":"24","author":"E. Kushilevitz","year":"1996","unstructured":"E. Kushilevitz and D. Roth. On Learning Visual Concepts and DNF Formulae. Machine Learning, 24:65\u201385, 1996.","journal-title":"Machine Learning"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Y. Mansour. An n\no(log log n) Learning Algorithm for DNF under the Uniform Distribution. In Proc. of the 5\nth\nAnnual Workshop on Computational Learning Theory, pp. 53\u201361, 1992.","DOI":"10.1145\/130385.130391"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"H.D. Mathias. DNF-If You Can\u2019t Learn\u2019 em, Teach\u2019 em: An Interactive Model of Teaching. In Proc. of the 8\nth\nAnnual Workshop on Computational Learning Theory, pp. 222\u2013229, 1995.","DOI":"10.1145\/225298.225325"},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. The Journal of Chemical Physics, 21(6):1087\u20131092, 1953.","journal-title":"The Journal of Chemical Physics"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"K. Pillaipakkamnatt and V. Raghavan. On the Limits of Proper Learnability of Subclasses of DNF Formulas. In Proc. of the 7\nth\nAnnual Workshop on Computational Learning Theory, pp. 118\u2013129, 1994.","DOI":"10.1145\/180139.181063"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00058680","volume":"2","author":"R.L. Rivest","year":"1987","unstructured":"R.L. Rivest. Learning Decision Lists, Machine Learning, 2(3):229\u2013246, 1987.","journal-title":"Machine Learning"},{"issue":"5","key":"17_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/34.55105","volume":"12","author":"H. Shvaytser","year":"1990","unstructured":"H. Shvaytser. Learnable and Nonlearnable Visual Concepts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(5):459\u2013466, May 1990.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant. A Theory of the Learnable. Comm. ACM, 27(11):1134\u20131142, 1984.","journal-title":"Comm. ACM"},{"key":"17_CR23","unstructured":"L.G. Valiant. Learning Disjunctions of Conjunctions. In Proc. of the 9\nth\nInternational Joint Congerence on Artificial Intelligence, pp. 560\u2013566, 1985."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"K. Verbeurgt. Learning DNF under the Uniform Distribution in Quasi-Polynomial Time. In Proc. of the 3\nrd\nAnnual Workshop on Computational Learning Theory, pp. 314\u2013326, 1990.]","DOI":"10.1016\/B978-1-55860-146-8.50027-8"}],"container-title":["Lecture Notes in Computer Science","Advanced Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46695-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T01:05:51Z","timestamp":1732842351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-46695-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668220","9783540466956"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-46695-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}