{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:42:04Z","timestamp":1776940924285,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1007612503587","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"175-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":141,"title":["A Formalism for Relevance and Its Application in Feature Subset Selection"],"prefix":"10.1007","volume":"41","author":[{"given":"David A.","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"274345_CR1","unstructured":"Aha, D. W. & Bankert, R. L. (1994). Feature selection for case-based classification of cloud types. In Working notes of the AAAI94 Workshop on Case-based Reasoning (pp. 106\u2013112). AAAI Press."},{"key":"274345_CR2","unstructured":"Almuallim, H. & Dietterich, T. G. (1991). Learning with many irrelevant features. In Proc. Ninth National Conference on Artificial Intelligence (pp. 547\u2013552). MIT Press."},{"key":"274345_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","volume":"69","author":"H. Almuallim","year":"1994","unstructured":"Almuallim, H. & Dietterich, T. G. (1994). Learning boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69, 279\u2013305.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"274345_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0893-6080(94)90026-4","volume":"7","author":"B. Amirikian","year":"1994","unstructured":"Amirikian, B. & Nishimura, H. (1994). What size network is good for generalization of a specific task of interest? Neural Networks, 7(2), 321\u2013329.","journal-title":"Neural Networks"},{"key":"274345_CR5","unstructured":"Blum, A. (1994). Relevant examples & relevant features: thoughts from computational learning theory. In Relevance: Proc. 1994 AAAI Fall Symposium (pp. 14\u201318). AAAI Press."},{"key":"274345_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987). Occam's Razor. Information Processing Letters, 24, 377\u2013380.","journal-title":"Information Processing Letters"},{"key":"274345_CR7","unstructured":"Carnap, R. (1962). Logical foundations of probability. The University of Chicago Press."},{"key":"274345_CR8","first-page":"28","volume-title":"Proceedings of the 11th international conference on machine learning","author":"R. A. Caruana","year":"1994","unstructured":"Caruana, R. A. & Freitag, D. (1994). Greedy attribute selection. In Proceedings of the 11th international conference on machine learning (pp. 28\u201336). New Brunswick, NJ: Morgan Kaufmann."},{"key":"274345_CR9","unstructured":"Cover, T. M. & Thomas, J. A. 1991. Elements of information theory. John Wiley & Sons, Inc."},{"key":"274345_CR10","unstructured":"Davies, S. & Russell, S. 1994. NP-completeness of searches for smallest possible feature sets. In Proceedings of the 1994 AAAI Fall Symposium on Relevance (pp. 37\u201339). AAAI Press."},{"key":"274345_CR11","unstructured":"Fayyad, U. & Irani, K. (1990). What should be minimized in a decision tree? In AAAI-90: Proceedings of 8th National Conference on Artificial Intelligence (pp. 749\u2013754)."},{"key":"274345_CR12","unstructured":"Fayyad, U. & Irani, K. (1992). The attribute selection problem in decision tree generation. In AAAI-92: Proceedings of 10th National Conference on Artificial Intelligence (pp. 104\u2013110)."},{"key":"274345_CR13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF00873245","volume":"37","author":"P. G\u00e4rdenfors","year":"1978","unstructured":"G\u00e4rdenfors, P. (1978). On the logic of relevance. Synthese, 37, 351\u2013367.","journal-title":"Synthese"},{"key":"274345_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0004-3702(89)90046-5","volume":"40","author":"J. H. Gennari","year":"1989","unstructured":"Gennari, J. H., Langley, P., & Fisher, D. (1989). Models of incremental concept formation. Artificial Intelligence, 40, 11\u201361.","journal-title":"Artificial Intelligence"},{"key":"274345_CR15","unstructured":"Greiner, R. & Subramanian, D. (Eds.). 1994. In Relevance: Proc. 1994 AAAI Fall Symposium. The AAAI Press. AAAI Technical Report FS\u201394\u201302."},{"key":"274345_CR16","first-page":"121","volume-title":"Proceedings of the 11th international conference on machine learning","author":"G. H. John","year":"1994","unstructured":"John, G. H., Kohavi, R., & Pfleger, K. (1994). Irrelevant features and the subset selection problem. In Proceedings of the 11th international conference on machine learning (pp. 121\u2013129). New Brunswick, NJ: Morgan Kaufmann."},{"key":"274345_CR17","volume-title":"A treatise on probability","author":"J. M. Keynes","year":"1921","unstructured":"Keynes, J. M. (1921). A treatise on probability. London: Macmillan."},{"key":"274345_CR18","unstructured":"Kira, K. & Rendell, L. A. (1992). The feature selection problem: traditional methods and a new algorithm. In AAAI-92 (pp. 129\u2013134)."},{"key":"274345_CR19","unstructured":"Kohavi, R. & Sommerfield, D. (1995). Feature subset selection using the wrapper method: Overfitting and dynamic search space topology. In U. M. Fayyad & R. Uthurusamy (Eds.), Proceedings of KDD'95 (pp. 192\u2013197)."},{"key":"274345_CR20","unstructured":"Kohavi, R. (1994). Feature Subset Selection as Search with Probabilistic Estimates. In R. Greiner, & D. Subramanian (Eds.). Relevance: Proc 1994 AAAI Fall Symposium (pp. 122\u2013126). The AAAI Press."},{"key":"274345_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1008280620621","volume":"7","author":"I. Kononenko","year":"1997","unstructured":"Kononenko, I., Simec, E., & Robnik-Sikonja, M. (1997). Overcoming the myopia of inductive learning algorithms with relieff. Applied Intelligence, 7, 39\u201355.","journal-title":"Applied Intelligence"},{"key":"274345_CR22","doi-asserted-by":"crossref","unstructured":"Kononenko, I. (1994) Estimating attributes: Analysis and extensions of RELIEF. In Proceedings of the 1994 European Conference on Machine Learning (pp. 171\u2013182).","DOI":"10.1007\/3-540-57868-4_57"},{"key":"274345_CR23","unstructured":"Lakemeyer, G. (1995). A Logical account of relevance. In Proc. of IJCAI-95 (pp. 853\u2013859)."},{"key":"274345_CR24","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. (1988). Machine learning, 2, 285\u2013318.","journal-title":"Machine learning"},{"key":"274345_CR25","first-page":"279","volume-title":"Proceedings of The First International Conference on Discovery Science (DS'98)","author":"H. Liu","year":"1998","unstructured":"Liu, H. & Setiono, R. (1998). Feature transformation and multivariate decision tree induction. In Proceedings of The First International Conference on Discovery Science (DS'98) (pp. 279\u2013290). Fukuoka, Japan. Springer-Verlag."},{"issue":"4","key":"274345_CR26","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1109\/69.617056","volume":"9","author":"H. Liu","year":"1997","unstructured":"Liu, H. & Setiono, R. (1997). Feature selection via discretization of numeric attributes. IEEE Trans on Knowledge and Data Engineering, 9(4), 642\u2013645.","journal-title":"IEEE Trans on Knowledge and Data Engineering"},{"key":"274345_CR27","volume-title":"Inductive Logic Programming","year":"1992","unstructured":"Muggleton, S. (ed.). 1992. Inductive Logic Programming. London: Academic Press."},{"key":"274345_CR28","volume-title":"Probabilistic reasoning in intelligent systems: Networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Francisco, California: Morgan Kaufmann Publishers, Inc."},{"key":"274345_CR29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. Quinlan","year":"1989","unstructured":"Quinlan, J. & Rivest, R. (1989). Inferring decision trees using the minimum description length principle. Information and Computation, 80, 227\u2013248.","journal-title":"Information and Computation"},{"key":"274345_CR30","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1214\/aos\/1176350051","volume":"14","author":"J. Rissanen","year":"1986","unstructured":"Rissanen, J. (1986). Stochastic complexity and modeling. Ann. Statist., 14, 1080\u20131100.","journal-title":"Ann. Statist."},{"key":"274345_CR31","doi-asserted-by":"crossref","unstructured":"Schlimmer, J. C. (1993). Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In ML93, pp. 284\u2013290.","DOI":"10.1016\/B978-1-55860-307-3.50043-5"},{"issue":"11","key":"274345_CR32","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1109\/34.473229","volume":"17","author":"H. Schweitzer","year":"1995","unstructured":"Schweitzer, H. (1995). Occam algorithms for computing visual motion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(11), 1033\u20131042.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"274345_CR33","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TIT.1980.1056144","volume":"26","author":"J. E. Shore","year":"1980","unstructured":"Shore, J. E. & Johnson, R.W. (1980). Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Information Theory, 26, 26\u201337.","journal-title":"IEEE Trans. Information Theory"},{"key":"274345_CR34","first-page":"293","volume-title":"Proceedings of the 11th International Conference on Machine Learning","author":"D. B. Skalak","year":"1994","unstructured":"Skalak, D. B. (1994). Prototype and feature selection by sampling and random mutation hill-climbing algorithms. In Proceedings of the 11th International Conference on Machine Learning (pp. 293\u2013301). New Brunswick, N.J.: Morgan Kaufmann."},{"key":"274345_CR35","unstructured":"Subramanian, D. & Genesereth, M. R. (1987). The relevance of irrelevance. In Proc. of IJCAI-87 (pp. 416\u2013422)."},{"key":"274345_CR36","unstructured":"Ullman, J. D. (1989). Principles of database and knowledgebase systems. Computer Science Press."},{"key":"274345_CR37","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","volume":"49","author":"C. Wallace","year":"1987","unstructured":"Wallace, C. & Freeman, P. (1987). Estimation and inference by compact coding. Journal of the Royal Statistical Society (B), 49, 240\u2013265.","journal-title":"Journal of the Royal Statistical Society (B)"},{"key":"274345_CR38","volume-title":"Towards a unified framework of relevance","author":"H. Wang","year":"1996","unstructured":"Wang, H. (1996). Towards a unified framework of relevance. Ph.D. Thesis, Faculty of Informatics, University of Ulster, N. Ireland, UK. http:\/\/www.infj.ulst.ac.uk\/\u223ccbcj23\/thesis.ps."},{"key":"274345_CR39","first-page":"319","volume":"4","author":"D. H. Wolpert","year":"1990","unstructured":"Wolpert, D. H. (1990). The relationship between Occam's Razor and convergent guessing. Complex Systems, 4, 319\u2013368.","journal-title":"Complex Systems"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007612503587.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007612503587\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007612503587.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:35:13Z","timestamp":1752147313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007612503587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["274345"],"URL":"https:\/\/doi.org\/10.1023\/a:1007612503587","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}