A Dynamic Clustering Algorithm for Mobile Objects
Identifieur interne : 000413 ( Istex/Checkpoint ); précédent : 000412; suivant : 000414A Dynamic Clustering Algorithm for Mobile Objects
Auteurs : Dominique Fournier [France] ; Gaële Simon [France] ; Bruno Mermet [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: In this paper, a multiagent algorithm for dynamic clustering is presented. This kind of clustering is intended to manage mobile data and so, to be able to continuously adapt the built clusters. First of all, potential applications of this algorithm are presented. Then the specific constraints for this kind of clustering are studied. A multiagent architecture satisfying these constraints is described. It combines an ants algorithm with a cluster agents layer which are executed simultaneously. Finally, the first experimental results of our work are presented.
Url:
DOI: 10.1007/978-3-540-74976-9_42
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:BAC012938499D5FFCDAE79E4A77BF33B80E163B3Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Dynamic Clustering Algorithm for Mobile Objects</title>
<author><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name>
</author>
<author><name sortKey="Simon, Gaele" sort="Simon, Gaele" uniqKey="Simon G" first="Gaële" last="Simon">Gaële Simon</name>
</author>
<author><name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:BAC012938499D5FFCDAE79E4A77BF33B80E163B3</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-74976-9_42</idno>
<idno type="url">https://api.istex.fr/document/BAC012938499D5FFCDAE79E4A77BF33B80E163B3/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000B98</idno>
<idno type="wicri:Area/Istex/Curation">000B98</idno>
<idno type="wicri:Area/Istex/Checkpoint">000413</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Dynamic Clustering Algorithm for Mobile Objects</title>
<author><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Simon, Gaele" sort="Simon, Gaele" uniqKey="Simon G" first="Gaële" last="Simon">Gaële Simon</name>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2007</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">BAC012938499D5FFCDAE79E4A77BF33B80E163B3</idno>
<idno type="DOI">10.1007/978-3-540-74976-9_42</idno>
<idno type="ChapterID">42</idno>
<idno type="ChapterID">Chap42</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper, a multiagent algorithm for dynamic clustering is presented. This kind of clustering is intended to manage mobile data and so, to be able to continuously adapt the built clusters. First of all, potential applications of this algorithm are presented. Then the specific constraints for this kind of clustering are studied. A multiagent architecture satisfying these constraints is described. It combines an ants algorithm with a cluster agents layer which are executed simultaneously. Finally, the first experimental results of our work are presented.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name>
</noRegion>
<name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name>
<name sortKey="Simon, Gaele" sort="Simon, Gaele" uniqKey="Simon G" first="Gaële" last="Simon">Gaële Simon</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000413 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000413 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/France |area= LeHavreV1 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:BAC012938499D5FFCDAE79E4A77BF33B80E163B3 |texte= A Dynamic Clustering Algorithm for Mobile Objects }}
![]() | This area was generated with Dilib version V0.6.25. | ![]() |