The DOI matches its Crossref record; 28 of the 33 references it cites were found in a registry or an index.
Feature Selection via Coalitional Game Theory
Open accessAbstract
We present and study the contribution-selection algorithm (CSA), a novel algorithm for feature selection. The algorithm is based on the multiperturbation shapley analysis (MSA), a framework that relies on game theory to estimate usefulness. The algorithm iteratively estimates the usefulness of features and selects them accordingly, using either forward selection or backward elimination. It can optimize various performance measures over unseen data such as accuracy, balanced error rate, and area under receiver-operator-characteristic curve. Empirical comparison with several other existing feature selection methods shows that the backward elimination variant of CSA leads to the most accurate classification results on an array of data sets.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The Shapley value, introduced by (Shapley 1952; Hart 1989; Cohen, Dror, and Ruppin 2007; Lundberg and Lee 2017; Ghorbani and Zou 2019), provides a solution concept for cooperative games that fairly distributes the rewards among players according to their marginal contributions.”
From Understanding and Optimizing Agentic Workflows via Shapley value (2025) · cites this paper as Cohen, Dror, and Ruppin 2007
In the citing paper
“Specifically, we use the Shapley value (Shapley 1952; Hart 1989; Cohen, Dror, and Ruppin 2007; Lundberg and Lee 2017; Ghorbani and Zou 2019), a mathematically rigorous method to quantify both individual component contributions and their interaction effects across all possible component configurations.”
From Understanding and Optimizing Agentic Workflows via Shapley value (2025) · cites this paper as Cohen, Dror, and Ruppin 2007
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Shapley, L. (1988) · Cambridge University Press eBooks · doi:10.1017/cbo9780511528446.003 · Cited by 10,698
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 9,096
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,809
Making Large-Scale SVM Learning PracticalPreprint
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,517
Alon, U. S., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S. E., Mack, D. H., & Levine, A. J. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.12.6745 · Cited by 4,170
Selection of relevant features and examples in machine learning
Blum, A. L., & Pat Langley, B. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,294
A Method for Evaluating the Distribution of Power in a Committee System
Shapley, L. S., & Shubik, M. (1954) · American Political Science Review · doi:10.2307/1951053 · Cited by 2,205
Contributions to the theory of games.
Volume, I. V. (1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90366-5 · Cited by 1,851
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,436
Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. N. (2000) · Cited by 988
Axiomatic Models of Bargaining
Roth, A. E. (1979) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-51570-5 · Cited by 805
Kanji, G. K. (2006) · SAGE Publications Ltd eBooks · doi:10.4135/9781849208499 · Cited by 787
Some statistical issues in the comparison of speech recognition algorithms
Gillick, L., & Cox, S. J. (2003) · International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1989.266481 · Cited by 636
Sharing the Cost of Multicast Transmissions
Joan Feigenbaum, A., Papadimitriou, C. H., & Shenker, S. J. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1754 · Cited by 406
Grafting: fast, incremental feature selection by gradient descent in function space
Perkins, S. J., Lacker, K., & Theiler, J. P. (2003) · Cited by 312
Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing
Shubik, M. (1962) · Management Science · doi:10.1287/mnsc.8.3.325 · Cited by 298
Ranking a random feature for variable and feature selection
Stoppiglia, H., Dreyfus, G., Dubois, R., & Oussar, Y. (2003) · doi:10.5555/944919.944980 · Cited by 286
Learning to remove Internet advertisements
Kushmerick, N. (1999) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/301136.301186 · Cited by 192
Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory
Billera, L. J., Heath, D. C., & Raanan, J. (1978) · Operations Research · doi:10.1287/opre.26.6.956 · Cited by 150
Fair Attribution of Functional Contribution in Artificial and Biological Networks
Keinan, A., Sandbank, B., Hilgetag, C. C., Meilijson, I., & Ruppin, E. (2004) · Neural Computation · doi:10.1162/0899766041336387 · Cited by 107
Self-citationAxiomatic Scalable Neurocontroller Analysis via the Shapley Value
Keinan, A., Sandbank, B., Hilgetag, C. C., Meilijson, I., & Ruppin, E. (2006) · Artificial Life · doi:10.1162/artl.2006.12.3.333 · Cited by 53
Self-citationMlps (mono layer polynomials and multi layer perceptrons) for nonlinear modeling
Rivals, I., & Personnaz, L. (2003) · Journal of Machine Learning Research · Cited by 51
Averaging Attributable Fractions in the Multifactorial Situation: Assumptions and Interpretation
Gefeller, O., Land, M., & Eide, G. E. (1998) · Journal of Clinical Epidemiology · doi:10.1016/s0895-4356(98)00002-x · Cited by 44
The R.oo package - Object-oriented programming with references using standard R code
Bengtsson, H. L. (2003) · Cited by 22
A unified way in incorporating segmental feature and segmental model into HMM
He, J. Y. D., & Leich, H. (2002) · International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1995.479646 · Cited by 9
Cited by
Sorted by citations
An Efficient Explanation of Individual Classifications using Game Theory
Štrumbelj, E., & Kononenko, I. (2010) · Repository of the University of Ljubljana (University of Ljubljana) · doi:10.5555/1756006.1756007 · Cited by 570
Shapley values for feature selection: the good, the bad, and the axioms
Fryer, D., Strumke, I., & Nguyen, H. (2021) · IEEE Access · doi:10.1109/access.2021.3119110 · Cited by 347
The Shapley Value in Machine Learning
Rozemberczki, B., Watson, L., Bayer, P., Yang, H.-T., Kiss, O., Nilsson, S., & Sarkar, R. (2022) · arXiv · doi:10.48550/arxiv.2202.05594 · Cited by 312
The Shapley Value in Machine Learning
Rózemberczki, B., Watson, L., Bayer, P., Yang, H.-T., Kiss, O., Nilsson, S., & Sarkar, R. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/778 · Cited by 342
Visualizing the Feature Importance for Black Box Models
Casalicchio, G., Molnar, C., & Bischl, B. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-10925-7_40 · Cited by 236
Metadata
- Authors
- Cohen, S., Dror, G., & Ruppin, E.
- Affiliations
- Tel Aviv University (IL)
- Academic College of Tel Aviv-Yafo (IL)
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2007-07
- Volume
- 19
- Issue
- 7
- Pages
- 1939-1961
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2127538534
- Cited by
- 144
- References
- 33
- Citations by year
- 2026: 9 · 2025: 16 · 2024: 13 · 2023: 9 · 2022: 13 · 2021: 17 · 2020: 13 · 2019: 7 · 2018: 4 · 2016: 4 · 2015: 7 · 2014: 8 · 2013: 4 · 2012: 2
- FWCI
- 3.95
- Type
- journal article
- Language
- en
- Open access
- Licence
- other-oa
- Locations
- Neural Computation (publishedVersion)
- PubMed (publishedVersion)
- Edinburgh Research Explorer (University of Edinburgh) (submittedVersion, other-oa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- feature selection, cooperative game theory, forward selection, backward elimination, classification accuracy
- MeSH terms
- Algorithms, Game Theory, Humans, Neural Networks, Computer
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
