Overlapping community detection using superior seed set selection in social networks
Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an emerging drift in this area. The basic idea behind these strateg...
Gespeichert in:
Veröffentlicht in: | Computers & electrical engineering 2018-08, Vol.70, p.1074-1083 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1083 |
---|---|
container_issue | |
container_start_page | 1074 |
container_title | Computers & electrical engineering |
container_volume | 70 |
creator | Belfin, RV Kanaga, E Grace Mary Bródka, Piotr |
description | Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an emerging drift in this area. The basic idea behind these strategies is to identify exceptional nodes in the given network, called seeds, around which communities can be located. This paper proposes a blended strategy for locating suitable superior seed set by applying various centrality measures and using them to find overlapping communities. The examination of the algorithm has been performed regarding the goodness of the identified communities with the help of intra-cluster density and inter-cluster density. Finally, the runtime of the proposed algorithm has been compared with the existing community detection algorithms showing remarkable improvement. |
doi_str_mv | 10.1016/j.compeleceng.2018.03.012 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2124460816</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0045790617318256</els_id><sourcerecordid>2124460816</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-9addbe95032837c062adba090980ae133fef9076b524c9e17623950dabe8a12f3</originalsourceid><addsrcrecordid>eNqNUMtOwzAQtBBIlMI_BHFOWNuJEx9RxUuq1Es5W46zqRzSONhJEX-Pq_bAkcPuarUzs5oh5J5CRoGKxy4zbj9ijwaHXcaAVhnwDCi7IAtalTKFsiguyQIgL9JSgrgmNyF0EHdBqwXZbg7oez2OdtglUWo_D3b6SRqc0EzWDckcjpcwj-it80lAbGKbYvVnhB2S4IzVfTLg9O38Z7glV63uA96d55J8vDxvV2_pevP6vnpapybP-ZRK3TQ1ygI4q3hpQDDd1BokyAo0Us5bbCWUoi5YbiTSUjAe0Y2usdKUtXxJHk66o3dfM4ZJdW72Q3ypGGV5LqCiIqLkCWW8C8Fjq0Zv99r_KArqGKLq1J8Q1TFEBVzFECN3deJitHGw6FUwFgeDjfXRvmqc_YfKLyP0gkE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2124460816</pqid></control><display><type>article</type><title>Overlapping community detection using superior seed set selection in social networks</title><source>Elsevier ScienceDirect Journals</source><creator>Belfin, RV ; Kanaga, E Grace Mary ; Bródka, Piotr</creator><creatorcontrib>Belfin, RV ; Kanaga, E Grace Mary ; Bródka, Piotr</creatorcontrib><description>Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an emerging drift in this area. The basic idea behind these strategies is to identify exceptional nodes in the given network, called seeds, around which communities can be located. This paper proposes a blended strategy for locating suitable superior seed set by applying various centrality measures and using them to find overlapping communities. The examination of the algorithm has been performed regarding the goodness of the identified communities with the help of intra-cluster density and inter-cluster density. Finally, the runtime of the proposed algorithm has been compared with the existing community detection algorithms showing remarkable improvement.</description><identifier>ISSN: 0045-7906</identifier><identifier>EISSN: 1879-0755</identifier><identifier>DOI: 10.1016/j.compeleceng.2018.03.012</identifier><language>eng</language><publisher>Amsterdam: Elsevier Ltd</publisher><subject>Algorithms ; Centrality ; Clustering ; Clusters ; Communities ; Community development ; Density ; Overlapping community discovery ; Seed set ; Seed-centric ; Seeds ; Social network ; Social networks</subject><ispartof>Computers & electrical engineering, 2018-08, Vol.70, p.1074-1083</ispartof><rights>2018 Elsevier Ltd</rights><rights>Copyright Elsevier BV Aug 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-9addbe95032837c062adba090980ae133fef9076b524c9e17623950dabe8a12f3</citedby><cites>FETCH-LOGICAL-c443t-9addbe95032837c062adba090980ae133fef9076b524c9e17623950dabe8a12f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0045790617318256$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Belfin, RV</creatorcontrib><creatorcontrib>Kanaga, E Grace Mary</creatorcontrib><creatorcontrib>Bródka, Piotr</creatorcontrib><title>Overlapping community detection using superior seed set selection in social networks</title><title>Computers & electrical engineering</title><description>Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an emerging drift in this area. The basic idea behind these strategies is to identify exceptional nodes in the given network, called seeds, around which communities can be located. This paper proposes a blended strategy for locating suitable superior seed set by applying various centrality measures and using them to find overlapping communities. The examination of the algorithm has been performed regarding the goodness of the identified communities with the help of intra-cluster density and inter-cluster density. Finally, the runtime of the proposed algorithm has been compared with the existing community detection algorithms showing remarkable improvement.</description><subject>Algorithms</subject><subject>Centrality</subject><subject>Clustering</subject><subject>Clusters</subject><subject>Communities</subject><subject>Community development</subject><subject>Density</subject><subject>Overlapping community discovery</subject><subject>Seed set</subject><subject>Seed-centric</subject><subject>Seeds</subject><subject>Social network</subject><subject>Social networks</subject><issn>0045-7906</issn><issn>1879-0755</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNqNUMtOwzAQtBBIlMI_BHFOWNuJEx9RxUuq1Es5W46zqRzSONhJEX-Pq_bAkcPuarUzs5oh5J5CRoGKxy4zbj9ijwaHXcaAVhnwDCi7IAtalTKFsiguyQIgL9JSgrgmNyF0EHdBqwXZbg7oez2OdtglUWo_D3b6SRqc0EzWDckcjpcwj-it80lAbGKbYvVnhB2S4IzVfTLg9O38Z7glV63uA96d55J8vDxvV2_pevP6vnpapybP-ZRK3TQ1ygI4q3hpQDDd1BokyAo0Us5bbCWUoi5YbiTSUjAe0Y2usdKUtXxJHk66o3dfM4ZJdW72Q3ypGGV5LqCiIqLkCWW8C8Fjq0Zv99r_KArqGKLq1J8Q1TFEBVzFECN3deJitHGw6FUwFgeDjfXRvmqc_YfKLyP0gkE</recordid><startdate>20180801</startdate><enddate>20180801</enddate><creator>Belfin, RV</creator><creator>Kanaga, E Grace Mary</creator><creator>Bródka, Piotr</creator><general>Elsevier Ltd</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20180801</creationdate><title>Overlapping community detection using superior seed set selection in social networks</title><author>Belfin, RV ; Kanaga, E Grace Mary ; Bródka, Piotr</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-9addbe95032837c062adba090980ae133fef9076b524c9e17623950dabe8a12f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Centrality</topic><topic>Clustering</topic><topic>Clusters</topic><topic>Communities</topic><topic>Community development</topic><topic>Density</topic><topic>Overlapping community discovery</topic><topic>Seed set</topic><topic>Seed-centric</topic><topic>Seeds</topic><topic>Social network</topic><topic>Social networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Belfin, RV</creatorcontrib><creatorcontrib>Kanaga, E Grace Mary</creatorcontrib><creatorcontrib>Bródka, Piotr</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & electrical engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Belfin, RV</au><au>Kanaga, E Grace Mary</au><au>Bródka, Piotr</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Overlapping community detection using superior seed set selection in social networks</atitle><jtitle>Computers & electrical engineering</jtitle><date>2018-08-01</date><risdate>2018</risdate><volume>70</volume><spage>1074</spage><epage>1083</epage><pages>1074-1083</pages><issn>0045-7906</issn><eissn>1879-0755</eissn><abstract>Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an emerging drift in this area. The basic idea behind these strategies is to identify exceptional nodes in the given network, called seeds, around which communities can be located. This paper proposes a blended strategy for locating suitable superior seed set by applying various centrality measures and using them to find overlapping communities. The examination of the algorithm has been performed regarding the goodness of the identified communities with the help of intra-cluster density and inter-cluster density. Finally, the runtime of the proposed algorithm has been compared with the existing community detection algorithms showing remarkable improvement.</abstract><cop>Amsterdam</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.compeleceng.2018.03.012</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0045-7906 |
ispartof | Computers & electrical engineering, 2018-08, Vol.70, p.1074-1083 |
issn | 0045-7906 1879-0755 |
language | eng |
recordid | cdi_proquest_journals_2124460816 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Centrality Clustering Clusters Communities Community development Density Overlapping community discovery Seed set Seed-centric Seeds Social network Social networks |
title | Overlapping community detection using superior seed set selection in social networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T23%3A09%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Overlapping%20community%20detection%20using%20superior%20seed%20set%20selection%20in%20social%20networks&rft.jtitle=Computers%20&%20electrical%20engineering&rft.au=Belfin,%20RV&rft.date=2018-08-01&rft.volume=70&rft.spage=1074&rft.epage=1083&rft.pages=1074-1083&rft.issn=0045-7906&rft.eissn=1879-0755&rft_id=info:doi/10.1016/j.compeleceng.2018.03.012&rft_dat=%3Cproquest_cross%3E2124460816%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2124460816&rft_id=info:pmid/&rft_els_id=S0045790617318256&rfr_iscdi=true |