Social collaborative filtering using local dynamic overlapping community detection
Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method can propose high-quality suggestions through using other individuals’ opinions. In real world and with the changing nature of individu...
Gespeichert in:
Veröffentlicht in: | The Journal of supercomputing 2021, Vol.77 (10), p.11786-11806 |
---|---|
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 | 11806 |
---|---|
container_issue | 10 |
container_start_page | 11786 |
container_title | The Journal of supercomputing |
container_volume | 77 |
creator | Jalali, Shiva Hosseini, Monireh |
description | Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method can propose high-quality suggestions through using other individuals’ opinions. In real world and with the changing nature of individuals’ preferences, recommender systems are not only responsible for fulfilling the users’ interests, but also for modeling their dynamic behaviors. On the other hand, social networks provide new types of data that contribute to personalization and improvement of the performance of the recommender systems. In this paper, we propose a dynamic collaborating filtering-based social recommender system using a dynamic, local, and an overlapping community detection approach. In this study, in addition to the temporal users’ rating data for items, temporal friendship relations among users in social network are also considered and a local community detection method is combined with social recommendation technique in order to improve scalability, sparsity, and cold start issues of collaborative filtering. The proposed method is compared with a number of state-of-the-art recommendation methods. The experimental results on benchmark datasets show that the proposed method outperforms the compared methods based on different evaluation metrics. It has fewer errors (at least 5%) and higher accuracy (at least 12%) than pervious methods in sparse rating matrix and dynamic environment. |
doi_str_mv | 10.1007/s11227-021-03734-3 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2570438455</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2570438455</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-4ee80699ce2eab0886b18a0f3bd555443bad39f86675e28f5ed521501e7c41453</originalsourceid><addsrcrecordid>eNp9kEtLxDAQx4MouD6-gKeC5-jk1aZHWXzBguDjHNJ0Klnapibtwn57W1fw5mXmML__DPMj5IrBDQMobhNjnBcUOKMgCiGpOCIrpgpBQWp5TFZQcqBaSX5KzlLaAoCcuRV5fQvO2zZzoW1tFaId_Q6zxrcjRt9_ZlNaahvczNT73nbeZWGHsbXDsExc6Lqp9-M-q3FEN_rQX5CTxrYJL3_7Ofl4uH9fP9HNy-Pz-m5DnWDlSCWihrwsHXK0FWidV0xbaERVK6WkFJWtRdnoPC8Uct0orBVnChgWTjKpxDm5PuwdYviaMI1mG6bYzycNV8X8n5ZqofiBcjGkFLExQ_SdjXvDwCzuzMGdmd2ZH3dGzCFxCKVhsYDxb_U_qW8s23Jo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2570438455</pqid></control><display><type>article</type><title>Social collaborative filtering using local dynamic overlapping community detection</title><source>SpringerLink Journals - AutoHoldings</source><creator>Jalali, Shiva ; Hosseini, Monireh</creator><creatorcontrib>Jalali, Shiva ; Hosseini, Monireh</creatorcontrib><description>Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method can propose high-quality suggestions through using other individuals’ opinions. In real world and with the changing nature of individuals’ preferences, recommender systems are not only responsible for fulfilling the users’ interests, but also for modeling their dynamic behaviors. On the other hand, social networks provide new types of data that contribute to personalization and improvement of the performance of the recommender systems. In this paper, we propose a dynamic collaborating filtering-based social recommender system using a dynamic, local, and an overlapping community detection approach. In this study, in addition to the temporal users’ rating data for items, temporal friendship relations among users in social network are also considered and a local community detection method is combined with social recommendation technique in order to improve scalability, sparsity, and cold start issues of collaborative filtering. The proposed method is compared with a number of state-of-the-art recommendation methods. The experimental results on benchmark datasets show that the proposed method outperforms the compared methods based on different evaluation metrics. It has fewer errors (at least 5%) and higher accuracy (at least 12%) than pervious methods in sparse rating matrix and dynamic environment.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-021-03734-3</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Collaboration ; Community ; Compilers ; Computer Science ; Filtration ; Interpreters ; Processor Architectures ; Programming Languages ; Recommender systems ; Social networks</subject><ispartof>The Journal of supercomputing, 2021, Vol.77 (10), p.11786-11806</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-4ee80699ce2eab0886b18a0f3bd555443bad39f86675e28f5ed521501e7c41453</citedby><cites>FETCH-LOGICAL-c319t-4ee80699ce2eab0886b18a0f3bd555443bad39f86675e28f5ed521501e7c41453</cites><orcidid>0000-0002-9004-0676</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-021-03734-3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-021-03734-3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Jalali, Shiva</creatorcontrib><creatorcontrib>Hosseini, Monireh</creatorcontrib><title>Social collaborative filtering using local dynamic overlapping community detection</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method can propose high-quality suggestions through using other individuals’ opinions. In real world and with the changing nature of individuals’ preferences, recommender systems are not only responsible for fulfilling the users’ interests, but also for modeling their dynamic behaviors. On the other hand, social networks provide new types of data that contribute to personalization and improvement of the performance of the recommender systems. In this paper, we propose a dynamic collaborating filtering-based social recommender system using a dynamic, local, and an overlapping community detection approach. In this study, in addition to the temporal users’ rating data for items, temporal friendship relations among users in social network are also considered and a local community detection method is combined with social recommendation technique in order to improve scalability, sparsity, and cold start issues of collaborative filtering. The proposed method is compared with a number of state-of-the-art recommendation methods. The experimental results on benchmark datasets show that the proposed method outperforms the compared methods based on different evaluation metrics. It has fewer errors (at least 5%) and higher accuracy (at least 12%) than pervious methods in sparse rating matrix and dynamic environment.</description><subject>Collaboration</subject><subject>Community</subject><subject>Compilers</subject><subject>Computer Science</subject><subject>Filtration</subject><subject>Interpreters</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><subject>Recommender systems</subject><subject>Social networks</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAQx4MouD6-gKeC5-jk1aZHWXzBguDjHNJ0Klnapibtwn57W1fw5mXmML__DPMj5IrBDQMobhNjnBcUOKMgCiGpOCIrpgpBQWp5TFZQcqBaSX5KzlLaAoCcuRV5fQvO2zZzoW1tFaId_Q6zxrcjRt9_ZlNaahvczNT73nbeZWGHsbXDsExc6Lqp9-M-q3FEN_rQX5CTxrYJL3_7Ofl4uH9fP9HNy-Pz-m5DnWDlSCWihrwsHXK0FWidV0xbaERVK6WkFJWtRdnoPC8Uct0orBVnChgWTjKpxDm5PuwdYviaMI1mG6bYzycNV8X8n5ZqofiBcjGkFLExQ_SdjXvDwCzuzMGdmd2ZH3dGzCFxCKVhsYDxb_U_qW8s23Jo</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Jalali, Shiva</creator><creator>Hosseini, Monireh</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-9004-0676</orcidid></search><sort><creationdate>2021</creationdate><title>Social collaborative filtering using local dynamic overlapping community detection</title><author>Jalali, Shiva ; Hosseini, Monireh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-4ee80699ce2eab0886b18a0f3bd555443bad39f86675e28f5ed521501e7c41453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Collaboration</topic><topic>Community</topic><topic>Compilers</topic><topic>Computer Science</topic><topic>Filtration</topic><topic>Interpreters</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><topic>Recommender systems</topic><topic>Social networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jalali, Shiva</creatorcontrib><creatorcontrib>Hosseini, Monireh</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jalali, Shiva</au><au>Hosseini, Monireh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Social collaborative filtering using local dynamic overlapping community detection</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2021</date><risdate>2021</risdate><volume>77</volume><issue>10</issue><spage>11786</spage><epage>11806</epage><pages>11786-11806</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method can propose high-quality suggestions through using other individuals’ opinions. In real world and with the changing nature of individuals’ preferences, recommender systems are not only responsible for fulfilling the users’ interests, but also for modeling their dynamic behaviors. On the other hand, social networks provide new types of data that contribute to personalization and improvement of the performance of the recommender systems. In this paper, we propose a dynamic collaborating filtering-based social recommender system using a dynamic, local, and an overlapping community detection approach. In this study, in addition to the temporal users’ rating data for items, temporal friendship relations among users in social network are also considered and a local community detection method is combined with social recommendation technique in order to improve scalability, sparsity, and cold start issues of collaborative filtering. The proposed method is compared with a number of state-of-the-art recommendation methods. The experimental results on benchmark datasets show that the proposed method outperforms the compared methods based on different evaluation metrics. It has fewer errors (at least 5%) and higher accuracy (at least 12%) than pervious methods in sparse rating matrix and dynamic environment.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-021-03734-3</doi><tpages>21</tpages><orcidid>https://orcid.org/0000-0002-9004-0676</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0920-8542 |
ispartof | The Journal of supercomputing, 2021, Vol.77 (10), p.11786-11806 |
issn | 0920-8542 1573-0484 |
language | eng |
recordid | cdi_proquest_journals_2570438455 |
source | SpringerLink Journals - AutoHoldings |
subjects | Collaboration Community Compilers Computer Science Filtration Interpreters Processor Architectures Programming Languages Recommender systems Social networks |
title | Social collaborative filtering using local dynamic overlapping community detection |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T07%3A56%3A11IST&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=Social%20collaborative%20filtering%20using%20local%20dynamic%20overlapping%20community%20detection&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Jalali,%20Shiva&rft.date=2021&rft.volume=77&rft.issue=10&rft.spage=11786&rft.epage=11806&rft.pages=11786-11806&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-021-03734-3&rft_dat=%3Cproquest_cross%3E2570438455%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=2570438455&rft_id=info:pmid/&rfr_iscdi=true |