BILATTICE-BASED AGGREGATION OPERATORS FOR GRADUAL TRUST AND DISTRUST

@inproceedings{Victor2010BILATTICEBASEDAO,
  title={BILATTICE-BASED AGGREGATION OPERATORS FOR GRADUAL TRUST AND DISTRUST},
  author={Patricia Victor and Chris Cornelis and Martine De Cock and Enrique Enrique Herrera-Viedma},
  year={2010}
}
Trust and distrust are two increasingly important metrics in social networks. Since many of these networks are very large, it is only natural that not all users know each other. To this aim, propagation and aggregation operators are often used to estimate (dis)trust relations for users that are not directly connected through the network. In this paper, we introduce bilattice-based aggregation approaches and show that they can be used to accurately predict trust and distrust predictions for the… 
8 Citations

Figures from this paper

Enhancing the trust-based recommendation process with explicit distrust
TLDR
A distrust-enhanced recommendation algorithm which has its roots in Golbeck's trust-based weighted mean is introduced, and it is shown that this new algorithm outperforms its standard trust-only counterpart with respect to accuracy, thereby demonstrating the positive effect that explicit distrust can have on trust- based recommendations.
Propagating and Aggregating Trust with Uncertainty Measure
TLDR
This paper presents an operator that performs both propagation and aggregation of trust, modeled on the basis of IFS theory (Atanassov's intuitionistic fuzzy set theory) with particular emphasis on uncertainty, and the operator is based on relative scalar cardinality of I FS.
Uncertainty-Preserving Trust Prediction in Social Networks
  • A. Stachowiak
  • Computer Science
    Social Networks: A Framework of Computational Intelligence
  • 2014
TLDR
A new, uncertainty-preserving trust prediction operator based on group opinion and on relative scalar cardinality of incompletely known fuzzy sets is introduced that ensures the monotonicity of uncertainty.
Incorporating Fuzzy Trust in Collaborative Filtering Based Recommender Systems
TLDR
This work proposes a fuzzy trust propagation scheme to alleviate the sparsity problem of RSs, and discusses the basic trust concepts such as fuzzy trust modeling, propagation and aggregation operators.
Hospitality Exchange Services as a Source of Spatial and Social Data?
TLDR
An extensive data-based analysis of the non-profit democratic hospitality exchange service bewelcome.org is presented with the goal of determining the factors influencing its growth and provides general insights on internet-based hospitality exchange services.
Economics of Internet-Based Hospitality Exchange
  • Rustam Tagiew
  • Economics
    2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
  • 2015
In this paper, we analyze and compare general development and individual behavior on two non-profit internet-based hospitality exchange services -- bewelcome.org and warmshowers.org. We measure the
Bewelcome.org - a non-profit democratic hospex service set up for growth
TLDR
An extensive data-based analysis of the non-profit democratic hospitality exchange service bewelcome.org is presented with the goal of determining the factors influencing its growth and provides general insights on internet-based hospitality exchange services.
Resolving Inherent Node Misbehaving of Node Cooperation Enhancement Scheme
TLDR
This paper aims to provide a history of the publication of this work and some of the key events leading to its creation and publication in the form of a 60-page document.

References

SHOWING 1-4 OF 4 REFERENCES
Propagation of trust and distrust
TLDR
It is shown that a small number of expressed trusts/distrust per individual allows us to predict trust between any two people in the system with high accuracy.
Trust propagation—cardinality-based approach
  • A. Stachowiak
  • Computer Science
    2009 International Multiconference on Computer Science and Information Technology
  • 2009
TLDR
A trust model based on IFS theory (Atanassov's intuitionistic fuzzy set theory) is focused on and a draft of a method of calculating trust propagation with a use of a relative cardinality of IFS is presented.
Multivalued logics: a uniform approach to reasoning in artificial intelligence
This paper describes a uniform formalization of much of the current work in artificial intelligence on inference systems. We show that many of these systems, including first‐order theorem provers,