• Title/Summary/Keyword: Trust degree information

Search Result 102, Processing Time 0.033 seconds

Imperfect Trust Degree based Throughput Maximization for Cooperative Communications (불완전한 신뢰도 기반 정보 처리율 최대화 협력통신 기법)

  • Ryu, Jong Yeol;Hong, Jun-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.5
    • /
    • pp.589-595
    • /
    • 2019
  • Recently, the mobile social networks, which consider both social relationship between users and mobile communication networks, have been received great attention. In this paper, we consider the trust degree of node as the social relationship for the cooperative communication networks. In contrast to the existing works that consider the case of the perfect trust degree information, for the case that transmitter has an imperfect trust degree information, we propose an imperfect trust degree based cooperative communication technique that maximizes a throughput. We first model the imperfect trust degree information as a probability distribution and derive the outage probability using the probability distribution. Then, we propose the transmission scheme that maximizes the throughput, which consider both outage probability and transmission rate. The simulation results show that the proposed cooperative transmission scheme outperforms the conventional scheme in terms of the throughput.

Trust Degree Information based Relay Selection in Cooperative Communication with Multiple Relays (다수의 릴레이가 존재하는 협력 통신 환경에서 신뢰도 정보 기반의 릴레이 선택 기법)

  • Ryu, Jong Yeol;Kim, Seong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.509-515
    • /
    • 2017
  • In this paper, for a cooperative communication system with multiple relays, we consider a relay selection method by exploiting the trust degree information of relay nodes. In the cooperative communication system, we interpret the trust degree of relays as the probability that relay helps the communication between the transmitter and receiver. We first provide an expected achievable rate at the receiver by taking into account the both cases that the relay helps the transmission of transmitter and the relay does not help the transmission of transmitter according to its trust degree. For given trust degree information, we propose an efficient relay selection method to maximize the expected achievable rate at the receiver. For the various configurations, the simulation results confirm that the proposed relay selection method outperforms the conventional relay selection method, which does not consider the trust degree of relay nodes.

A Novel Multi-link Integrated Factor Algorithm Considering Node Trust Degree for Blockchain-based Communication

  • Li, Jiao;Liang, Gongqian;Liu, Tianshi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3766-3788
    • /
    • 2017
  • A blockchain is an underlying technology and basic infrastructure of the Bitcoin system. At present, blockchains and their applications are developing rapidly. However, the basic research of blockchain technology is still in the early stages. The efficiency and reliability of blockchain communication is one of the research problems that urgently need to be studied and addressed. Existing algorithms may be less feasible for blockchain-based communication because they only consider a single communication factor (node communication capability or node trust degree) and only focus on a single communication performance parameter(communication time or communication reliability). In this paper, to shorten the validation time of blockchain transactions and improve the reliability of blockchain-based communication, we first establish a multi-link concurrent communication model based on trust degree, and then we propose a novel integrated factor communication tree algorithm (IFT). This algorithm comprehensively considers the node communication link number and the node trust degree and selects several nodes with powerful communication capacity and high trust as the communication sources to improve the concurrency and communication efficiency. Simulation results indicate that the IFT algorithm outperforms existing algorithms. A blockchain communication routing scheme based on the IFT algorithm can increase communication efficiency by ensuring communication reliability.

Development of The Korean Trust Index for Social Network Services (한국의 소셜네트워크서비스 신뢰지수 KTI 설계)

  • Kim, Yukyong;Jhee, Eun-Wha;Shin, Yongtae
    • Journal of Internet Computing and Services
    • /
    • v.15 no.6
    • /
    • pp.35-45
    • /
    • 2014
  • Due to the spread of unreliable online information on the social network services, the users are faced with a difficult problem for determining if the information is trustworthy or not. At present, the users should make a decision by themselves throughly for the trustworthiness of the information. Therefore, we need a way to systematically evaluate the trustworthiness of information on the social network services. In this paper, we design a trust index, called KTI (Korean Trust Index for SNS), as a criterion for measuring the trust degree of the information on the social network services. Using KTI, the users are readily able to determine whether the information is trustworthy. Consequently, we can estimate the social trust degree based on the variation of KTI. This paper derives the various factors affecting trust from the properties of the social network services, and proposes a model to evaluate the trustworthiness of information that is directly produced and distributed over the online network. Quantifying the trust degree of the information on the social network services allows the users to make efficient use of the social network.

How Much Impact do Social Media Make on Chasm and Buyer's Value? : The Information Accessibility and Trust Effect among Adopting Groups (소셜 미디어는 캐즘(Chasm)과 구매 가치에 얼마나 영향을 미치는가? : 채택 집단간 정보력 및 신뢰도 효과)

  • Jung, Byungho;Kwon, Taehyoung
    • Journal of Information Technology Services
    • /
    • v.13 no.1
    • /
    • pp.221-251
    • /
    • 2014
  • This paper is to investigate the degree of impact of social media use on buyer's value. Buyers of innovative digital devise are classified into three groups based on adopting behaviors. This study focuses on the degree of changes in information accessability and trust, and their associations with increased value perceived in resulting quality life. The result shows the gap in information accessability has disappeared while the one in trust remained. This implies that the gap among adopters in diffusion curve, so-called the chasm notion is very likely to be lessened or disappeared due to social network openness. Also, shown are the relationship of these variables with the degree of purchase value more stable with information accessability than with trust, all in varying patterns though. It implies that information sharing through social media be accompanied with source credibility in order to be of more value not only to buyers but also to sellers especially for new interactive devices.

Social Network-based Hybrid Collaborative Filtering using Genetic Algorithms (유전자 알고리즘을 활용한 소셜네트워크 기반 하이브리드 협업필터링)

  • Noh, Heeryong;Choi, Seulbi;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.2
    • /
    • pp.19-38
    • /
    • 2017
  • Collaborative filtering (CF) algorithm has been popularly used for implementing recommender systems. Until now, there have been many prior studies to improve the accuracy of CF. Among them, some recent studies adopt 'hybrid recommendation approach', which enhances the performance of conventional CF by using additional information. In this research, we propose a new hybrid recommender system which fuses CF and the results from the social network analysis on trust and distrust relationship networks among users to enhance prediction accuracy. The proposed algorithm of our study is based on memory-based CF. But, when calculating the similarity between users in CF, our proposed algorithm considers not only the correlation of the users' numeric rating patterns, but also the users' in-degree centrality values derived from trust and distrust relationship networks. In specific, it is designed to amplify the similarity between a target user and his or her neighbor when the neighbor has higher in-degree centrality in the trust relationship network. Also, it attenuates the similarity between a target user and his or her neighbor when the neighbor has higher in-degree centrality in the distrust relationship network. Our proposed algorithm considers four (4) types of user relationships - direct trust, indirect trust, direct distrust, and indirect distrust - in total. And, it uses four adjusting coefficients, which adjusts the level of amplification / attenuation for in-degree centrality values derived from direct / indirect trust and distrust relationship networks. To determine optimal adjusting coefficients, genetic algorithms (GA) has been adopted. Under this background, we named our proposed algorithm as SNACF-GA (Social Network Analysis - based CF using GA). To validate the performance of the SNACF-GA, we used a real-world data set which is called 'Extended Epinions dataset' provided by 'trustlet.org'. It is the data set contains user responses (rating scores and reviews) after purchasing specific items (e.g. car, movie, music, book) as well as trust / distrust relationship information indicating whom to trust or distrust between users. The experimental system was basically developed using Microsoft Visual Basic for Applications (VBA), but we also used UCINET 6 for calculating the in-degree centrality of trust / distrust relationship networks. In addition, we used Palisade Software's Evolver, which is a commercial software implements genetic algorithm. To examine the effectiveness of our proposed system more precisely, we adopted two comparison models. The first comparison model is conventional CF. It only uses users' explicit numeric ratings when calculating the similarities between users. That is, it does not consider trust / distrust relationship between users at all. The second comparison model is SNACF (Social Network Analysis - based CF). SNACF differs from the proposed algorithm SNACF-GA in that it considers only direct trust / distrust relationships. It also does not use GA optimization. The performances of the proposed algorithm and comparison models were evaluated by using average MAE (mean absolute error). Experimental result showed that the optimal adjusting coefficients for direct trust, indirect trust, direct distrust, indirect distrust were 0, 1.4287, 1.5, 0.4615 each. This implies that distrust relationships between users are more important than trust ones in recommender systems. From the perspective of recommendation accuracy, SNACF-GA (Avg. MAE = 0.111943), the proposed algorithm which reflects both direct and indirect trust / distrust relationships information, was found to greatly outperform a conventional CF (Avg. MAE = 0.112638). Also, the algorithm showed better recommendation accuracy than the SNACF (Avg. MAE = 0.112209). To confirm whether these differences are statistically significant or not, we applied paired samples t-test. The results from the paired samples t-test presented that the difference between SNACF-GA and conventional CF was statistical significant at the 1% significance level, and the difference between SNACF-GA and SNACF was statistical significant at the 5%. Our study found that the trust/distrust relationship can be important information for improving performance of recommendation algorithms. Especially, distrust relationship information was found to have a greater impact on the performance improvement of CF. This implies that we need to have more attention on distrust (negative) relationships rather than trust (positive) ones when tracking and managing social relationships between users.

Enhancing Predictive Accuracy of Collaborative Filtering Algorithms using the Network Analysis of Trust Relationship among Users (사용자 간 신뢰관계 네트워크 분석을 활용한 협업 필터링 알고리즘의 예측 정확도 개선)

  • Choi, Seulbi;Kwahk, Kee-Young;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.3
    • /
    • pp.113-127
    • /
    • 2016
  • Among the techniques for recommendation, collaborative filtering (CF) is commonly recognized to be the most effective for implementing recommender systems. Until now, CF has been popularly studied and adopted in both academic and real-world applications. The basic idea of CF is to create recommendation results by finding correlations between users of a recommendation system. CF system compares users based on how similar they are, and recommend products to users by using other like-minded people's results of evaluation for each product. Thus, it is very important to compute evaluation similarities among users in CF because the recommendation quality depends on it. Typical CF uses user's explicit numeric ratings of items (i.e. quantitative information) when computing the similarities among users in CF. In other words, user's numeric ratings have been a sole source of user preference information in traditional CF. However, user ratings are unable to fully reflect user's actual preferences from time to time. According to several studies, users may more actively accommodate recommendation of reliable others when purchasing goods. Thus, trust relationship can be regarded as the informative source for identifying user's preference with accuracy. Under this background, we propose a new hybrid recommender system that fuses CF and social network analysis (SNA). The proposed system adopts the recommendation algorithm that additionally reflect the result analyzed by SNA. In detail, our proposed system is based on conventional memory-based CF, but it is designed to use both user's numeric ratings and trust relationship information between users when calculating user similarities. For this, our system creates and uses not only user-item rating matrix, but also user-to-user trust network. As the methods for calculating user similarity between users, we proposed two alternatives - one is algorithm calculating the degree of similarity between users by utilizing in-degree and out-degree centrality, which are the indices representing the central location in the social network. We named these approaches as 'Trust CF - All' and 'Trust CF - Conditional'. The other alternative is the algorithm reflecting a neighbor's score higher when a target user trusts the neighbor directly or indirectly. The direct or indirect trust relationship can be identified by searching trust network of users. In this study, we call this approach 'Trust CF - Search'. To validate the applicability of the proposed system, we used experimental data provided by LibRec that crawled from the entire FilmTrust website. It consists of ratings of movies and trust relationship network indicating who to trust between users. The experimental system was implemented using Microsoft Visual Basic for Applications (VBA) and UCINET 6. To examine the effectiveness of the proposed system, we compared the performance of our proposed method with one of conventional CF system. The performances of recommender system were evaluated by using average MAE (mean absolute error). The analysis results confirmed that in case of applying without conditions the in-degree centrality index of trusted network of users(i.e. Trust CF - All), the accuracy (MAE = 0.565134) was lower than conventional CF (MAE = 0.564966). And, in case of applying the in-degree centrality index only to the users with the out-degree centrality above a certain threshold value(i.e. Trust CF - Conditional), the proposed system improved the accuracy a little (MAE = 0.564909) compared to traditional CF. However, the algorithm searching based on the trusted network of users (i.e. Trust CF - Search) was found to show the best performance (MAE = 0.564846). And the result from paired samples t-test presented that Trust CF - Search outperformed conventional CF with 10% statistical significance level. Our study sheds a light on the application of user's trust relationship network information for facilitating electronic commerce by recommending proper items to users.

A Quantitative Trust Model based on Empirical Outcome Distributions and Satisfaction Degree (경험적 확률분포와 만족도에 기반한 정량적 신뢰 모델)

  • Kim, Hak-Joon;Sohn, Bong-Ki;Lee, Seung-Joo
    • The KIPS Transactions:PartB
    • /
    • v.13B no.7 s.110
    • /
    • pp.633-642
    • /
    • 2006
  • In the Internet environment many interactions between many users and unknown users take place and it is usually rare to have the trust information about others. Due to the lack of trust information, entities have to take some risks in transactions with others. In this perspective, it is crucial for the entities to be equipped with functionality to accumulate and manage the trust information on other entities in order to reduce risks and uncertainty in their transactions. This paper is concerned with a quantitative computational trust model which takes into account multiple evaluation criteria and uses the recommendation from others in order to get the trust for an entity. In the proposed trust model, the trust for an entity is defined as the expectation for the entity to yield satisfactory outcomes in the given situation. Once an interaction has been made with an entity, it is assumed that outcomes are observed with respect to evaluation criteria. When the trust information is needed, the satisfaction degree, which is the probability to generate satisfactory outcomes for each evaluation criterion, is computed based on the empirical outcome outcome distributions and the entity's preference degrees on the outcomes. Then, the satisfaction degrees for evaluation criteria are aggregated into a trust value. At that time, the reputation information is also incorporated into the trust value. This paper also shows that the model could help the entities effectively choose other entities for transactions with some experiments in e-commerce.

An Empirical Study on the Structural Relationships among Colleague trustworthiness, Organizational trust and Organizational citizenship behaviors (동료신뢰성, 조직신뢰, 조직시민행동 간의 구조적 관계)

  • Baek, You-Sung
    • Management & Information Systems Review
    • /
    • v.35 no.4
    • /
    • pp.155-168
    • /
    • 2016
  • The purpose of this study is to empirically examine the structural relationships among colleague trustworthiness, organizational trust and organizational citizenship behaviors(OCB). To conduct such examination, the author (i) designated colleague trustworthiness, organizational trust and OCB as variables and (ii) designed a research model by conducting preceding studies on the variables. To examine the research model the author collected the survey data from the 2 universities employees, 134 copies of questionnaire. Collected data were analyzed using SPSS and AMOS programs. The analysis results are as follows. Especially, (1) there was no statistically significant relationship between colleague trustworthiness and OCB. (2) it was found that higher degree of integrity the constructs of colleague trustworthiness would lead to higher degree of organizational trust. (3) organizational trust has been found to exert mediating effect on the relationship between colleague trustworthiness and OCB. The implication and limitation which this study are as follows. First, this study has discovered that organizational trust is the important mediating variable that affect the process of relationship between colleague trustworthiness and OCB. This study have limitation in that was conducted based on cross-sectional design of research. Because, the formation of trust is a dynamic process.

  • PDF

Design of An Improved Trust Model for Mutual Authentication in USN (USN 상호인증을 위한 개선된 신용모델 설계)

  • Kim Hong-Seop;Lee Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.239-252
    • /
    • 2005
  • Ubiquitous Sensor Network(USN) , the core technology for the Ubiquitous environments ,must be operated in the restrictive battery capacity and computing. From this cause, USN needs the lightweight design for low electric energy and the minimum computing. The previous mutual authentication. based on J$\emptyset$sang's trust model, in USN has a character that makes the lightweight mutual authentication possible in conformity with minimum computing. But, it has an imperfection at the components of representing the trust from a lightweight point of view. In this paper, we improve on the J$\emptyset$sang's trust model to apply a lightweight mutual authentication in USN. The proposed trust model in USN defines the trust information with the only degree of trust-entity(x)'s belief. The defined trust information has a superiority over the J$\emptyset$sang's trust model from a computing Point of view. because it computes information by Probability and logic operation(AND).

  • PDF