Like-minded communities: bringing the familiarity and similarity together

Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborho...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:World wide web (Bussum) 2014-09, Vol.17 (5), p.899-919
Hauptverfasser: Modani, Natwar, Nagar, Seema, Shannigrahi, Saswata, Gupta, Ritesh, Dey, Kuntal, Goyal, Saurabh, Nanavati, Amit A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 919
container_issue 5
container_start_page 899
container_title World wide web (Bussum)
container_volume 17
creator Modani, Natwar
Nagar, Seema
Shannigrahi, Saswata
Gupta, Ritesh
Dey, Kuntal
Goyal, Saurabh
Nanavati, Amit A.
description Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.
doi_str_mv 10.1007/s11280-013-0261-1
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1685802852</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3594233241</sourcerecordid><originalsourceid>FETCH-LOGICAL-c419t-c183d9972efe752a06feba75f0c4f934d40136074e5fc22355a776046f71323</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWKs_wNuCFy_RmWST7HqT4keh4EEP3kK6m9TU_ajJ9tB_b5b1IIIwMDPwvMM7LyGXCDcIoG4jIiuAAnIKTCLFIzJDoTjFHPlxmnkh0yzeT8lZjFsAkLzEGVmu_Kelre9qW2dV37b7zg_exrtsHXy3SZUNHzZzpvWNN8EPh8x0dRZ92qd16Dc2IeGcnDjTRHvx0-fk9fHhbfFMVy9Py8X9ilY5lgOtsOB1WSpmnVWCGZDOro0SDqrclTyv8_SDBJVb4SrGuBBGKQm5dAo543NyPV3dhf5rb-OgWx8r2zSms_0-apSFKIAVYkSv_qDbfh-65C1RQigsQGKicKKq0McYrNO74FsTDhpBj9HqKVqdbOkxWj1q2KSJuzEkG35d_lf0DZUsepY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1655718061</pqid></control><display><type>article</type><title>Like-minded communities: bringing the familiarity and similarity together</title><source>SpringerLink Journals</source><creator>Modani, Natwar ; Nagar, Seema ; Shannigrahi, Saswata ; Gupta, Ritesh ; Dey, Kuntal ; Goyal, Saurabh ; Nanavati, Amit A.</creator><creatorcontrib>Modani, Natwar ; Nagar, Seema ; Shannigrahi, Saswata ; Gupta, Ritesh ; Dey, Kuntal ; Goyal, Saurabh ; Nanavati, Amit A.</creatorcontrib><description>Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.</description><identifier>ISSN: 1386-145X</identifier><identifier>EISSN: 1573-1413</identifier><identifier>DOI: 10.1007/s11280-013-0261-1</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Communities ; Computer Science ; Database Management ; Graphs ; Information Systems Applications (incl.Internet) ; Mining ; Operating Systems ; Ratings ; Similarity ; Social aspects ; Social networks ; World Wide Web</subject><ispartof>World wide web (Bussum), 2014-09, Vol.17 (5), p.899-919</ispartof><rights>Springer Science+Business Media New York 2013</rights><rights>Springer Science+Business Media New York 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c419t-c183d9972efe752a06feba75f0c4f934d40136074e5fc22355a776046f71323</citedby><cites>FETCH-LOGICAL-c419t-c183d9972efe752a06feba75f0c4f934d40136074e5fc22355a776046f71323</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11280-013-0261-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11280-013-0261-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,41467,42536,51297</link.rule.ids></links><search><creatorcontrib>Modani, Natwar</creatorcontrib><creatorcontrib>Nagar, Seema</creatorcontrib><creatorcontrib>Shannigrahi, Saswata</creatorcontrib><creatorcontrib>Gupta, Ritesh</creatorcontrib><creatorcontrib>Dey, Kuntal</creatorcontrib><creatorcontrib>Goyal, Saurabh</creatorcontrib><creatorcontrib>Nanavati, Amit A.</creatorcontrib><title>Like-minded communities: bringing the familiarity and similarity together</title><title>World wide web (Bussum)</title><addtitle>World Wide Web</addtitle><description>Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.</description><subject>Communities</subject><subject>Computer Science</subject><subject>Database Management</subject><subject>Graphs</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Mining</subject><subject>Operating Systems</subject><subject>Ratings</subject><subject>Similarity</subject><subject>Social aspects</subject><subject>Social networks</subject><subject>World Wide Web</subject><issn>1386-145X</issn><issn>1573-1413</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kE1LAzEQhoMoWKs_wNuCFy_RmWST7HqT4keh4EEP3kK6m9TU_ajJ9tB_b5b1IIIwMDPwvMM7LyGXCDcIoG4jIiuAAnIKTCLFIzJDoTjFHPlxmnkh0yzeT8lZjFsAkLzEGVmu_Kelre9qW2dV37b7zg_exrtsHXy3SZUNHzZzpvWNN8EPh8x0dRZ92qd16Dc2IeGcnDjTRHvx0-fk9fHhbfFMVy9Py8X9ilY5lgOtsOB1WSpmnVWCGZDOro0SDqrclTyv8_SDBJVb4SrGuBBGKQm5dAo543NyPV3dhf5rb-OgWx8r2zSms_0-apSFKIAVYkSv_qDbfh-65C1RQigsQGKicKKq0McYrNO74FsTDhpBj9HqKVqdbOkxWj1q2KSJuzEkG35d_lf0DZUsepY</recordid><startdate>20140901</startdate><enddate>20140901</enddate><creator>Modani, Natwar</creator><creator>Nagar, Seema</creator><creator>Shannigrahi, Saswata</creator><creator>Gupta, Ritesh</creator><creator>Dey, Kuntal</creator><creator>Goyal, Saurabh</creator><creator>Nanavati, Amit A.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20140901</creationdate><title>Like-minded communities: bringing the familiarity and similarity together</title><author>Modani, Natwar ; Nagar, Seema ; Shannigrahi, Saswata ; Gupta, Ritesh ; Dey, Kuntal ; Goyal, Saurabh ; Nanavati, Amit A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c419t-c183d9972efe752a06feba75f0c4f934d40136074e5fc22355a776046f71323</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Communities</topic><topic>Computer Science</topic><topic>Database Management</topic><topic>Graphs</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Mining</topic><topic>Operating Systems</topic><topic>Ratings</topic><topic>Similarity</topic><topic>Social aspects</topic><topic>Social networks</topic><topic>World Wide Web</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Modani, Natwar</creatorcontrib><creatorcontrib>Nagar, Seema</creatorcontrib><creatorcontrib>Shannigrahi, Saswata</creatorcontrib><creatorcontrib>Gupta, Ritesh</creatorcontrib><creatorcontrib>Dey, Kuntal</creatorcontrib><creatorcontrib>Goyal, Saurabh</creatorcontrib><creatorcontrib>Nanavati, Amit A.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>World wide web (Bussum)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Modani, Natwar</au><au>Nagar, Seema</au><au>Shannigrahi, Saswata</au><au>Gupta, Ritesh</au><au>Dey, Kuntal</au><au>Goyal, Saurabh</au><au>Nanavati, Amit A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Like-minded communities: bringing the familiarity and similarity together</atitle><jtitle>World wide web (Bussum)</jtitle><stitle>World Wide Web</stitle><date>2014-09-01</date><risdate>2014</risdate><volume>17</volume><issue>5</issue><spage>899</spage><epage>919</epage><pages>899-919</pages><issn>1386-145X</issn><eissn>1573-1413</eissn><abstract>Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11280-013-0261-1</doi><tpages>21</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1386-145X
ispartof World wide web (Bussum), 2014-09, Vol.17 (5), p.899-919
issn 1386-145X
1573-1413
language eng
recordid cdi_proquest_miscellaneous_1685802852
source SpringerLink Journals
subjects Communities
Computer Science
Database Management
Graphs
Information Systems Applications (incl.Internet)
Mining
Operating Systems
Ratings
Similarity
Social aspects
Social networks
World Wide Web
title Like-minded communities: bringing the familiarity and similarity together
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T05%3A15%3A23IST&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=Like-minded%20communities:%20bringing%20the%20familiarity%20and%20similarity%20together&rft.jtitle=World%20wide%20web%20(Bussum)&rft.au=Modani,%20Natwar&rft.date=2014-09-01&rft.volume=17&rft.issue=5&rft.spage=899&rft.epage=919&rft.pages=899-919&rft.issn=1386-145X&rft.eissn=1573-1413&rft_id=info:doi/10.1007/s11280-013-0261-1&rft_dat=%3Cproquest_cross%3E3594233241%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=1655718061&rft_id=info:pmid/&rfr_iscdi=true