Bifurcation community partitioning algorithm based on the extreme optimization
A method based on the extreme optimized bifurcation community partitioning algorithm is proposed in this paper. Based on the local contribution to the algorithm, proposed the concept of bifurcation, and adjusted the community construction though calculating and comparing the indirect contribution of...
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 | 2994 |
|---|---|
| container_issue | |
| container_start_page | 2992 |
| container_title | |
| container_volume | |
| creator | Furong Chang Xinyi Chen |
| description | A method based on the extreme optimized bifurcation community partitioning algorithm is proposed in this paper. Based on the local contribution to the algorithm, proposed the concept of bifurcation, and adjusted the community construction though calculating and comparing the indirect contribution of bifurcation in order to make the result more reasonable. A social network, Zachary is applied to the algorithm The result shows that it can divide communities rapidly and correctly. |
| doi_str_mv | 10.1109/ICMT.2011.6001877 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6001877</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6001877</ieee_id><sourcerecordid>6001877</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-be0f9d6bd7a8ddbc0a0edc770133600e4b74c0e83a587239d206bed0e06245213</originalsourceid><addsrcrecordid>eNpFj9tKAzEYhCMiqLUPIN7kBXb9s0lzuNRFa6Hqzd6XZPNvG-keyKZgfXpXLTg3wwzDB0PILYOcMTD3q_K1ygtgLJcATCt1Rq6ZZIUWSglz_h-YuCTzcfyASVIars0VeXsMzSHWNoW-o3XftocupCMdbEzhpwvdltr9to8h7Vrq7IieTsu0Q4qfKWKLtB9SaMPXL-KGXDR2P-L85DNSPT9V5Uu2fl-uyod1FgykzCE0xkvnldXeuxosoK-VAsb59AGFU6IG1NwutCq48QVIhx4QZCEWBeMzcveHDYi4GWJobTxuTvf5N8mwUBc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Bifurcation community partitioning algorithm based on the extreme optimization</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Furong Chang ; Xinyi Chen</creator><creatorcontrib>Furong Chang ; Xinyi Chen</creatorcontrib><description>A method based on the extreme optimized bifurcation community partitioning algorithm is proposed in this paper. Based on the local contribution to the algorithm, proposed the concept of bifurcation, and adjusted the community construction though calculating and comparing the indirect contribution of bifurcation in order to make the result more reasonable. A social network, Zachary is applied to the algorithm The result shows that it can divide communities rapidly and correctly.</description><identifier>ISBN: 1612847714</identifier><identifier>ISBN: 9781612847719</identifier><identifier>EISBN: 1612847749</identifier><identifier>EISBN: 1612847730</identifier><identifier>EISBN: 9781612847740</identifier><identifier>EISBN: 9781612847733</identifier><identifier>DOI: 10.1109/ICMT.2011.6001877</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Bifurcation ; Communities ; community discovery ; Complex networks ; Complexity theory ; contribution ; modularity ; Optimization ; Partitioning algorithms</subject><ispartof>2011 International Conference on Multimedia Technology, 2011, p.2992-2994</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/6001877$$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/6001877$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Furong Chang</creatorcontrib><creatorcontrib>Xinyi Chen</creatorcontrib><title>Bifurcation community partitioning algorithm based on the extreme optimization</title><title>2011 International Conference on Multimedia Technology</title><addtitle>ICMT</addtitle><description>A method based on the extreme optimized bifurcation community partitioning algorithm is proposed in this paper. Based on the local contribution to the algorithm, proposed the concept of bifurcation, and adjusted the community construction though calculating and comparing the indirect contribution of bifurcation in order to make the result more reasonable. A social network, Zachary is applied to the algorithm The result shows that it can divide communities rapidly and correctly.</description><subject>Algorithm design and analysis</subject><subject>Bifurcation</subject><subject>Communities</subject><subject>community discovery</subject><subject>Complex networks</subject><subject>Complexity theory</subject><subject>contribution</subject><subject>modularity</subject><subject>Optimization</subject><subject>Partitioning algorithms</subject><isbn>1612847714</isbn><isbn>9781612847719</isbn><isbn>1612847749</isbn><isbn>1612847730</isbn><isbn>9781612847740</isbn><isbn>9781612847733</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFj9tKAzEYhCMiqLUPIN7kBXb9s0lzuNRFa6Hqzd6XZPNvG-keyKZgfXpXLTg3wwzDB0PILYOcMTD3q_K1ygtgLJcATCt1Rq6ZZIUWSglz_h-YuCTzcfyASVIars0VeXsMzSHWNoW-o3XftocupCMdbEzhpwvdltr9to8h7Vrq7IieTsu0Q4qfKWKLtB9SaMPXL-KGXDR2P-L85DNSPT9V5Uu2fl-uyod1FgykzCE0xkvnldXeuxosoK-VAsb59AGFU6IG1NwutCq48QVIhx4QZCEWBeMzcveHDYi4GWJobTxuTvf5N8mwUBc</recordid><startdate>201107</startdate><enddate>201107</enddate><creator>Furong Chang</creator><creator>Xinyi Chen</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201107</creationdate><title>Bifurcation community partitioning algorithm based on the extreme optimization</title><author>Furong Chang ; Xinyi Chen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-be0f9d6bd7a8ddbc0a0edc770133600e4b74c0e83a587239d206bed0e06245213</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Bifurcation</topic><topic>Communities</topic><topic>community discovery</topic><topic>Complex networks</topic><topic>Complexity theory</topic><topic>contribution</topic><topic>modularity</topic><topic>Optimization</topic><topic>Partitioning algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Furong Chang</creatorcontrib><creatorcontrib>Xinyi Chen</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>Furong Chang</au><au>Xinyi Chen</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Bifurcation community partitioning algorithm based on the extreme optimization</atitle><btitle>2011 International Conference on Multimedia Technology</btitle><stitle>ICMT</stitle><date>2011-07</date><risdate>2011</risdate><spage>2992</spage><epage>2994</epage><pages>2992-2994</pages><isbn>1612847714</isbn><isbn>9781612847719</isbn><eisbn>1612847749</eisbn><eisbn>1612847730</eisbn><eisbn>9781612847740</eisbn><eisbn>9781612847733</eisbn><abstract>A method based on the extreme optimized bifurcation community partitioning algorithm is proposed in this paper. Based on the local contribution to the algorithm, proposed the concept of bifurcation, and adjusted the community construction though calculating and comparing the indirect contribution of bifurcation in order to make the result more reasonable. A social network, Zachary is applied to the algorithm The result shows that it can divide communities rapidly and correctly.</abstract><pub>IEEE</pub><doi>10.1109/ICMT.2011.6001877</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1612847714 |
| ispartof | 2011 International Conference on Multimedia Technology, 2011, p.2992-2994 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6001877 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Bifurcation Communities community discovery Complex networks Complexity theory contribution modularity Optimization Partitioning algorithms |
| title | Bifurcation community partitioning algorithm based on the extreme optimization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T15%3A59%3A09IST&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=Bifurcation%20community%20partitioning%20algorithm%20based%20on%20the%20extreme%20optimization&rft.btitle=2011%20International%20Conference%20on%20Multimedia%20Technology&rft.au=Furong%20Chang&rft.date=2011-07&rft.spage=2992&rft.epage=2994&rft.pages=2992-2994&rft.isbn=1612847714&rft.isbn_list=9781612847719&rft_id=info:doi/10.1109/ICMT.2011.6001877&rft_dat=%3Cieee_6IE%3E6001877%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1612847749&rft.eisbn_list=1612847730&rft.eisbn_list=9781612847740&rft.eisbn_list=9781612847733&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6001877&rfr_iscdi=true |