A novel trust recommendation model for mobile social network based on user motivation
Traditional collaborative filtering recommendation algorithm has the problems of sparse data and limited user preference information. To deal with data sparseness problem and the unreliability phenomenon on the traditional social network recommendation. This paper presents a novel algorithm based on...
Gespeichert in:
Veröffentlicht in: | Electronic commerce research 2021-09, Vol.21 (3), p.809-830 |
---|---|
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 | 830 |
---|---|
container_issue | 3 |
container_start_page | 809 |
container_title | Electronic commerce research |
container_volume | 21 |
creator | Yang, Gelan Yang, Qin Jin, Huixia |
description | Traditional collaborative filtering recommendation algorithm has the problems of sparse data and limited user preference information. To deal with data sparseness problem and the unreliability phenomenon on the traditional social network recommendation. This paper presents a novel algorithm based on trust relationship reconstruction and social network delivery. This paper introduces the method of eliminating falsehood and storing truth to avoid the unreliable phenomenon and improves the accuracy of falsehood according to the user similarity formula based on the scale of contact established by users. In this paper, the problem of attack caused by the misbehaving nodes is investigated when the recommended information is disseminated in the existing trust model. In addition, a recommendation-based trust model is proposed that includes a defensive plan. This scheme employs the clustering techniques on the basis of interaction count, information Compatibility and node intimacy, in a certain period of time dynamically filter dishonest recommendation related attacks. The model has been verified in different portable and detached topologies. The network knots undergo modifications regarding their neighbors as well as frequent routes. The experimental analysis indicates correctness and robustness of the reliance system in an active MANET setting. Compared with the most advanced recommender system, the proposed recommendation algorithm in accuracy and coverage measurements show a significant improvement. |
doi_str_mv | 10.1007/s10660-019-09344-9 |
format | Article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2588784916</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A718377660</galeid><sourcerecordid>A718377660</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-b41aa3c58894363c041da41126243db005c621daf1d970606858c29a3264d4c93</originalsourceid><addsrcrecordid>eNp9kUtLxDAUhYsoqKN_wFXAdfXm0TyWw-ALBtzoOmTSVKptoklnxH_vHSu4kyxyyf3OyeWeqrqgcEUB1HWhICXUQE0NhgtRm4PqhDaK1YZLdog116ZuVMOPq9NSXgEYKCZOqucliWkXBjLlbZlIDj6NY4itm_oUyZhabHUpY7Xph0BK8r0bSAzTZ8pvZONKaAmC2xL2zNTvfoRn1VHnhhLOf-9F9Xx787S6r9ePdw-r5br2QvCp3gjqHPeN1kZwyT0I2jpBKZNM8HYD0HjJ8KmjrVEgQepGe2YcZ1K0whu-qC5n3_ecPrahTPY1bXPELy1DV6WFofJfilFQhmtOkbqaqRc3BNvHLk3ZeTxtGHufYuhwAXapqOZK4bJRwGaBz6mUHDr7nvvR5S9Lwe5TsXMqFlOxP6nY_cRkFuGiY1_-JErjLILyBhE-IwWb8SXkv3H_Mf4GxCqX2A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2210793831</pqid></control><display><type>article</type><title>A novel trust recommendation model for mobile social network based on user motivation</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Yang, Gelan ; Yang, Qin ; Jin, Huixia</creator><creatorcontrib>Yang, Gelan ; Yang, Qin ; Jin, Huixia</creatorcontrib><description>Traditional collaborative filtering recommendation algorithm has the problems of sparse data and limited user preference information. To deal with data sparseness problem and the unreliability phenomenon on the traditional social network recommendation. This paper presents a novel algorithm based on trust relationship reconstruction and social network delivery. This paper introduces the method of eliminating falsehood and storing truth to avoid the unreliable phenomenon and improves the accuracy of falsehood according to the user similarity formula based on the scale of contact established by users. In this paper, the problem of attack caused by the misbehaving nodes is investigated when the recommended information is disseminated in the existing trust model. In addition, a recommendation-based trust model is proposed that includes a defensive plan. This scheme employs the clustering techniques on the basis of interaction count, information Compatibility and node intimacy, in a certain period of time dynamically filter dishonest recommendation related attacks. The model has been verified in different portable and detached topologies. The network knots undergo modifications regarding their neighbors as well as frequent routes. The experimental analysis indicates correctness and robustness of the reliance system in an active MANET setting. Compared with the most advanced recommender system, the proposed recommendation algorithm in accuracy and coverage measurements show a significant improvement.</description><identifier>ISSN: 1389-5753</identifier><identifier>EISSN: 1572-9362</identifier><identifier>DOI: 10.1007/s10660-019-09344-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Accuracy ; Algorithms ; Analysis ; Business and Management ; Clustering ; Computer Communication Networks ; Data Structures and Information Theory ; e-Commerce/e-business ; IT in Business ; Knots ; Motivation ; Operations Research/Decision Theory ; Recommender systems ; Social networks ; Topology ; Trustworthiness ; Wireless networks</subject><ispartof>Electronic commerce research, 2021-09, Vol.21 (3), p.809-830</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019</rights><rights>COPYRIGHT 2021 Springer</rights><rights>Electronic Commerce Research is a copyright of Springer, (2019). All Rights Reserved.</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-b41aa3c58894363c041da41126243db005c621daf1d970606858c29a3264d4c93</citedby><cites>FETCH-LOGICAL-c443t-b41aa3c58894363c041da41126243db005c621daf1d970606858c29a3264d4c93</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/s10660-019-09344-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10660-019-09344-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Yang, Gelan</creatorcontrib><creatorcontrib>Yang, Qin</creatorcontrib><creatorcontrib>Jin, Huixia</creatorcontrib><title>A novel trust recommendation model for mobile social network based on user motivation</title><title>Electronic commerce research</title><addtitle>Electron Commer Res</addtitle><description>Traditional collaborative filtering recommendation algorithm has the problems of sparse data and limited user preference information. To deal with data sparseness problem and the unreliability phenomenon on the traditional social network recommendation. This paper presents a novel algorithm based on trust relationship reconstruction and social network delivery. This paper introduces the method of eliminating falsehood and storing truth to avoid the unreliable phenomenon and improves the accuracy of falsehood according to the user similarity formula based on the scale of contact established by users. In this paper, the problem of attack caused by the misbehaving nodes is investigated when the recommended information is disseminated in the existing trust model. In addition, a recommendation-based trust model is proposed that includes a defensive plan. This scheme employs the clustering techniques on the basis of interaction count, information Compatibility and node intimacy, in a certain period of time dynamically filter dishonest recommendation related attacks. The model has been verified in different portable and detached topologies. The network knots undergo modifications regarding their neighbors as well as frequent routes. The experimental analysis indicates correctness and robustness of the reliance system in an active MANET setting. Compared with the most advanced recommender system, the proposed recommendation algorithm in accuracy and coverage measurements show a significant improvement.</description><subject>Accuracy</subject><subject>Algorithms</subject><subject>Analysis</subject><subject>Business and Management</subject><subject>Clustering</subject><subject>Computer Communication Networks</subject><subject>Data Structures and Information Theory</subject><subject>e-Commerce/e-business</subject><subject>IT in Business</subject><subject>Knots</subject><subject>Motivation</subject><subject>Operations Research/Decision Theory</subject><subject>Recommender systems</subject><subject>Social networks</subject><subject>Topology</subject><subject>Trustworthiness</subject><subject>Wireless networks</subject><issn>1389-5753</issn><issn>1572-9362</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kUtLxDAUhYsoqKN_wFXAdfXm0TyWw-ALBtzoOmTSVKptoklnxH_vHSu4kyxyyf3OyeWeqrqgcEUB1HWhICXUQE0NhgtRm4PqhDaK1YZLdog116ZuVMOPq9NSXgEYKCZOqucliWkXBjLlbZlIDj6NY4itm_oUyZhabHUpY7Xph0BK8r0bSAzTZ8pvZONKaAmC2xL2zNTvfoRn1VHnhhLOf-9F9Xx787S6r9ePdw-r5br2QvCp3gjqHPeN1kZwyT0I2jpBKZNM8HYD0HjJ8KmjrVEgQepGe2YcZ1K0whu-qC5n3_ecPrahTPY1bXPELy1DV6WFofJfilFQhmtOkbqaqRc3BNvHLk3ZeTxtGHufYuhwAXapqOZK4bJRwGaBz6mUHDr7nvvR5S9Lwe5TsXMqFlOxP6nY_cRkFuGiY1_-JErjLILyBhE-IwWb8SXkv3H_Mf4GxCqX2A</recordid><startdate>20210901</startdate><enddate>20210901</enddate><creator>Yang, Gelan</creator><creator>Yang, Qin</creator><creator>Jin, Huixia</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TA</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20210901</creationdate><title>A novel trust recommendation model for mobile social network based on user motivation</title><author>Yang, Gelan ; Yang, Qin ; Jin, Huixia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-b41aa3c58894363c041da41126243db005c621daf1d970606858c29a3264d4c93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Accuracy</topic><topic>Algorithms</topic><topic>Analysis</topic><topic>Business and Management</topic><topic>Clustering</topic><topic>Computer Communication Networks</topic><topic>Data Structures and Information Theory</topic><topic>e-Commerce/e-business</topic><topic>IT in Business</topic><topic>Knots</topic><topic>Motivation</topic><topic>Operations Research/Decision Theory</topic><topic>Recommender systems</topic><topic>Social networks</topic><topic>Topology</topic><topic>Trustworthiness</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Gelan</creatorcontrib><creatorcontrib>Yang, Qin</creatorcontrib><creatorcontrib>Jin, Huixia</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Materials Business File</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</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>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</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>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</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 Basic</collection><jtitle>Electronic commerce research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Gelan</au><au>Yang, Qin</au><au>Jin, Huixia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A novel trust recommendation model for mobile social network based on user motivation</atitle><jtitle>Electronic commerce research</jtitle><stitle>Electron Commer Res</stitle><date>2021-09-01</date><risdate>2021</risdate><volume>21</volume><issue>3</issue><spage>809</spage><epage>830</epage><pages>809-830</pages><issn>1389-5753</issn><eissn>1572-9362</eissn><abstract>Traditional collaborative filtering recommendation algorithm has the problems of sparse data and limited user preference information. To deal with data sparseness problem and the unreliability phenomenon on the traditional social network recommendation. This paper presents a novel algorithm based on trust relationship reconstruction and social network delivery. This paper introduces the method of eliminating falsehood and storing truth to avoid the unreliable phenomenon and improves the accuracy of falsehood according to the user similarity formula based on the scale of contact established by users. In this paper, the problem of attack caused by the misbehaving nodes is investigated when the recommended information is disseminated in the existing trust model. In addition, a recommendation-based trust model is proposed that includes a defensive plan. This scheme employs the clustering techniques on the basis of interaction count, information Compatibility and node intimacy, in a certain period of time dynamically filter dishonest recommendation related attacks. The model has been verified in different portable and detached topologies. The network knots undergo modifications regarding their neighbors as well as frequent routes. The experimental analysis indicates correctness and robustness of the reliance system in an active MANET setting. Compared with the most advanced recommender system, the proposed recommendation algorithm in accuracy and coverage measurements show a significant improvement.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10660-019-09344-9</doi><tpages>22</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-5753 |
ispartof | Electronic commerce research, 2021-09, Vol.21 (3), p.809-830 |
issn | 1389-5753 1572-9362 |
language | eng |
recordid | cdi_proquest_journals_2588784916 |
source | Business Source Complete; SpringerLink Journals - AutoHoldings |
subjects | Accuracy Algorithms Analysis Business and Management Clustering Computer Communication Networks Data Structures and Information Theory e-Commerce/e-business IT in Business Knots Motivation Operations Research/Decision Theory Recommender systems Social networks Topology Trustworthiness Wireless networks |
title | A novel trust recommendation model for mobile social network based on user motivation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T16%3A15%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20novel%20trust%20recommendation%20model%20for%20mobile%20social%20network%20based%20on%20user%20motivation&rft.jtitle=Electronic%20commerce%20research&rft.au=Yang,%20Gelan&rft.date=2021-09-01&rft.volume=21&rft.issue=3&rft.spage=809&rft.epage=830&rft.pages=809-830&rft.issn=1389-5753&rft.eissn=1572-9362&rft_id=info:doi/10.1007/s10660-019-09344-9&rft_dat=%3Cgale_proqu%3EA718377660%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2210793831&rft_id=info:pmid/&rft_galeid=A718377660&rfr_iscdi=true |