{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T06:00:35Z","timestamp":1746165635969},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,17]],"date-time":"2008-07-17T00:00:00Z","timestamp":1216252800000},"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":[[2008,11]]},"DOI":"10.1007\/s10994-008-5063-9","type":"journal-article","created":{"date-parts":[[2008,7,16]],"date-time":"2008-07-16T07:59:17Z","timestamp":1216195157000},"page":"107-132","source":"Crossref","is-referenced-by-count":1,"title":["Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning"],"prefix":"10.1007","volume":"73","author":[{"given":"Qingping","family":"Tao","sequence":"first","affiliation":[]},{"given":"Stephen D.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,17]]},"reference":[{"issue":"2","key":"5063_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1007472513967","volume":"32","author":"P. Auer","year":"1998","unstructured":"Auer, P., & Warmuth, M. (1998). Tracking the best disjunction. Machine Learning, 32(2), 127\u2013150.","journal-title":"Machine Learning"},{"key":"5063_CR2","unstructured":"Blake, C., Keogh, E., & Merz, C. J. (2004). UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."},{"key":"5063_CR3","first-page":"337","volume-title":"Proceedings of the sixth annual workshop on computational learning theory","author":"A. Blum","year":"1993","unstructured":"Blum, A., Chalasani, P., & Jackson, J. (1993). On learning embedded symmetric concepts. In Proceedings of the sixth annual workshop on computational learning theory (pp. 337\u2013346). New York: ACM Press."},{"key":"5063_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S. (1994). Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of twenty-sixth ACM symposium on theory of computing (pp. 253\u2013262).","DOI":"10.1145\/195058.195147"},{"key":"5063_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.jcss.2003.10.002","volume":"68","author":"N. H. Bshouty","year":"2004","unstructured":"Bshouty, N. H., Jackson, J., & Tamon, C. (2004). More efficient PAC-learning of DNF with membership queries under the uniform distribution. Journal of Computer and System Sciences, 68, 205\u2013234.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"5063_CR6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.jcss.2004.01.006","volume":"69","author":"D. Chawla","year":"2004","unstructured":"Chawla, D., Li, L., & Scott, S. D. (2004). On approximating weighted sums with exponentially many terms. Journal of Computer and System Sciences, 69(2), 196\u2013234.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\u20132","key":"5063_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(96)00034-3","volume":"89","author":"T. G. Dietterich","year":"1997","unstructured":"Dietterich, T. G., Lathrop, R. H., & Lozano-Perez, T. (1997). Solving the multiple-instance problem with axis-parallel rectangles. Artificial Intelligence, 89(1\u20132), 31\u201371.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"5063_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1007674919412","volume":"36","author":"T. Elomaa","year":"1999","unstructured":"Elomaa, T., & Rousu, F. (1999). General and efficient multisplitting of numerical attributes. Machine Learning, 36(3), 201\u2013244.","journal-title":"Machine Learning"},{"key":"5063_CR9","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721\u2013741.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5063_CR10","unstructured":"Geyer, C. (1991). Markov chain Monte Carlo maximum likelihood. In Computing science and statistics: proceedings of the 23rd symposium on the interface (pp. 156\u2013163)."},{"issue":"1","key":"5063_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/jcss.2000.1723","volume":"6","author":"S. A. Goldman","year":"2001","unstructured":"Goldman, S. A., Kwek, S. K., & Scott, S. D. (2001). Agnostic learning of geometric patterns. Journal of Computer and System Sciences, 6(1), 123\u2013151.","journal-title":"Journal of Computer and System Sciences"},{"key":"5063_CR12","first-page":"482","volume-title":"Approximation algorithms for NP-hard problems","author":"M. Jerrum","year":"1996","unstructured":"Jerrum, M., & Sinclair, A. (1996). The Markov chain Monte Carlo method: An approach to approximate counting and integration. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp.\u00a0482\u2013520). Kent: PWS."},{"key":"5063_CR13","first-page":"1405","volume":"6","author":"R. Khardon","year":"2005","unstructured":"Khardon, R., & Servedio, R. (2005). Maximum margin algorithms with boolean kernels. Journal of Machine Learning Research, 6, 1405\u20131429.","journal-title":"Journal of Machine Learning Research"},{"key":"5063_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1613\/jair.1655","volume":"24","author":"R. Khardon","year":"2005","unstructured":"Khardon, R., Roth, D., & Servedio, R. (2005). Efficiency versus convergence of boolean kernels for online learning algorithms. Journal of Artificial Intelligence Research, 24, 341\u2013356.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"5063_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.jcss.2003.07.007","volume":"68","author":"A. Klivans","year":"2004","unstructured":"Klivans, A., & Servedio, R. A. (2004). Learning DNF in time $2^{\\tilde{O}(n^{1\/3})}$ . Journal of Computer and System Sciences, 68(2), 303\u2013318.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"5063_CR16","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2(4), 285\u2013318.","journal-title":"Machine Learning"},{"issue":"2","key":"5063_CR17","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. K. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212\u2013261.","journal-title":"Information and Computation"},{"key":"5063_CR18","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1093\/biomet\/83.3.681","volume":"83","author":"J. Liu","year":"1996","unstructured":"Liu, J. (1996). Peskun\u2019s theorem and a modified discrete-state Gibbs sampler. Biometrika, 83, 681\u2013682.","journal-title":"Biometrika"},{"key":"5063_CR19","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21, 1087\u20131092.","journal-title":"Journal of Chemical Physics"},{"key":"5063_CR20","unstructured":"Neal, R. M. (1995). Suppressing random walks in Markov chain Monte Carlo using ordered overrelaxation (Technical Report 9508). Dept. of Statistics, University of Toronto."},{"key":"5063_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"J. R. Quinlan","year":"1996","unstructured":"Quinlan, J. R. (1996). Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research, 4, 77\u201390.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"5063_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297\u2013336.","journal-title":"Machine Learning"},{"key":"5063_CR23","unstructured":"Tao, Q., & Scott, S. (2003). An analysis of MCMC sampling methods for estimating weighted sums in Winnow. In Intelligent engineering systems through artificial neural networks (ANNIE 2003) (Vol.\u00a013, pp.\u00a015\u201320), St. Louis, MO, November 2003."},{"key":"5063_CR24","unstructured":"Tao, Q., & Scott, S. (2004). A faster algorithm for generalized multiple-instance learning. In Proceedings of the 17th international Florida artificial intelligence research society conference (FLAIRS) (pp.\u00a0550\u2013555)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-008-5063-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-008-5063-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-008-5063-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:25Z","timestamp":1559338825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-008-5063-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,17]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["5063"],"URL":"https:\/\/doi.org\/10.1007\/s10994-008-5063-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,17]]}}}