{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T01:48:56Z","timestamp":1714873736417},"reference-count":34,"publisher":"Elsevier","isbn-type":[{"value":"9781558603776","type":"print"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/b978-1-55860-377-6.50058-x","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T23:00:40Z","timestamp":1404169240000},"page":"413-420","source":"Crossref","is-referenced-by-count":7,"title":["On learning Decision Committees"],"prefix":"10.1016","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Gascuel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib1","series-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00994006","article-title":"A further comparison of splitting rules for Decision- Tree induction","author":"Buntine","year":"1992","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib3","series-title":"Pattern Recognition","author":"Bongard","year":"1970"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","article-title":"Harmonic analysis of polynomial threshold functions","volume":"3","author":"Bruck","year":"1990","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib5","unstructured":"B. Cestnik and Y. Bratko. Learning redundant rules in noisy domains. In Proc. of the 8th EC AI, pages 348\u2013350, 1988."},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib6","first-page":"39","article-title":"Methodes de segmentation non param\u00e9triques","author":"Celeux","year":"1982","journal-title":"Revue de statistique appliqu\u00e9e"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib7","first-page":"281","article-title":"Sdl, a stochastic algorithm for learning decision lists with limited complexity","volume":"10","author":"de Carvalho Gomes","year":"1994","journal-title":"Annals of Mathematics and AI"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib8","unstructured":"M. Gams. New measurements highlight the importance of Redundant Knowledge. In Proc. of the 4 th EWSL, pages 71\u201379, 1989."},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib9","unstructured":"O. Gascuel. Plage, a way to give and use knowledge in learning. In Proc. of the 1 st EWSL, 1986. also available in \u201cMachine and Human Learning\u201d, Y. Kodratoff (Ed.), Michael Horwood series in Artificial Intelligence, pp. 105\u2013120, 1989."},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib10","series-title":"Data Analysis, Learning Symbolic and Numeric Knowledge","first-page":"417","article-title":"Inductive learning, numerical criteria and combinatorial optimization, some results","author":"Gascuel","year":"1989"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib11","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/0167-8655(92)90125-J","article-title":"Distributionfree performances bounds with the resubstitution error estimate","volume":"13","author":"Gascuel","year":"1992","journal-title":"Pattern Recognition"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib12","series-title":"Actes des 5emes Journ\u00e9es Nationales du PRC-IA","first-page":"29","article-title":"M\u00e9thodes symboliques-num\u00e9riques de discrimination","author":"Gascuel","year":"1995"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib13","series-title":"Computers and Intractability, a guide to the theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib14","doi-asserted-by":"crossref","unstructured":"T. Hancock, T. Jiang, M. Li, and J. Tromp. Lower bounds on learning Decision Lists and Trees. In STACS'95, 1995.","DOI":"10.1007\/3-540-59042-0_102"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","author":"Hoeffding","year":"1963","journal-title":"J. Am. Stat. Assoc"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1022631118932","article-title":"Very simple classification rules perform well on most commonly used datasets","author":"Holte","year":"1993","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision tree is NP-complete","author":"Hyafil","year":"1976","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib18","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib19","doi-asserted-by":"crossref","unstructured":"I. Kononenko and M. Kova\u010di\u010d. Learning as Optimization: Stochastic Generation of multiple knowledge. In Proc. of the 9 th ICML, 1992.","DOI":"10.1016\/B978-1-55860-247-2.50038-3"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib20","doi-asserted-by":"crossref","unstructured":"M. J. Kearns, M. Li, L. Pitt, and L. Valiant. On the learnability of boolean formulae. Proc. of the 19 th STOC, pages 285\u2013295, 1987.","DOI":"10.1145\/28395.28426"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib21","doi-asserted-by":"crossref","unstructured":"M. J. Kearns, M. Li, L. Pitt, and L. Valiant. Recent results on boolean concept learning. Proc. of the 4 th ICML, pages 337\u2013352, 1987.","DOI":"10.1016\/B978-0-934613-41-5.50037-4"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib22","doi-asserted-by":"crossref","unstructured":"R. Kohavi. The power of Decision Tables, 1995. Draft accepted to ECML95.","DOI":"10.1007\/3-540-59286-5_57"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.63","article-title":"A system for Induction of Oblique Decision Trees","author":"Murthy","year":"1994","journal-title":"JAIR"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1613\/jair.41","article-title":"Exploring the Decision Forest: an empirical investigation of Occam's Razor in Decision Tree induction","author":"Murphy","year":"1994","journal-title":"JAIR"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib25","series-title":"Learning machines","author":"Nilsson","year":"1965"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib26","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","author":"Pitt","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib27","first-page":"641","article-title":"Expansion and compression of binary data to build features by learning","author":"Quinqueton","year":"1983","journal-title":"IJCPR"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00058680","article-title":"Learning decision lists","author":"Rivest","year":"1987","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib29","unstructured":"R. Segal and O. Etzioni. Learning Decision Lists using homogeneous rules. In Proc. of AAAI-94, pages 619\u2013625, 1994."},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib30","series-title":"Computer based medical consultations: MYCIN","author":"Shortliffe","year":"1976"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib31","unstructured":"S. B. Thrun, J. Bala, E. Bloedorn, and I. Bratko. The MONK's problems: a performance comparison of different learning algorithms. Technical Report CMU-CS- 91\u2013197, Carnegie Mellon University, 1991."},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib32","doi-asserted-by":"crossref","unstructured":"G. Tur\u00e1n. A survey of some aspects of Computational Learning Theory. In Proc. of the 32 th FOCS, pages 89\u2013103, 1991.","DOI":"10.1007\/3-540-54458-5_53"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib33","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","author":"Valiant","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/B978-1-55860-377-6.50058-X_bib34","series-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik","year":"1982"}],"container-title":["Machine Learning Proceedings 1995"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978155860377650058X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978155860377650058X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T01:46:05Z","timestamp":1565574365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978155860377650058X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9781558603776"],"references-count":34,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-377-6.50058-x","relation":{},"subject":[],"published":{"date-parts":[[1995]]}}}