Accelerating the computation of Shapley effects for datasets with many observations

<?xml version="1.0" encoding="UTF-8"?><modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-8.xsd">
<mods version="3.8">
<titleInfo>
<title>Accelerating the computation of Shapley effects for datasets with many observations</title>
</titleInfo>
<name type="personal" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20140009800">
<namePart>Tzougas, George</namePart>
<nameIdentifier>MAPA20140009800</nameIdentifier>
</name>
<typeOfResource>text</typeOfResource>
<genre authority="marcgt">periodical</genre>
<originInfo>
<place>
<placeTerm type="code" authority="marccountry">che</placeTerm>
</place>
<dateIssued encoding="marc">2026</dateIssued>
<issuance>serial</issuance>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription>
<form authority="marcform">print</form>
</physicalDescription>
<abstract displayLabel="Summary">Shapley effects are enjoying increasing popularity as importance measures. These indices allocate the variance of the quantity of interest among every risk factor, and a risk factor explaining more variance than another one is more important. Recently, Vallarino et al. (ASTIN Bull J IAA, 2023. https://doi.org/10.1017/asb.2023.34) propose a computational strategy for Shapley effects using the idea of cohorts of similar observations. However, this strategy becomes extremely computationally demanding if the dataset contains many observations. In this work we propose a computational shortcut based on design of experiments and clustering techniques to speed up the computational time. Using the well-known French claim frequency dataset, we demonstrate the huge reduction in computational time, without a significant loss of accuracy in the estimation of the Shapley effects</abstract>
<note type="statement of responsibility">Giovanni Rabitti and George Tzougas</note>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080579258">
<topic>Cálculo actuarial</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080597733">
<topic>Modelos estadísticos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20140022717">
<topic>Big data</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080611200">
<topic>Inteligencia artificial</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080570651">
<topic>Siniestralidad</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20170005476">
<topic>Machine learning</topic>
</subject>
<classification authority="">6</classification>
<relatedItem type="host">
<titleInfo>
<title>European Actuarial Journal</title>
</titleInfo>
<originInfo>
<publisher>Cham, Switzerland  : Springer Nature Switzerland AG,  2021-2022</publisher>
</originInfo>
<identifier type="local">MAP20220007085</identifier>
<part>
<text>15/12/2025 Volume 15 Issue 3 - December 2025 , 14 p.</text>
</part>
</relatedItem>
<recordInfo>
<recordContentSource authority="marcorg">MAP</recordContentSource>
<recordCreationDate encoding="marc">260225</recordCreationDate>
<recordChangeDate encoding="iso8601">20260310165748.0</recordChangeDate>
<recordIdentifier source="MAP">MAP20260006291</recordIdentifier>
<languageOfCataloging>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</languageOfCataloging>
</recordInfo>
</mods>
</modsCollection>