z-logo
open-access-imgOpen Access
A Fast-Effective Algorithm on A Concise Representation of Top Rated Utility Mining Datasets
Author(s) -
Shaik Subani,
B. Suresh
Publication year - 2020
Publication title -
international journal of scientific research in science engineering and technology
Language(s) - English
Resource type - Journals
eISSN - 2395-1990
pISSN - 2394-4099
DOI - 10.32628/ijsrset207446
Subject(s) - reputation , computer science , trustworthiness , representation (politics) , key (lock) , purchasing , product (mathematics) , machine learning , computer security , marketing , mathematics , business , social science , geometry , sociology , politics , political science , law
The average of customer ratings on a product, which we call a reputation, is one of the key factors in online purchasing decisions. There is, however, no guarantee of the trustworthiness of a reputation since it can be manipulated rather easily. In this paper, we define false reputation as the problem of a reputation being manipulated by unfair ratings and design a general framework that provides trustworthy reputations. For this purpose, we propose Trust-reputation, an algorithm that iteratively adjusts a reputation based on the confidence of customer ratings. We also show the effectiveness of Trust-reputation through extensive experiments in comparisons to state-of-the-art approaches.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom