{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:15Z","timestamp":1725486075179},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_40","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"559-573","source":"Crossref","is-referenced-by-count":0,"title":["Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking"],"prefix":"10.1007","author":[{"given":"Sivan","family":"Sabato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Shalev-Shwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"40_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.777375","volume":"21","author":"A. Antos","year":"1999","unstructured":"Antos, A., Devroye, L., Gyorfi, L.: Lower bounds for bayes error estimation. IEEE Trans. Pattern Anal. Mach. Intell. 21(7) (1999)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Antos, A., Kontoyiannis, I.: Convergence properties of functional estimates for discrete distributions. Random Struct. Algorithms, 19(3-4) (2001)","DOI":"10.1002\/rsa.10019"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Lopez de Mantaras, R.: A distance-based attribute selection measure for decision tree induction. Machine Learning Journal (1991)","DOI":"10.1007\/BF00153761"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Drukh, E., Mansour, Y.: Concentration bounds for unigrams language model. JMLR (2005)","DOI":"10.1007\/978-3-540-27819-1_12"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Good, I.J.: The population frequencies of species and the estimation of pulation parameters. Biometrika (1953)","DOI":"10.1093\/biomet\/40.3-4.237"},{"key":"40_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer, Heidelberg (2001)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y.: On the boosting ability of top-down decision tree learning algorithms. In: STOC (1996)","DOI":"10.1145\/237814.237994"},{"key":"40_CR8","unstructured":"McAllester, D.A., Schapire, R.E.: On the convergence rate of good-turing estimators. In: COLT (2000)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. Surveys in Combinatorics, pp. 148\u2013188 (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Mingers, J.: An empirical comparison of selection measures for decision-tree induction. Machine Learning (1989)","DOI":"10.1007\/BF00116837"},{"key":"40_CR11","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"40_CR12","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"40_CR13","unstructured":"Sabato, S., Shalev-Shwartz, S.: Prediction by categorical features. Technical report (2007)"},{"key":"40_CR14","volume-title":"chapter Information-Theoretic Methods","author":"K. Torkkola","year":"2006","unstructured":"Torkkola, K.: Feature Extraction, Foundations and Applications. In: chapter Information-Theoretic Methods, Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:31Z","timestamp":1619517091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_40","relation":{},"subject":[]}}