paper-with-me

Papers

A Matrix Factorization Model for Hellinger-based Trust Management in Social Internet of Things

2019-09-26 · Soroush Aalibagi, Hamidreza Mahyar, Ali Movaghar, H. Eugene Stanley

The Social Internet of Things (SIoT), integration of the Internet of Things and Social Networks paradigms, has been introduced to build a network of smart nodes that are capable of establishing social links. In order to deal with misbehaving service provider nodes, service requestor nodes must evaluate their trustworthiness levels. In this paper, we propose a novel trust management mechanism in the SIoT to predict the most reliable service providers for each service requestor, which leads to reduce the risk of being exposed to malicious nodes. We model the SIoT with a flexible bipartite graph (containing two sets of nodes: service providers and service requestors), then build a social network among the service requestor nodes, using the Hellinger distance. Afterward, we develop a social trust model using nodes' centrality and similarity measures to extract trust behaviors among the social network nodes. Finally, a matrix factorization technique is designed to extract latent features of SIoT nodes, find trustworthy nodes, and mitigate the data sparsity and cold start problems. We analyze the effect of parameters in the proposed trust prediction mechanism on prediction accuracy. The results indicate that feedbacks from the neighboring nodes of a specific service requestor with high Hellinger similarity in our mechanism outperforms the best existing methods. We also show that utilizing the social trust model, which only considers a similarity measure, significantly improves the accuracy of the prediction mechanism. Furthermore, we evaluate the effectiveness of the proposed trust management system through a real-world SIoT use case. Our results demonstrate that the proposed mechanism is resilient to different types of network attacks, and it can accurately find the most proper and trustworthy service provider.

📄 PDF Abstract BibTeX arXiv:1909.12432

Code (0)

등록된 구현이 없습니다.

Tasks

Management

Similar Papers 제목 키워드 기반

Extracting Implicit Social Relation for Social Recommendation Techniques in User Rating Prediction

2016-12-05 · Seyed Mohammad Taheri, Hamidreza Mahyar, Mohammad Firouzi, Elahe Ghalebi K. 외

Recommendation plays an increasingly important role in our daily lives. Recommender systems automatically suggest items to users that might be interesting for them. Recent studies illustrate that incorporating social tru…

Recommendation SystemsRelationRelation Extraction

SPMF: A Social Trust and Preference Segmentation-based Matrix Factorization Recommendation Algorithm

2019-03-11 · Wei Peng, Baogui Xin

The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be lim…

Marketing

Matrix Factorization with Explicit Trust and Distrust Relationships

2014-08-02 · Rana Forsati, Mehrdad Mahdavi, Mehrnoush Shamsfard, Mohamed Sarwat

With the advent of online social networks, recommender systems have became crucial for the success of many online applications/services due to their significance role in tailoring these applications to user-specific need…

Recommendation Systems

Dynamic matrix factorization with social influence

2016-04-21 · Aleksandr Y. Aravkin, Kush R. Varshney, Liu Yang

Matrix factorization is a key component of collaborative filtering-based recommendation systems because it allows us to complete sparse user-by-item ratings matrices under a low-rank assumption that encodes the belief th…

Collaborative FilteringRecommendation Systems

Decentralized Matrix Factorization with Heterogeneous Differential Privacy

2022-12-01 · Wentao Hu, Hui Fang

Conventional matrix factorization relies on centralized collection of users' data for recommendation, which might introduce an increased risk of privacy leakage especially when the recommender is untrusted. Existing diff…