{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:05:14Z","timestamp":1774551914658,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0031-3203(01)00084-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"835-846","source":"Crossref","is-referenced-by-count":117,"title":["A hybrid filter\/wrapper approach of feature selection using information theory"],"prefix":"10.1016","volume":"35","author":[{"given":"Marc","family":"Sebban","sequence":"first","affiliation":[]},{"given":"Richard","family":"Nock","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(01)00084-X_BIB1","doi-asserted-by":"crossref","unstructured":"R. Nock, M. Sebban, Advances in adaptive prototype weighting and selection, Artif. Intell. Tools 10 (1\u20132) (2001), to appear.","DOI":"10.1142\/S0218213001000453"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB2","doi-asserted-by":"crossref","unstructured":"M. Sebban, R. Nock, Contribution of boosting in wrapper models, Proceedings of the 3rd European Conf. on Principles and Practice of KDD, 1999, pp. 214\u2013222.","DOI":"10.1007\/978-3-540-48247-5_23"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB3","unstructured":"M. Sebban, R. Nock, Prototype selection as an information-preserving problem, Proceedings of the 17th Int. Conf. on Machine Learning, 2000, pp. 855\u2013862."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB4","unstructured":"R. Kohavi, Feature subset selection as search with probabilistic estimates, AAAI Fall Symp. on Relevance, 1994."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB5","unstructured":"S.B. Thrun, J. Bala, E. Bloedorn, I. Bratko, B. Cestnik, J. Cheng, K. De Jong, S. Dzeroski, S.E. Fahlman, D. Fisher, R. Hamann, K. Kaufman, S. Keller, I. Kononenko, J. Kreuziger, R.S. Michalski, T. Mitchell, P. Pachowicz, Y. Reich, H. Vafaie, W. Van de Welde, W. Wenzel, J. Wnek, J. Zhang, The MONK's problems: a performance comparison of different learning algorithms, Technical Report CMU-CS-91-197, Carnegie Mellon University, 1991."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB6","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1994"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-7373(92)90018-G","article-title":"Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms","volume":"36","author":"Aha","year":"1992","journal-title":"Int. J. Man Mach. Studies"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB8","unstructured":"P. Langley, W. Iba, Average case analysis of a nearest-neighbor algorithm, Proceedings of the 13th Int. Joint Conf. on Artificial Intelligence, 1993, pp. 889\u2013894."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB9","first-page":"85","article-title":"Impact of learning set quality and size on decision tree performances","volume":"1","author":"Sebban","year":"2001","journal-title":"Int. J. Comput. Systems Signals"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","article-title":"Selection of relevant features and examples in machine learning","volume":"97","author":"Blum","year":"1997","journal-title":"Artif. Intell."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB11","doi-asserted-by":"crossref","unstructured":"George H. John, Ron Kohavi, Karl Pfleger, Irrelevant features and the subset selection problem, Proceedings of the 11th Int. Conf. on Mach. Learning, 1994, pp. 121\u2013129.","DOI":"10.1016\/B978-1-55860-335-6.50023-4"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB12","doi-asserted-by":"crossref","unstructured":"R. Nock, M. Sebban, Sharper bounds for the hardness of prototype and feature selection, Proceedings of the 11th Int. Conf. on Algorithmic Learning Theory, 2000, pp. 224\u2013237.","DOI":"10.1007\/3-540-40992-0_17"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB13","unstructured":"R. Kohavi, A study of cross-validation and bootstrap for accuracy estimation and model selection, Proceedings of the 15th Int. Joint Conf. on Artif. Intell. 1995, pp. 1137\u20131143."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB14","series-title":"An introduction to the bootstrap","author":"Efron","year":"1993"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB15","doi-asserted-by":"crossref","unstructured":"P. Langley, Selection of relevant features in machine learning, AAAI Fall Symp. on Relevance, 1994.","DOI":"10.21236\/ADA292575"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB16","doi-asserted-by":"crossref","unstructured":"D. Wettschereck, D. Aha, Weighting feature, Proceedings of the 1st Int. Conf. on Case-Based Reasoning, 1995, pp. 347\u2013358.","DOI":"10.1007\/3-540-60598-3_31"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB17","doi-asserted-by":"crossref","unstructured":"K. Kira, L. Rendell, A practical approach to feature selection, Proceedings of the 9th Int. Conf. on Machine Learning, 1992, pp. 249\u2013256.","DOI":"10.1016\/B978-1-55860-247-2.50037-1"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB18","doi-asserted-by":"crossref","unstructured":"I. Kononenko, Estimating attributes; analysis and extension of RELIEF, Proceedings of the 10th European Conf. on Machine Learning, 1995, pp. 171\u2013182.","DOI":"10.1007\/3-540-57868-4_57"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB19","series-title":"Linear Statistical Inference and Its Application","author":"Rao","year":"1965"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB20","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1145\/7902.7906","article-title":"Towards memory-based reasoning","author":"Stanfill","year":"1986","journal-title":"Commun. ACM"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00994658","article-title":"An experimental comparison of the nearest neighbor and nearest hyperrectangle algorithms","volume":"19","author":"Wettschereck","year":"1995","journal-title":"Mach. Learning"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB22","unstructured":"D. Koller, R.M. Sahami, Toward optimal feature selection, Proceedings of the 13th Int. Conf. on Machine Learning 13 (1996) 284\u2013292."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB23","first-page":"1","article-title":"Improved heterogeneous distance functions","author":"Wilson","year":"1997","journal-title":"J. Arti. Intell. Res."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB24","series-title":"Classification and Regression Trees.","author":"Breiman","year":"1984"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB25","doi-asserted-by":"crossref","unstructured":"R.E. Schapire, Y. Singer, Improved boosting algorithms using confidence-rated predictions, Proceedings of the 11th Int. Conf. on Computational Learning Theory, 1998, pp. 80\u201391.","DOI":"10.1145\/279943.279960"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB26","doi-asserted-by":"crossref","unstructured":"M.J. Kearns, Y. Mansour, On the boosting ability of top-down decision tree learning algorithms, Proceedings of the 28th Ann. ACM Symp. on the Theory of Computing, 1996, pp. 459\u2013468.","DOI":"10.1145\/237814.237994"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB27","doi-asserted-by":"crossref","first-page":"534","DOI":"10.2307\/2283520","article-title":"An analysis of variance for categorical data","volume":"66","author":"Light","year":"1971","journal-title":"J. Amer. Stat. Assoc."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB28","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/64.539009","article-title":"Relevance and insight in experimental studies","volume":"11","author":"Langley","year":"1996","journal-title":"IEEE Expert"},{"key":"10.1016\/S0031-3203(01)00084-X_BIB29","unstructured":"C.L. Blake, C.J. Merz, UCI repository of machine learning databases, 1998. http:\/\/www.ics.uci.edu\/\u223cmlearn\/MLRepository.html."},{"key":"10.1016\/S0031-3203(01)00084-X_BIB30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00994006","article-title":"A further comparison of splitting rules for decision-tree induction","volume":"8","author":"Buntine","year":"1992","journal-title":"Mach. Learning"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132030100084X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132030100084X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:58:54Z","timestamp":1578448734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S003132030100084X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S003132030100084X"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(01)00084-x","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}