• Title/Summary/Keyword: trust prediction

Search Result 45, Processing Time 0.025 seconds

Prediction Method for the Implicit Interpersonal Trust Between Facebook Users (페이스북 사용자간 내재된 신뢰수준 예측 방법)

  • Song, Hee Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.2
    • /
    • pp.177-191
    • /
    • 2013
  • Social network has been expected to increase the value of social capital through online user interactions which remove geographical boundary. However, online users in social networks face challenges of assessing whether the anonymous user and his/her providing information are reliable or not because of limited experiences with a small number of users. Therefore. it is vital to provide a successful trust model which builds and maintains a web of trust. This study aims to propose a prediction method for the interpersonal trust which measures the level of trust about information provider in Facebook. To develop the prediction method. we first investigated behavioral research for trust in social science and extracted 5 antecedents of trust : lenience, ability, steadiness, intimacy, and similarity. Then we measured the antecedents from the history of interactive behavior and built prediction models using the two decision trees and a computational model. We also applied the proposed method to predict interpersonal trust between Facebook users and evaluated the prediction accuracy. The predicted trust metric has dynamic feature which can be adjusted over time according to the interaction between two users.

A Study on Transitivity and Composability of Trust in Social Network (소셜네트워크에서 신뢰의 전이성과 결합성에 관한 연구)

  • Song, Hee-Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.18 no.4
    • /
    • pp.41-53
    • /
    • 2011
  • Trust prediction between users in social network based on the trust propagation assumes properties of transitivity and composability of trust propagation. But it has been hard to find studies which test on how those properties have been operated in real social network. This study aims to validate if the longer the distance of trust paths and the less the numbers of trust paths, the higher prediction error occurs using two real social network data set. As a result, the longer the distance of trust paths, we can find higher prediction error when predicting level of trust between source and target users. But we can not find decreasing trend of prediction error though the possible number of trust paths between source and target users increases.

Is Trust Transitive and Composable in Social Networks?

  • Song, Hee Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.4
    • /
    • pp.191-205
    • /
    • 2013
  • Recently, the topic of predicting interpersonal trust in online social networks is receiving considerable attention, because trust plays a critical role in controlling the spread of distorted information and vicious rumors, as well as reducing uncertainties and risk from unreliable users in social networks. Several trust prediction models have been developed on the basis of transitivity and composability properties of trust; however, it is hard to find empirical studies on whether and how transitivity and composability properties of trust are operated in real online social networks. This study aims to predict interpersonal trust between two unknown users in social networks and verify the proposition on whether and how transitivity and composability of trust are operated in social networks. For this purpose, we chose three social network sites called FilmTrust, Advogato, and Epinion, which contain explicit trust information by their users, and we empirically investigated the proposition. Experimental results showed that trust can be propagated farther and farther along the trust link; however, when path distance becomes distant, the accuracy of trust prediction lowers because noise is activated in the process of trust propagation. Also, the composability property of trust is operated as we expected in real social networks. However, contrary to our expectations, when the path is synthesized more during the trust prediction, the reliability of predicted trust did not tend to increase gradually.

Trustworthy Service Selection using QoS Prediction in SOA-based IoT Environments (SOA기반 IoT환경에서 QoS 예측을 통한 신뢰할 수 있는 서비스 선택)

  • Kim, Yukyong
    • Journal of Software Assessment and Valuation
    • /
    • v.15 no.1
    • /
    • pp.123-131
    • /
    • 2019
  • The Internet of Things (IoT) environment must be able to meet the needs of users by providing access to various services that can be used to develop diverse user applications. However, QoS issues arise due to the characteristics of the IoT environment, such as numerous heterogeneous devices and potential resource constraints. In this paper, we propose a QoS prediction method that reflects trust between users in SOA based IoT. In order to increase the accuracy of QoS prediction, we analyze the trust and distrust relations between users and identify similarities among users and predict QoS based on them. The centrality is calculated to enhance trust relationships. Experimental results show that QoS prediction can be improved.

Design and Analysis a Robust Recommender System Exploiting the Effect of Social Trust Clusters (소셜 트러스트 클러스터 효과를 이용한 견고한 추천 시스템 설계 및 분석)

  • Noh, Giseop;Oh, Hayoung;Lee, Jaehoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.1
    • /
    • pp.241-248
    • /
    • 2018
  • A Recommender System (RS) is a system that provides optimized information to users in an over-supply situation. The key to RS is to accurately predict the behavior of the user. The Matrix Factorization (MF) method was used for this prediction in the early stage, and according to the recent SNS development, social information is additionally utilized to improve prediction accuracy. In this paper, we use RS internal trust cluster, which was overlooked in previous studies, to further improve performance and analyze the characteristics of trust clusters.

Machine Learning Methods for Trust-based Selection of Web Services

  • Hasnain, Muhammad;Ghani, Imran;Pasha, Muhammad F.;Jeong, Seung R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.38-59
    • /
    • 2022
  • Web services instances can be classified into two categories, namely trusted and untrusted from users. A web service with high throughput (TP) and low response time (RT) instance values is a trusted web service. Web services are not trustworthy due to the mismatch in the guaranteed instance values and the actual values achieved by users. To perform web services selection from users' attained TP and RT values, we need to verify the correct prediction of trusted and untrusted instances from invoked web services. This accurate prediction of web services instances is used to perform the selection of web services. We propose to construct fuzzy rules to label web services instances correctly. This paper presents web services selection using a well-known machine learning algorithm, namely REPTree, for the correct prediction of trusted and untrusted instances. Performance comparison of REPTree with five machine learning models is conducted on web services datasets. We have performed experiments on web services datasets using a ten k-fold cross-validation method. To evaluate the performance of the REPTree classifier, we used accuracy metrics (Sensitivity and Specificity). Experimental results showed that web service (WS1) gained top selection score with the (47.0588%) trusted instances, and web service (WS2) was selected the least with (25.00%) trusted instances. Evaluation results of the proposed web services selection approach were found as (asymptotic sig. = 0.019), demonstrating the relationship between final selection and recommended trust score of web services.

A Fuzzy-based Inference Model for Web of Trust Using User Behavior Information in Social Network (사회네트워크에서 사용자 행위정보를 활용한 퍼지 기반의 신뢰관계망 추론 모형)

  • Song, Hee-Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.17 no.4
    • /
    • pp.39-56
    • /
    • 2010
  • We are sometimes interacting with people who we know nothing and facing with the difficult task of making decisions involving risk in social network. To reduce risk, the topic of building Web of trust is receiving considerable attention in social network. The easiest approach to build Web of trust will be to ask users to represent level of trust explicitly toward another users. However, there exists sparsity issue in Web of trust which is represented explicitly by users as well as it is difficult to urge users to express their level of trustworthiness. We propose a fuzzy-based inference model for Web of trust using user behavior information in social network. According to the experiment result which is applied in Epinions.com, the proposed model show improved connectivity in resulting Web of trust as well as reduced prediction error of trustworthiness compared to existing computational model.

  • PDF

사회네트워크에서 잠재된 신뢰관계망 추론을 위한 ANFIS 모형

  • Song, Hui-Seok
    • Proceedings of the Korea Database Society Conference
    • /
    • 2010.06a
    • /
    • pp.277-287
    • /
    • 2010
  • We are sometimes interacting with people who we know nothing and facing with the difficult task of making decisions involving risk in social network. To reduce risk, the topic of building Web of trust is receiving considerable attention in social network. The easiest approach to build Web of trust will be to ask users to represent level of trust explicitly toward another users. However, there exists sparsity issue in Web of trust which is represented explicitly by users as well as it is difficult to urge users to express their level of trustworthiness. We propose a fuzzy-based inference model for Web of trust using user behavior information in social network. According to the experiment result which is applied in Epinions.com, the proposed model show improved connectivity in resulting Web of trust as well as reduced prediction error of trustworthiness compared to existing computational model.

  • PDF

Determining Absolute Interpolation Weights for Neighborhood-Based Collaborative Filtering

  • Kim, Hyoung-Do
    • Management Science and Financial Engineering
    • /
    • v.16 no.2
    • /
    • pp.53-65
    • /
    • 2010
  • Despite the overall success of neighbor-based CF methods, there are some fundamental questions about neighbor selection and prediction mechanism including arbitrary similarity, over-fitting interpolation weights, no trust consideration between neighbours, etc. This paper proposes a simple method to compute absolute interpolation weights based on similarity values. In order to supplement the method, two schemes are additionally devised for high-quality neighbour selection and trust metrics based on co-ratings. The former requires that one or more neighbour's similarity should be better than a pre-specified level which is higher than the minimum level. The latter gives higher trust to neighbours that have more co-ratings. Experimental results show that the proposed method outperforms the pure IBCF by about 8% improvement. Furthermore, it can be easily combined with other predictors for achieving better prediction quality.

A Study on the Recommendation Algorithm based on Trust/Distrust Relationship Network Analysis (사용자 간 신뢰·불신 관계 네트워크 분석 기반 추천 알고리즘에 관한 연구)

  • Noh, Heeryong;Ahn, Hyunchul
    • Journal of Information Technology Applications and Management
    • /
    • v.24 no.1
    • /
    • pp.169-185
    • /
    • 2017
  • This study proposes a novel recommendation algorithm that reflects the results from trust/distrust network analysis as a solution to enhance prediction accuracy of recommender systems. The recommendation algorithm of our study is based on memory-based collaborative filtering (CF), which is the most popular recommendation algorithm. But, unlike conventional CF, our proposed algorithm considers not only the correlation of the rating patterns between users, but also the results from trust/distrust relationship network analysis (e.g. who are the most trusted/distrusted users?, whom are the target user trust or distrust?) when calculating the similarity between users. To validate the performance of the proposed algorithm, we applied it to a real-world dataset that contained the trust/distrust relationships among users as well as their numeric ratings on movies. As a result, we found that the proposed algorithm outperformed the conventional CF with statistical significance. Also, we found that distrust relationship was more important than trust relationship in measuring similarities between users. This implies that we need to be more careful about negative relationship rather than positive one when tracking and managing social relationships among users.