Controling the number of focal elements Some combinatorial considerations
Identifieur interne : 000224 ( Hal/Checkpoint ); précédent : 000223; suivant : 000225Controling the number of focal elements Some combinatorial considerations
Auteurs : Christophe Osswald [France]Source :
English descriptors
- mix :
Abstract
A basic belief assignment can have up to 2n focal elements, and combining them with a simple conjunctive operator will need O(22n) opera- tions. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The rst section revisits some well-known de nitions with an algorithmic point of vue. The second section proposes a matrix way of building the least committed isopignistic, and extends it to some other bodies of evidence. The third section adapts the k-means algorithm for an unsupervized clustering of the focal elements of a given bba.
Url:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:hal-00703969Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Controling the number of focal elements Some combinatorial considerations</title>
<author><name sortKey="Osswald, Christophe" sort="Osswald, Christophe" uniqKey="Osswald C" first="Christophe" last="Osswald">Christophe Osswald</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-391112" status="INCOMING"><orgName>Lab-STICC_ENSTAB_CID_DECIDE ; OSM</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-81533" type="direct"></relation>
<relation active="#struct-108091" type="indirect"></relation>
<relation active="#struct-172265" type="indirect"></relation>
<relation active="#struct-300314" type="indirect"></relation>
<relation active="#struct-301262" type="indirect"></relation>
<relation active="#struct-301521" type="indirect"></relation>
<relation active="#struct-302102" type="indirect"></relation>
<relation name="UMR3192" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-171465" type="direct"></relation>
<relation active="#struct-301846" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-81533" type="direct"><org type="laboratory" xml:id="struct-81533" status="OLD"><orgName>Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance</orgName>
<orgName type="acronym">Lab-STICC</orgName>
<desc><address><addrLine>Technopole Brest Iroise BP 832 29285 BREST CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lab-sticc.fr/</ref>
</desc>
<listRelation><relation active="#struct-108091" type="direct"></relation>
<relation active="#struct-172265" type="direct"></relation>
<relation active="#struct-300314" type="direct"></relation>
<relation active="#struct-301262" type="direct"></relation>
<relation active="#struct-301521" type="direct"></relation>
<relation active="#struct-302102" type="direct"></relation>
<relation name="UMR3192" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-108091" type="indirect"><org type="institution" xml:id="struct-108091" status="VALID"><orgName>Université européenne de Bretagne</orgName>
<orgName type="acronym">UEB</orgName>
<desc><address><addrLine>5 boulevard Laënnec - 35000 Rennes</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ueb.eu/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-172265" type="indirect"><org type="institution" xml:id="struct-172265" status="VALID"><orgName>Université de Bretagne Sud</orgName>
<orgName type="acronym">UBS</orgName>
<desc><address><addrLine>BP 92116 - 56321 Lorient cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-ubs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300314" type="indirect"><org type="institution" xml:id="struct-300314" status="VALID"><orgName>Université de Bretagne Occidentale</orgName>
<orgName type="acronym">UBO</orgName>
<desc><address><addrLine>3 Rue des Archives 29238 Brest</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301262" type="indirect"><org type="institution" xml:id="struct-301262" status="VALID"><orgName>Télécom Bretagne</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301521" type="indirect"><org type="institution" xml:id="struct-301521" status="VALID"><orgName>Institut Supérieur des Sciences et Technologies de Brest (ISSTB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302102" type="indirect"><org type="institution" xml:id="struct-302102" status="VALID"><orgName>Institut Mines-Télécom</orgName>
<desc><address><addrLine>46 rue Barrault -75634 Paris Cedex 13</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.mines-telecom.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR3192" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-171465" type="direct"><org type="laboratory" xml:id="struct-171465" status="VALID"><orgName>Pôle STIC [Brest]</orgName>
<orgName type="acronym">STIC</orgName>
<desc><address><addrLine>2 rue François Verny 29806 Brest cedex 9</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ensta-bretagne.fr/index.php/pole-stic/</ref>
</desc>
<listRelation><relation active="#struct-301846" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-301846" type="indirect"><org type="institution" xml:id="struct-301846" status="VALID"><orgName>ENSTA Bretagne</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Lorient</settlement>
<region type="region" nuts="2">Région Bretagne</region>
</placeName>
<orgName type="university">Université de Bretagne-Sud</orgName>
<orgName type="institution" wicri:auto="newGroup">Université européenne de Bretagne</orgName>
<placeName><settlement type="city">Brest</settlement>
<region type="region" nuts="2">Région Bretagne</region>
</placeName>
<orgName type="university">Université de Bretagne Occidentale</orgName>
<orgName type="institution" wicri:auto="newGroup">Université européenne de Bretagne</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00703969</idno>
<idno type="halId">hal-00703969</idno>
<idno type="halUri">https://hal-ensta-bretagne.archives-ouvertes.fr/hal-00703969</idno>
<idno type="url">https://hal-ensta-bretagne.archives-ouvertes.fr/hal-00703969</idno>
<date when="2012-05-09">2012-05-09</date>
<idno type="wicri:Area/Hal/Corpus">000056</idno>
<idno type="wicri:Area/Hal/Curation">000056</idno>
<idno type="wicri:Area/Hal/Checkpoint">000224</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Controling the number of focal elements Some combinatorial considerations</title>
<author><name sortKey="Osswald, Christophe" sort="Osswald, Christophe" uniqKey="Osswald C" first="Christophe" last="Osswald">Christophe Osswald</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-391112" status="INCOMING"><orgName>Lab-STICC_ENSTAB_CID_DECIDE ; OSM</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-81533" type="direct"></relation>
<relation active="#struct-108091" type="indirect"></relation>
<relation active="#struct-172265" type="indirect"></relation>
<relation active="#struct-300314" type="indirect"></relation>
<relation active="#struct-301262" type="indirect"></relation>
<relation active="#struct-301521" type="indirect"></relation>
<relation active="#struct-302102" type="indirect"></relation>
<relation name="UMR3192" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-171465" type="direct"></relation>
<relation active="#struct-301846" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-81533" type="direct"><org type="laboratory" xml:id="struct-81533" status="OLD"><orgName>Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance</orgName>
<orgName type="acronym">Lab-STICC</orgName>
<desc><address><addrLine>Technopole Brest Iroise BP 832 29285 BREST CEDEX</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lab-sticc.fr/</ref>
</desc>
<listRelation><relation active="#struct-108091" type="direct"></relation>
<relation active="#struct-172265" type="direct"></relation>
<relation active="#struct-300314" type="direct"></relation>
<relation active="#struct-301262" type="direct"></relation>
<relation active="#struct-301521" type="direct"></relation>
<relation active="#struct-302102" type="direct"></relation>
<relation name="UMR3192" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-108091" type="indirect"><org type="institution" xml:id="struct-108091" status="VALID"><orgName>Université européenne de Bretagne</orgName>
<orgName type="acronym">UEB</orgName>
<desc><address><addrLine>5 boulevard Laënnec - 35000 Rennes</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ueb.eu/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-172265" type="indirect"><org type="institution" xml:id="struct-172265" status="VALID"><orgName>Université de Bretagne Sud</orgName>
<orgName type="acronym">UBS</orgName>
<desc><address><addrLine>BP 92116 - 56321 Lorient cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-ubs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300314" type="indirect"><org type="institution" xml:id="struct-300314" status="VALID"><orgName>Université de Bretagne Occidentale</orgName>
<orgName type="acronym">UBO</orgName>
<desc><address><addrLine>3 Rue des Archives 29238 Brest</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301262" type="indirect"><org type="institution" xml:id="struct-301262" status="VALID"><orgName>Télécom Bretagne</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301521" type="indirect"><org type="institution" xml:id="struct-301521" status="VALID"><orgName>Institut Supérieur des Sciences et Technologies de Brest (ISSTB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302102" type="indirect"><org type="institution" xml:id="struct-302102" status="VALID"><orgName>Institut Mines-Télécom</orgName>
<desc><address><addrLine>46 rue Barrault -75634 Paris Cedex 13</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.mines-telecom.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR3192" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-171465" type="direct"><org type="laboratory" xml:id="struct-171465" status="VALID"><orgName>Pôle STIC [Brest]</orgName>
<orgName type="acronym">STIC</orgName>
<desc><address><addrLine>2 rue François Verny 29806 Brest cedex 9</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ensta-bretagne.fr/index.php/pole-stic/</ref>
</desc>
<listRelation><relation active="#struct-301846" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-301846" type="indirect"><org type="institution" xml:id="struct-301846" status="VALID"><orgName>ENSTA Bretagne</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Lorient</settlement>
<region type="region" nuts="2">Région Bretagne</region>
</placeName>
<orgName type="university">Université de Bretagne-Sud</orgName>
<orgName type="institution" wicri:auto="newGroup">Université européenne de Bretagne</orgName>
<placeName><settlement type="city">Brest</settlement>
<region type="region" nuts="2">Région Bretagne</region>
</placeName>
<orgName type="university">Université de Bretagne Occidentale</orgName>
<orgName type="institution" wicri:auto="newGroup">Université européenne de Bretagne</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Basic belief assignments</term>
<term>Body of evidence</term>
<term>Combinatorial complexity</term>
<term>Focal ele- ments</term>
<term>Least commitment</term>
<term>Pignistic probability</term>
<term>k-means</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A basic belief assignment can have up to 2n focal elements, and combining them with a simple conjunctive operator will need O(22n) opera- tions. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The rst section revisits some well-known de nitions with an algorithmic point of vue. The second section proposes a matrix way of building the least committed isopignistic, and extends it to some other bodies of evidence. The third section adapts the k-means algorithm for an unsupervized clustering of the focal elements of a given bba.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Controling the number of focal elements Some combinatorial considerations</title>
<author role="aut"><persName><forename type="first">Christophe</forename>
<surname>Osswald</surname>
</persName>
<email></email>
<idno type="halauthor">645486</idno>
<affiliation ref="#struct-391112"></affiliation>
</author>
<editor role="depositor"><persName><forename>Annick</forename>
<surname>Billon-Coat</surname>
</persName>
<email>coatan@ensieta.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2012-06-04 15:47:01</date>
<date type="whenModified">2015-02-12 17:03:34</date>
<date type="whenReleased">2012-06-04 15:47:01</date>
<date type="whenProduced">2012-05-09</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="148298"><persName><forename>Annick</forename>
<surname>Billon-Coat</surname>
</persName>
<email>coatan@ensieta.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00703969</idno>
<idno type="halUri">https://hal-ensta-bretagne.archives-ouvertes.fr/hal-00703969</idno>
<idno type="halBibtex">osswald:hal-00703969</idno>
<idno type="halRefHtml">International Conference on Belief Function, May 2012, Compiègne, France. 164, pp.135, 2012, <10.1007/978-3-642-29461-7></idno>
<idno type="halRef">International Conference on Belief Function, May 2012, Compiègne, France. 164, pp.135, 2012, <10.1007/978-3-642-29461-7></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INSTITUT-TELECOM">Institut Télécom</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="ENSTA-BRETAGNE">ENSTA Bretagne</idno>
<idno type="stamp" n="ENSTA-BRETAGNE-STIC">Pôle STIC</idno>
<idno type="stamp" n="UNIV-BREST">Université de Bretagne occidentale - Brest</idno>
<idno type="stamp" n="ISSTB" p="UNIV-BREST">Institut Supérieur des Sciences et Technologies de Brest</idno>
<idno type="stamp" n="CAHIERS_CEIMA" p="UNIV-BREST">Les Cahiers du CEIMA</idno>
<idno type="stamp" n="UNIV-UBS">Université de Bretagne Sud</idno>
<idno type="stamp" n="LAB-STICC">Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Controling the number of focal elements Some combinatorial considerations</title>
<author role="aut"><persName><forename type="first">Christophe</forename>
<surname>Osswald</surname>
</persName>
<idno type="halAuthorId">645486</idno>
<affiliation ref="#struct-391112"></affiliation>
</author>
</analytic>
<monogr><title level="m">Belief Functions: Theory and Applications</title>
<meeting><title>International Conference on Belief Function</title>
<date type="start">2012-05-09</date>
<date type="end">2012-05-11</date>
<settlement>Compiègne</settlement>
<country key="FR">France</country>
</meeting>
<imprint><biblScope unit="volume">164</biblScope>
<biblScope unit="pp">135</biblScope>
<date type="datePub">2012-05-09</date>
</imprint>
</monogr>
<idno type="doi">10.1007/978-3-642-29461-7</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Body of evidence</term>
<term xml:lang="en">Least commitment</term>
<term xml:lang="en">k-means</term>
<term xml:lang="en">Pignistic probability</term>
<term xml:lang="en">Basic belief assignments</term>
<term xml:lang="en">Combinatorial complexity</term>
<term xml:lang="en">Focal ele- ments</term>
</keywords>
<classCode scheme="halDomain" n="phys.phys.phys-data-an">Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">A basic belief assignment can have up to 2n focal elements, and combining them with a simple conjunctive operator will need O(22n) opera- tions. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The rst section revisits some well-known de nitions with an algorithmic point of vue. The second section proposes a matrix way of building the least committed isopignistic, and extends it to some other bodies of evidence. The third section adapts the k-means algorithm for an unsupervized clustering of the focal elements of a given bba.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000224 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000224 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Musique |area= OperaV1 |flux= Hal |étape= Checkpoint |type= RBID |clé= Hal:hal-00703969 |texte= Controling the number of focal elements Some combinatorial considerations }}
This area was generated with Dilib version V0.6.21. |