Sparse Trust Data Mining

Pengli Nie

doi:10.1109/TIFS.2021.3109412

Sparse Trust Data Mining

2021-01-01

1

OA

AI

DOI：10.1109/TIFS.2021.3109412

Original

Original request for help

Save

Abstract

En 中文

As recommendation systems continue to evolve, researchers are using trust data to improve the accuracy of recommendation prediction and help users find relevant information. However, large recommendation systems with trust data suffer from the sparse trust problem, which leads to grade inflation and severely affects the reliability of trust propagation. This paper presents a novel research on sparse trust data mining, which includes the new concept of sparse trust, a sparse trust model, and a trust mining framework. It lays a foundation for the trust-related research in large recommended systems. The new trust mining framework is based on customized normalization functions and a novel transitive gossip trust model, which discovers potential trust information between entities in a large-scale user network and applies it to a recommendation system. We conducts a comprehensive performance evaluation on both real-world and synthetic datasets. The results confirm that our framework mines new trust and effectively ameliorates sparse trust problem.

Keywords:

Data mining

Sparse matrices

Data models

Computational modeling

Collaboration

Big Data

Recommender systems

Anti-sparsification

recommendation system

sparse trust

trust model

Sparse Trust Data Mining

Abstract

Journal

Organization