کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6861836 1439258 2018 22 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Trust propagation algorithm based on learning automata for inferring local trust in online social networks
ترجمه فارسی عنوان
الگوریتم ترویج اعتماد بر مبنای اتوماتای ​​یادگیری برای به دست آوردن اعتماد محلی در شبکه های اجتماعی آنلاین
کلمات کلیدی
اعتماد، ترویج اعتماد، تجمع اعتماد، اتوماتای ​​یادگیری، شبکه های اجتماعی،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
Online social networks have provided an appropriate infrastructure for users to interact with one another and share information. Since trust is one of the most important factors in forming social interactions, it is necessary in these networks to evaluate trust from one user to another indirectly connected user, using propagating trust along reliable trust paths between the two users. The quality of trust inference based on trust propagation is affected by the length of trust paths and also different aggregation strategies for combining trust values derived from multiple paths. While evaluating trust value based on all paths provides more accurate trust inference results, it is very time consuming to be acceptable in large social networks. Therefore, discovering reliable trust paths is always challenging in these networks. Another important challenge is how to aggregate trust values of multiple paths. In this paper, we first propose a new aggregation strategy on the basis of the standard collaborative filtering. We then present a heuristic algorithm based on learning automata, called DLATrust, for discovering reliable paths between two users and inferring the value of trust using the proposed aggregation strategy. The experimental results conducted on the online social network dataset of Advogato demonstrate that DLATrust can efficiently identify reliable trust paths and predict trust with a high accuracy.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Knowledge-Based Systems - Volume 143, 1 March 2018, Pages 307-316
نویسندگان
, ,