On merging two trust-networks in one with bipolar preferences. (1st June 2015)

• Record Type: Journal Article
• Authors: BISTARELLI, STEFANO; SANTINI, FRANCESCO
• Is Part Of: Mathematical structures in computer science. Volume 27:Number 2(2017)
• Page Start: 215
• Page End: 233
• Publication Date: 2015-06-01
• Subjects: Computer science -- Mathematics -- Periodicals; 004.015105
• DOI: 10.1017/S0960129515000092
• Languages: English
• ISSNs: 0960-1295

Abstract

Abstract : In this paper, we study weighted trust-networks (but also unweighted), where each edge is associated with either a positive or a negative score. Hence, we consider a distrust relationship as well, allowing a user to rate poor experiences with other individuals in his web of acquaintances. We propose an algorithm to compose two of such networks in a single one, in order to merge the knowledge obtained in two different communities of individuals (possibly partially-overlapping), through two different trust management-systems. Our algorithm is based on semiring algebraic-structures, in order to have a parametric computational-framework. Such composition can be adopted whenever two trust-based communities (with the same scope) need to be amalgamated: for instance, two competitor-companies that need to unify the trust-based knowledge on their (sub-) suppliers.