• 제목/요약/키워드: trust prediction

검색결과 45건 처리시간 0.015초

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

  • 송희석
    • Journal of Information Technology Applications and Management
    • /
    • 제20권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)

  • 송희석
    • Journal of Information Technology Applications and Management
    • /
    • 제18권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
    • /
    • 제20권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.

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

  • 김유경
    • 한국소프트웨어감정평가학회 논문지
    • /
    • 제15권1호
    • /
    • pp.123-131
    • /
    • 2019
  • IoT(Internet of Things) 환경은 다양한 사용자 애플리케이션을 만드는데 사용할 수 있는 여러 가지 서비스에 대한 액세스를 제공하여 사용자의 요구 사항을 충족시킬 수 있어야 한다. 그러나 수많은 이기종의 장치 및 잠재적인 자원 제약과 같은 IoT 환경적 특징으로 QoS 문제가 발생하게 된다. 본 논문에서는 SOA기반 IoT 시스템에서 사용자간 신뢰관계를 반영한 QoS 예측 방법을 제안한다. QoS예측의 정확도를 높이기 위해, 사용자간 신뢰 관계를 분석하여 사용자들 사이의 유사성을 파악하고 이를 기반으로 QoS를 예측하도록 한다. 연결중심성을 계산하여 신뢰를 강화하도록 하였으며, 실험을 통해 QoS 예측의 향상이 이루어지는 결과를 얻을 수 있었다.

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

  • 노기섭;오하영;이재훈
    • 정보보호학회논문지
    • /
    • 제28권1호
    • /
    • pp.241-248
    • /
    • 2018
  • 추천시스템(Recommender System, RS)는 정보 과잉 공급 상태에서 사용자들에게 최적화된 정보를 제공하는 시스템이다. RS의 핵심은 사용자의 행동 결과를 정확하게 예측하는 것이다. 이러한 예측을 위해 Matrix Factorization (MF) 방식이 초기에 사용되었으며, 최근 SNS의 발달에 따라 Social Information을 추가적으로 활용하여 예측 정확도를 높이고 있다. 본 논문에서는 기존 연구에서 간과 되었던 RS 내부 trust cluster를 이용하여 추가적으로 성능을 향상시키고, trust cluster의 특성에 대하여 분석한다. 기존 방법론 3가지와 비교한 결과 본 논문에서 제안하는 방식이 가장 높은 정확도를 보임을 확인하였다.

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)
    • /
    • 제16권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)

  • 송희석
    • Journal of Information Technology Applications and Management
    • /
    • 제17권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 모형

  • 송희석
    • 한국데이타베이스학회:학술대회논문집
    • /
    • 한국데이타베이스학회 2010년도 춘계국제학술대회
    • /
    • 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
    • /
    • 제16권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)

  • 노희룡;안현철
    • Journal of Information Technology Applications and Management
    • /
    • 제24권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.