An agent-based clustering algorithm using potential fields
In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position i...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 558 |
|---|---|
| container_issue | |
| container_start_page | 551 |
| container_title | |
| container_volume | |
| creator | Baghshah, M.S. Shouraki, S.B. Lucas, C. |
| description | In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next position to the other agents. The movement of agents is continued until all of them reach equilibrium points. |
| doi_str_mv | 10.1109/AICCSA.2008.4493586 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4493586</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4493586</ieee_id><sourcerecordid>4493586</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e9d274c0bfa5d7492366020871c103fc0a31f6a2bd4903db46fcbd41ab71c9c03</originalsourceid><addsrcrecordid>eNpVkMtOwzAURM2jEm3pF3STH0i412-ziyIelSqxANaVYzvBKE2rOF3w9wRRIbGaGZ3RLIaQNUKBCOau3FTVa1lQAF1wbpjQ8oKsjNLIKedopBaXZE5RYi4Yg6t_TOnrP0bpjCymGWXAKGA3ZJHSJwAzVIs5uS_7zLahH_PapuAz153SGIbYt5nt2sMQx499dko_-XgYp160XdbE0Pl0S2aN7VJYnXVJ3h8f3qrnfPvytKnKbR5RiTEPxlPFHdSNFV5xQ5mUQEErdAiscWAZNtLS2nMDzNdcNm7yaOupYRywJVn_7sYQwu44xL0dvnbnT9g3H71O0w</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An agent-based clustering algorithm using potential fields</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Baghshah, M.S. ; Shouraki, S.B. ; Lucas, C.</creator><creatorcontrib>Baghshah, M.S. ; Shouraki, S.B. ; Lucas, C.</creatorcontrib><description>In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next position to the other agents. The movement of agents is continued until all of them reach equilibrium points.</description><identifier>ISSN: 2161-5322</identifier><identifier>ISBN: 9781424419678</identifier><identifier>ISBN: 1424419670</identifier><identifier>EISSN: 2161-5330</identifier><identifier>EISBN: 9781424419685</identifier><identifier>EISBN: 1424419689</identifier><identifier>DOI: 10.1109/AICCSA.2008.4493586</identifier><identifier>LCCN: 2007909703</identifier><language>eng</language><publisher>IEEE</publisher><subject>Birds ; Clustering algorithms ; Complex networks ; Gravity ; Insects ; Mobile agents ; Multiagent systems ; Noise shaping ; Robustness ; Shape</subject><ispartof>2008 IEEE/ACS International Conference on Computer Systems and Applications, 2008, p.551-558</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4493586$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4493586$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Baghshah, M.S.</creatorcontrib><creatorcontrib>Shouraki, S.B.</creatorcontrib><creatorcontrib>Lucas, C.</creatorcontrib><title>An agent-based clustering algorithm using potential fields</title><title>2008 IEEE/ACS International Conference on Computer Systems and Applications</title><addtitle>AICCSA</addtitle><description>In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next position to the other agents. The movement of agents is continued until all of them reach equilibrium points.</description><subject>Birds</subject><subject>Clustering algorithms</subject><subject>Complex networks</subject><subject>Gravity</subject><subject>Insects</subject><subject>Mobile agents</subject><subject>Multiagent systems</subject><subject>Noise shaping</subject><subject>Robustness</subject><subject>Shape</subject><issn>2161-5322</issn><issn>2161-5330</issn><isbn>9781424419678</isbn><isbn>1424419670</isbn><isbn>9781424419685</isbn><isbn>1424419689</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtOwzAURM2jEm3pF3STH0i412-ziyIelSqxANaVYzvBKE2rOF3w9wRRIbGaGZ3RLIaQNUKBCOau3FTVa1lQAF1wbpjQ8oKsjNLIKedopBaXZE5RYi4Yg6t_TOnrP0bpjCymGWXAKGA3ZJHSJwAzVIs5uS_7zLahH_PapuAz153SGIbYt5nt2sMQx499dko_-XgYp160XdbE0Pl0S2aN7VJYnXVJ3h8f3qrnfPvytKnKbR5RiTEPxlPFHdSNFV5xQ5mUQEErdAiscWAZNtLS2nMDzNdcNm7yaOupYRywJVn_7sYQwu44xL0dvnbnT9g3H71O0w</recordid><startdate>200803</startdate><enddate>200803</enddate><creator>Baghshah, M.S.</creator><creator>Shouraki, S.B.</creator><creator>Lucas, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200803</creationdate><title>An agent-based clustering algorithm using potential fields</title><author>Baghshah, M.S. ; Shouraki, S.B. ; Lucas, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e9d274c0bfa5d7492366020871c103fc0a31f6a2bd4903db46fcbd41ab71c9c03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Birds</topic><topic>Clustering algorithms</topic><topic>Complex networks</topic><topic>Gravity</topic><topic>Insects</topic><topic>Mobile agents</topic><topic>Multiagent systems</topic><topic>Noise shaping</topic><topic>Robustness</topic><topic>Shape</topic><toplevel>online_resources</toplevel><creatorcontrib>Baghshah, M.S.</creatorcontrib><creatorcontrib>Shouraki, S.B.</creatorcontrib><creatorcontrib>Lucas, C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Baghshah, M.S.</au><au>Shouraki, S.B.</au><au>Lucas, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An agent-based clustering algorithm using potential fields</atitle><btitle>2008 IEEE/ACS International Conference on Computer Systems and Applications</btitle><stitle>AICCSA</stitle><date>2008-03</date><risdate>2008</risdate><spage>551</spage><epage>558</epage><pages>551-558</pages><issn>2161-5322</issn><eissn>2161-5330</eissn><isbn>9781424419678</isbn><isbn>1424419670</isbn><eisbn>9781424419685</eisbn><eisbn>1424419689</eisbn><abstract>In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next position to the other agents. The movement of agents is continued until all of them reach equilibrium points.</abstract><pub>IEEE</pub><doi>10.1109/AICCSA.2008.4493586</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2161-5322 |
| ispartof | 2008 IEEE/ACS International Conference on Computer Systems and Applications, 2008, p.551-558 |
| issn | 2161-5322 2161-5330 |
| language | eng |
| recordid | cdi_ieee_primary_4493586 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Birds Clustering algorithms Complex networks Gravity Insects Mobile agents Multiagent systems Noise shaping Robustness Shape |
| title | An agent-based clustering algorithm using potential fields |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T11%3A16%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20agent-based%20clustering%20algorithm%20using%20potential%20fields&rft.btitle=2008%20IEEE/ACS%20International%20Conference%20on%20Computer%20Systems%20and%20Applications&rft.au=Baghshah,%20M.S.&rft.date=2008-03&rft.spage=551&rft.epage=558&rft.pages=551-558&rft.issn=2161-5322&rft.eissn=2161-5330&rft.isbn=9781424419678&rft.isbn_list=1424419670&rft_id=info:doi/10.1109/AICCSA.2008.4493586&rft_dat=%3Cieee_6IE%3E4493586%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424419685&rft.eisbn_list=1424419689&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4493586&rfr_iscdi=true |