Outline

  • Abstract
  • Highlights
  • Keywords
  • 1. Introduction
  • 1.1. Application Scenario and Our Motivation
  • 1.2. the Concept of Trust
  • 1.3. Our Contribution
  • 2. Related Work
  • 2.1. Local and Global Trust
  • 2.2. Transitivity of Trust
  • 2.3. Information for Trust in Online Social Networks
  • 3. Overview of Swtrust
  • 3.1. Terms and Problem Definition
  • 3.2. Architecture
  • 3.3. Malicious Behavior
  • 4. Psn: Preprocessing a Online Social Network
  • 4.1. Preparation
  • 4.2. the Psn Process
  • 5. Btn: Building the Trust Network
  • 5.1. Centralized Breadth-First Search: Cbfs
  • 5.2. Distributed Breadth-First Search: Dbfs
  • 5.3. Defining Trust Between Directly Connected Nodes
  • 5.3.1. Referral Trust
  • 5.3.2. Functional Trust
  • 6. Gtg: Generating the Trusted Graph
  • 6.1. Cgtg: Centralized Gtg
  • 6.2. Trust Conflict of Trustee
  • 7. Experiments
  • 7.1. Experimental Design
  • 7.1.1. Data Set and Preprocess
  • 7.2. Evaluating the Efficiency of Generating a Trusted Graph
  • 7.2.1. the Connection Coverage
  • 7.2.2. the Proportion of Local Neighbors, Longer Contacts, and Longest Contacts
  • 7.3. Evaluating the Quality of the Trusted Graph
  • 7.3.1. Test the Influence Factors
  • 7.3.2. Test the Robustness
  • 7.3.3. Comparative Study
  • 7.4. Summary of Experiments
  • 8. Conclusion and Future Work
  • Acknowledgments
  • References

رئوس مطالب

  • چکیده
  • کلیدواژه ها
  • 1. مقدمه
  • 1.1. سناریوی کاربرد و هدف ما
  • 2.1. مفهوم اعتماد
  • 1.3. راهکار ما
  • 2. کارهای مرتبط
  • 1.2. اعتماد جهانی و محلی
  • 2.2. تعدی اعتماد
  • 3.2. اطلاعات برای قابلیت اعتماد در شبکه های اجتماعی آنلاین
  • 3. مروری بر SWTrust
  • 3.1 اصطلاحات و تعریف مسئله
  • 2.3. معماری
  • 3.3. رفتار بد
  • 4. PSN: پیش پردازش شبکه اجتماعی آنلاین
  • 4.1 آماده سازی
  • 4.2 فرایند PSN
  • 5. BIN: ساخت شبکه اعتماد
  • 5.1 جستجوی اول عمق متمرکز: CBFS
  • 5.2 جستجوی اول عمق توزیع شده: DBFS
  • 5.3 تعریف اعتماد بین گره هایی با اتصال مستقیم
  • 5.3.1 اعتماد ارجاعی
  • 5.3.2 اعتماد اجرایی
  • 6. GTG: تولید گراف قابل اعتماد
  • 6.1 CGTC: GTC متمرکز
  • 6.2 ناسازگاری اعتماد اعتماد دهنده
  • 7. آزمایش ها
  • 7.1 طراحی آزمایش
  • 7.1.1 مجموعه داده و پیش پردازش
  • 7.2 ارزیابی کارایی تولید گراف قابل اعتماد
  • 7.2.1 پوشش اتصال
  • 7.2.2 نسبت همسایه های محلی، تماس های طولانی تر و طولانی ترین تماس ها
  • 7.3 ارزیابی کیفیت گراف قابل اعتماد
  • 7.3.1 تست فاکتورهای تاثیر
  • 7.3.2 تست قدرت
  • 7.3.3 مطالعه قیاسی
  • 7.4 خلاصه آزمایش ها
  • 8. نتیجه گیری و کار آتی

Abstract

We propose a novel trust framework to address the issue of “Can Alice trust Bob on a service?” in large online social networks (OSNs). Many models have been proposed for constructing and calculating trust. However, two common shortcomings make them less practical, especially in large OSNs: the information used to construct trust is (1) usually too complicated to get or maintain, that is, it is resource consuming; and (2) usually subjective and changeable, which makes it vulnerable to vicious nodes. With those problems in mind, we focus on generating small trusted graphs for large OSNs, which can be used to make previous trust evaluation algorithms more efficient and practical. We show how to preprocess a social network (PSN) by developing a simple and practical user-domain-based trusted acquaintance chain discovery algorithm through using the small-world network characteristics of online social networks and taking advantage of “weak ties”. Then, we present how to build a trust network (BTN) and generate a trusted graph (GTG) with the adjustable width breadth-first search algorithms. To validate the effectiveness of our work and to evaluate the quality of the generated trusted graph, we conduct many experiments with the real data set from Epinions.com. Our work is the first that focuses on generating small trusted graphs for large online social networks, and we explore the stable and objective information (such as domain) for inferring trust

Keywords: - - - -

8. Conclusion and future work

In this paper, we propose the SWTrust framework to discover short trusted paths based on trusted acquaintance chains, and we generate trusted graphs for online social networks. Previous trust evaluation algorithms can become more efficient and practical if they apply SWTrust to generate trusted graphs. We focus on generating trusted graphs and explore stable and objective information in order to select capable neighbors in each step of the breadth-first search. Experiments with a data set from a real online social network validate the effectiveness of our work. Exploring stable and objective information (such as domain) for different kinds of online social networks, as well as designing a new integrated and comprehensive model for predicting trust, are our main future work.

دانلود ترجمه تخصصی این مقاله دانلود رایگان فایل pdf انگلیسی