Búsqueda

Data clustering with actuarial applications

<?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>Data clustering with actuarial applications</title>
</titleInfo>
<name type="personal" usage="primary" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20140000234">
<namePart>Gan, Guojun</namePart>
<nameIdentifier>MAPA20140000234</nameIdentifier>
</name>
<name type="personal" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080648428">
<namePart>Valdez, Emiliano A.</namePart>
<nameIdentifier>MAPA20080648428</nameIdentifier>
</name>
<typeOfResource>text</typeOfResource>
<genre authority="marcgt">periodical</genre>
<originInfo>
<place>
<placeTerm type="code" authority="marccountry">usa</placeTerm>
</place>
<dateIssued encoding="marc">2020</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">Data clustering refers to the process of dividing a set of objects into homogeneous groups or clusters such that the objects in each cluster are more similar to each other than to those of other clusters. As one of the most popular tools for exploratory data analysis, data clustering has been applied in many scientific areas. In this article, we give a review of the basics of data clustering, such as distance measures and cluster validity, and different types of clustering algorithms. We also demonstrate the applications of data clustering in insurance by using two scalable clustering algorithms, the truncated fuzzy c-means (TFCM) algorithm and the hierarchical k-means algorithm, to select representative variable annuity contracts, which are used to build predictive models. We found that the hierarchical k-means algorithm is efficient and produces high-quality representative variable annuity contracts.</abstract>
<note type="statement of responsibility">Guojun Gan, Emiliano A. Valdez</note>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080578848">
<topic>Análisis de datos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080553128">
<topic>Algoritmos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080592059">
<topic>Modelos predictivos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080602437">
<topic>Matemática del seguro</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080579258">
<topic>Cálculo actuarial</topic>
</subject>
<classification authority="">6</classification>
<relatedItem type="host">
<titleInfo>
<title>North American actuarial journal</title>
</titleInfo>
<originInfo>
<publisher>Schaumburg : Society of Actuaries, 1997-</publisher>
</originInfo>
<identifier type="issn">1092-0277</identifier>
<identifier type="local">MAP20077000239</identifier>
<part>
<text>01/06/2020 Tomo 24 Número 2 - 2020 , p. 168-186</text>
</part>
</relatedItem>
<recordInfo>
<recordContentSource authority="marcorg">MAP</recordContentSource>
<recordCreationDate encoding="marc">200528</recordCreationDate>
<recordChangeDate encoding="iso8601">20220911211151.0</recordChangeDate>
<recordIdentifier source="MAP">MAP20200018070</recordIdentifier>
<languageOfCataloging>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</languageOfCataloging>
</recordInfo>
</mods>
</modsCollection>