{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:24:00Z","timestamp":1760707440756},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf00994017","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T12:18:44Z","timestamp":1105273124000},"page":"245-271","source":"Crossref","is-referenced-by-count":10,"title":["Learning binary relations using weighted majority voting"],"prefix":"10.1007","volume":"20","author":[{"given":"Sally A.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning.Machine Learning, 2(4): pp. 319?342.","journal-title":"Machine Learning"},{"key":"CR2","first-page":"1224","volume":"13","author":"J. Barzdin","year":"1972","unstructured":"Barzdin, J. & Freivald, R. (1972). On the prediction of general recursive functions.Soviet Mathematics Doklady, 13: pp. 1224?1228.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R. & Warmuth, M. (1993). How to use expert advice.Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing, pp. 382?391.","DOI":"10.1145\/167088.167198"},{"key":"CR4","unstructured":"Chen, W. (1992). Personal communication."},{"issue":"5","key":"CR5","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1137\/0222062","volume":"22","author":"S. Goldman","year":"1993","unstructured":"Goldman, S., Rivest, R. & Schapire, R. (1993). Learning binary relations and total orders.SIAM Journal of Computing, 22(5): pp. 1006?1034.","journal-title":"SIAM Journal of Computing"},{"key":"CR6","first-page":"109","volume-title":"Computational Learning Theory: Eurocolt '93","author":"J. Kivinen","year":"1994","unstructured":"Kivinen, J. & and Warmuth, M. (1994) Using Experts for Predicting Continuous Outcomes.Computational Learning Theory: Eurocolt '93 pp. 109?120. Oxford University Press, Oxford, ISBN 0-19-853492-2."},{"issue":"4","key":"CR7","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988) Learning when irrelevant attributes abound: A new linear-threshold algorithm.Machine Learning, 2(4): pp. 285?318.","journal-title":"Machine Learning"},{"key":"CR8","unstructured":"Littlestone, N. (1989)Mistake Bounds and Logarithmic Linear-threshold Learning algorithms. PhD thesis, U. C. Santa Cruz."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Littlestone, N., Long, P. & Warmuth, M. (1991) On-line learning of linear functions.Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pp. 465?475. To appear inJournal of Computational Complexity.","DOI":"10.1145\/103418.103467"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N. & Warmuth, M. (1994) The weighted majority algorithm.Information and Computation, 108(2): pp. 212?261.","journal-title":"Information and Computation"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990) Aggregating strategies.Proceedings of the Third Annual Workshop on Computational Learning Theory, pp. 371?383. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00994017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00994017\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00994017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:58:52Z","timestamp":1556564332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00994017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF00994017"],"URL":"https:\/\/doi.org\/10.1007\/bf00994017","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}