{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:19:02Z","timestamp":1770337142287,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030573201","type":"print"},{"value":"9783030573218","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57321-8_6","type":"book-chapter","created":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T21:03:33Z","timestamp":1597871013000},"page":"97-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Projected Stochastic Gradient Algorithm for Estimating Shapley Value Applied in Attribute Importance"],"prefix":"10.1007","author":[{"given":"Grah","family":"Simon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thouvenot","family":"Vincent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"6_CR1","unstructured":"Aas, K., Jullum, M., L\u00f8land, A.: Explaining individual predictions when features are dependent: more accurate approximations to Shapley values (2019)"},{"key":"6_CR2","unstructured":"Bach, F.: https:\/\/www.di.ens.fr\/ fbach\/orsay2020.html, https:\/\/www.di.ens.fr\/~fbach\/fbach_orsay_2020.pdf"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barredo Arrieta, A., et al.: Explainable artificial Intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. J. Inf. Fusion 58, 82\u2013115 (2020)","DOI":"10.1016\/j.inffus.2019.12.012"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Breiman, L., Random, F.: Machine Learning 45, 5\u201332 (2001)","DOI":"10.1023\/A:1010933404324"},{"key":"6_CR5","unstructured":"https:\/\/www.propublica.org\/datastore\/dataset\/compas-recidivism-risk-score-data-and-analysis"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Boyle, J.P., Dykstra, R.L.: A method for finding projections onto the intersection of convex sets in Hilbert spaces (1986). Lecture Notes in Statistics. 37, pp. 28\u201347","DOI":"10.1007\/978-1-4613-9940-7_3"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.cor.2017.01.019","volume":"82","author":"J Castro","year":"2017","unstructured":"Castro, J., G\u00f3mez, D., Molina, E., Tejada, J.: Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation. Comput. Oper. Res. 82, 180\u2013188 (2017)","journal-title":"Comput. Oper. Res."},{"key":"6_CR8","unstructured":"Chen, J., Le, S., Wainwright, M.J., Jordan, M.I.: L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Data (2018)"},{"key":"6_CR9","unstructured":"Chen, H., Lundberg, S., Lee, S.-I.: Explaining Models by Propagating Shapley Values (2019). https:\/\/arxiv.org\/abs\/1911.11888"},{"key":"6_CR10","unstructured":"Gower, R.M.: https:\/\/perso.telecom-paristech.fr\/rgower\/pdf\/M2_statistique_optimisation\/grad_conv.pdf"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer Series in Statistics (2009)","DOI":"10.1007\/978-0-387-84858-7"},{"key":"6_CR12","unstructured":"Elizabeth Kumar, I., Venkatasubramanian, S., Scheidegger, C., Friedler, S.: Problems with Shapley-value-based explanations as feature importance measures (2020)"},{"key":"6_CR13","unstructured":"Lacoste-Julien, S., Schmidt, M., Bach, F.: A simpler approach to obtaining an O(1\/t) convergence rate for the projected stochastic subgradient method (2012)"},{"key":"6_CR14","unstructured":"Lundberg, S.M., Lee, S.-I.: A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems (2017)"},{"key":"6_CR15","unstructured":"Lundberg, S.M., Lee, S.-I.: Consistent feature attribution for tree ensembles (2017). https:\/\/arxiv.org\/abs\/1706.06060"},{"key":"6_CR16","unstructured":"Maleki, S., Tran-Thanh, L., Hines, G., Rahwan, T., Rogers, A.: Bounding the Estimation Error of Sampling-based Shapley Value Approximation With\/Without Stratifying (2013)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Merrick, L., Taly, A.: The Explanation Game: Explaining Machine Learning Models with Cooperative Game Theory (2019)","DOI":"10.1007\/978-3-030-57321-8_2"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Molnar, C., Casalicchio, G., Bischl, B.: Quantifying Model Complexity via Functional Decomposition for Better Post-Hoc Interpretability (2019)","DOI":"10.1007\/978-3-030-43823-4_17"},{"key":"6_CR19","unstructured":"Molnar, C.: Interpretable Machine Learning, A Guide for Making Black Box Models Explainable (2019). https:\/\/christophm.github.io\/interpretable-ml-book\/"},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.automatica.2008.01.017","volume":"44","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y., Vial, J.P.: Confidence level solutions for stochastic programming. Automatica 44(6), 1559\u20131568 (2008)","journal-title":"Automatica"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Ruiz, L.M., Valenciano, F., Zarzuelo, J.M.: The Family of Least Square Values for Transferable Utility Games, Games and Economic Behavior (1998)","DOI":"10.1006\/game.1997.0622"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. In: Contributions to the Theory of Games. 2.28, pp. 307\u2013317 (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"6_CR24","unstructured":"Shrikumar, A., Greenside, P., Shcherbina, A., Kundaje, A.: Not Just a Black Box: Learning Important Features Through Propagating Activation Differences (2016). https:\/\/arxiv.org\/abs\/1605.01713"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E \u0160trumbelj","year":"2013","unstructured":"\u0160trumbelj, E., Kononenko, I.: Explaining prediction models and individual predictions with feature contributions. Knowl. Inf. Syst. 41(3), 647\u2013665 (2013). https:\/\/doi.org\/10.1007\/s10115-013-0679-x","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR26","first-page":"1","volume":"11","author":"J Mach","year":"2010","unstructured":"Mach, J., Strumbelj, E., Kononenko, I.: An efficient explanation of individual classifications using game theory. Mach. Learn. Res. 11, 1\u201318 (2010)","journal-title":"Mach. Learn. Res."},{"key":"6_CR27","unstructured":"Sundararajan, M., Najmi, A.: The many Shapley values for model explanation (2019)"},{"issue":"1","key":"6_CR28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Roy. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc. Ser. B"},{"key":"6_CR29","unstructured":"Wang, G.: Interpret Federated Learning with Shapley Values (2019)"},{"key":"6_CR30","unstructured":"Zhao, P., Zhang, T.: Stochastic optimization with importance sampling for regularized loss minimization. In: Proceedings of the 32nd International Conference on Machine Learning, vol. 37, pp. 1\u20139 (2015)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57321-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T06:51:06Z","timestamp":1724050266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57321-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030573201","9783030573218"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57321-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CD-MAKE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Cross-Domain Conference for Machine Learning and Knowledge Extraction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cd-make2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cd-make.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}