scholarly journals Recommendation Model for Trust Circle Mining Based on Users' Interest Fields

Author(s):  
Yun Bai ◽  
Wandong Cai

A trust-based recommendation system recommends the resources needed for users by system rating data and users' trust relationship. In current relevant work, an over-generalized trust relationship is likely to be considered without exploiting the relationship between trust information and interest fields, affecting the precision and reliability of the recommendation. This research, therefore, proposes a users' interest-field-based trust circle model. Based on different interest fields, it exploits potential implicit trust relationships in separated layers. Besides, it conducts user rating by combining explicit trust relationships. This model not only considers the matching between trust information and fields, but also explores the implicit trust relationships between users do not revealed in specific fields, thus it is able to improve the precision and coverage of rating prediction. The experiments made with the Epinions data set proved that the recommendation model based on trust circle exploiting in users' interest fields proposed in this research, is able to effectively improve the precision and coverage of the recommendation rating prediction, compared with the traditional recommendation algorithm based on generalized trust relationship.

Rekayasa ◽  
2020 ◽  
Vol 13 (3) ◽  
pp. 234-239
Author(s):  
Noor Ifada ◽  
Nur Fitriani Dwi Putri ◽  
Mochammad Kautsar Sophan

A multi-criteria collaborative filtering recommendation system allows its users to rate items based on several criteria. Users instinctively have different tendencies in rating items that some of them are quite generous while others tend to be pretty stingy.  Given the diverse rating patterns, implementing a normalization technique in the system is beneficial to reveal the latent relationship within the multi-criteria rating data. This paper analyses and compares the performances of two methods that implement the normalization based multi-criteria collaborative filtering approach. The framework of the method development consists of three main processes, i.e.: multi-criteria rating representation, multi-criteria rating normalization, and rating prediction using a multi-criteria collaborative filtering approach. The developed methods are labelled based on the implemented normalization technique and multi-criteria collaborative filtering approaches, i.e., Decoupling normalization and Multi-Criteria User-based approach (DMCUser) and Decoupling normalization and Multi-Criteria User-based approach (DMCItem). Experiment results using the real-world Yelp Dataset show that DMCItem outperforms DMCUser at most  in terms of Precision and Normalized Discounted Cumulative Gain (NDCG). Though DMCUser can perform better than DMCItem at large , it is still more practical to implement DMCItem rather than DMCUser in a multi-criteria recommendation system since users tend to show more interest to items at the top list.


2021 ◽  
Vol 1 (2) ◽  
pp. 1-9
Author(s):  
Wenjun Huang ◽  
Junyu Chen ◽  
Yue Ding

In the Internet age, how to dig out useful information from massive data has become a research hotspot. The emergence of recommendation algorithms effectively solves the problem of information overload, but traditional recommendation algorithms face problems such as data sparseness, cold start, and low accuracy. Later social recommendation algorithms usually only use a single social trust information for recommendation, and the integration of multiple trust relationships lacks an efficient model, which greatly affects the accuracy and reliability of recommendation. This paper proposes a trust-based approach. Recommended algorithm. First, use social trust data to calculate user trust relationships, including user local trust and user global trust. Further based on the scoring data, an implicit trust relationship is calculated, called rating trust, which includes scoring local trust and scoring global trust. Then set the recommendation weight, build the preference relationship between users through user trust and rating trust, and form a comprehensive trust relationship. The trust relationship of social networks is integrated into the probability matrix decomposition model to form an efficient and unified trusted recommendation model TR-PMF. This algorithm is compared with related algorithms on the Ciao and FilmTrust datasets, and the results prove that our method is competitive with other recommendation algorithms.


Author(s):  
Liang Jiang ◽  
Lu Liu ◽  
Jingjing Yao ◽  
Leilei Shi

Abstract The recommendation system is an effective means to solve the information overload problem that exists in social networks, which is also one of the most common applications of big data technology. Thus, the matrix decomposition recommendation model based on scoring data has been extensively studied and applied in recent years, but the data sparsity problem affects the recommendation quality of the model. To this end, this paper proposes a hybrid recommendation model based on deep emotion analysis and multi-source view fusion which makes a personalized recommendation with user-post interaction ratings, implicit feedback and auxiliary information in a hybrid recommendation system. Specifically, the HITS algorithm is used to process the data set, which can filter out the users and posts with high influence and eliminate most of the low-quality users and posts. Secondly, the calculation method of measuring the similarity of candidate posts and the method of calculating K nearest neighbors are designed, which solves the problem that the text description information of post content in the recommendation system is difficult to mine and utilize. Then, the cooperative training strategy is used to achieve the fusion of two recommended views, which eliminates the data distribution deviation added to the training data pool in the iterative training. Finally, the performance of the DMHR algorithm proposed in this paper is compared with other state-of-art algorithms based on the Twitter dataset. The experimental results show that the DMHR algorithm has significant improvements in score prediction and recommendation performance.


2011 ◽  
Vol 13 (2) ◽  
pp. 56-85 ◽  
Author(s):  
Nora S. Eggen

In the Qur'an we find different concepts of trust situated within different ethical discourses. A rather unambiguous ethico-religious discourse of the trust relationship between the believer and God can be seen embodied in conceptions of tawakkul. God is the absolute wakīl, the guardian, trustee or protector. Consequently He is the only holder of an all-encompassing trusteeship, and the normative claim upon the human being is to trust God unconditionally. There are however other, more polyvalent, conceptions of trust. The main discussion in this article evolves around the conceptions of trust as expressed in the polysemic notion of amāna, involving both trust relationships between God and man and inter-human trust relationships. This concept of trust involves both trusting and being trusted, although the strongest and most explicit normative claim put forward is on being trustworthy in terms of social ethics as well as in ethico-religious discourse. However, ‘trusting’ when it comes to fellow human beings is, as we shall see, framed in the Qur'an in less absolute terms, and conditioned by circumstantial factors; the Qur'anic antithesis to social trust is primarily betrayal, ‘khiyāna’, rather than mistrust.


2021 ◽  
Author(s):  
Junjie Shi ◽  
Jiang Bian ◽  
Jakob Richter ◽  
Kuan-Hsun Chen ◽  
Jörg Rahnenführer ◽  
...  

AbstractThe predictive performance of a machine learning model highly depends on the corresponding hyper-parameter setting. Hence, hyper-parameter tuning is often indispensable. Normally such tuning requires the dedicated machine learning model to be trained and evaluated on centralized data to obtain a performance estimate. However, in a distributed machine learning scenario, it is not always possible to collect all the data from all nodes due to privacy concerns or storage limitations. Moreover, if data has to be transferred through low bandwidth connections it reduces the time available for tuning. Model-Based Optimization (MBO) is one state-of-the-art method for tuning hyper-parameters but the application on distributed machine learning models or federated learning lacks research. This work proposes a framework $$\textit{MODES}$$ MODES that allows to deploy MBO on resource-constrained distributed embedded systems. Each node trains an individual model based on its local data. The goal is to optimize the combined prediction accuracy. The presented framework offers two optimization modes: (1) $$\textit{MODES}$$ MODES -B considers the whole ensemble as a single black box and optimizes the hyper-parameters of each individual model jointly, and (2) $$\textit{MODES}$$ MODES -I considers all models as clones of the same black box which allows it to efficiently parallelize the optimization in a distributed setting. We evaluate $$\textit{MODES}$$ MODES by conducting experiments on the optimization for the hyper-parameters of a random forest and a multi-layer perceptron. The experimental results demonstrate that, with an improvement in terms of mean accuracy ($$\textit{MODES}$$ MODES -B), run-time efficiency ($$\textit{MODES}$$ MODES -I), and statistical stability for both modes, $$\textit{MODES}$$ MODES outperforms the baseline, i.e., carry out tuning with MBO on each node individually with its local sub-data set.


2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.


2013 ◽  
Vol 17 (7) ◽  
pp. 2781-2796 ◽  
Author(s):  
S. Shukla ◽  
J. Sheffield ◽  
E. F. Wood ◽  
D. P. Lettenmaier

Abstract. Global seasonal hydrologic prediction is crucial to mitigating the impacts of droughts and floods, especially in the developing world. Hydrologic predictability at seasonal lead times (i.e., 1–6 months) comes from knowledge of initial hydrologic conditions (IHCs) and seasonal climate forecast skill (FS). In this study we quantify the contributions of two primary components of IHCs – soil moisture and snow water content – and FS (of precipitation and temperature) to seasonal hydrologic predictability globally on a relative basis throughout the year. We do so by conducting two model-based experiments using the variable infiltration capacity (VIC) macroscale hydrology model, one based on ensemble streamflow prediction (ESP) and another based on Reverse-ESP (Rev-ESP), both for a 47 yr re-forecast period (1961–2007). We compare cumulative runoff (CR), soil moisture (SM) and snow water equivalent (SWE) forecasts from each experiment with a VIC model-based reference data set (generated using observed atmospheric forcings) and estimate the ratio of root mean square error (RMSE) of both experiments for each forecast initialization date and lead time, to determine the relative contribution of IHCs and FS to the seasonal hydrologic predictability. We find that in general, the contributions of IHCs to seasonal hydrologic predictability is highest in the arid and snow-dominated climate (high latitude) regions of the Northern Hemisphere during forecast periods starting on 1 January and 1 October. In mid-latitude regions, such as the Western US, the influence of IHCs is greatest during the forecast period starting on 1 April. In the arid and warm temperate dry winter regions of the Southern Hemisphere, the IHCs dominate during forecast periods starting on 1 April and 1 July. In equatorial humid and monsoonal climate regions, the contribution of FS is generally higher than IHCs through most of the year. Based on our findings, we argue that despite the limited FS (mainly for precipitation) better estimates of the IHCs could lead to improvement in the current level of seasonal hydrologic forecast skill over many regions of the globe at least during some parts of the year.


Entropy ◽  
2018 ◽  
Vol 20 (9) ◽  
pp. 642 ◽  
Author(s):  
Erlandson Saraiva ◽  
Adriano Suzuki ◽  
Luis Milan

In this paper, we study the performance of Bayesian computational methods to estimate the parameters of a bivariate survival model based on the Ali–Mikhail–Haq copula with marginal distributions given by Weibull distributions. The estimation procedure was based on Monte Carlo Markov Chain (MCMC) algorithms. We present three version of the Metropolis–Hastings algorithm: Independent Metropolis–Hastings (IMH), Random Walk Metropolis (RWM) and Metropolis–Hastings with a natural-candidate generating density (MH). Since the creation of a good candidate generating density in IMH and RWM may be difficult, we also describe how to update a parameter of interest using the slice sampling (SS) method. A simulation study was carried out to compare the performances of the IMH, RWM and SS. A comparison was made using the sample root mean square error as an indicator of performance. Results obtained from the simulations show that the SS algorithm is an effective alternative to the IMH and RWM methods when simulating values from the posterior distribution, especially for small sample sizes. We also applied these methods to a real data set.


2015 ◽  
Vol 35 (3) ◽  
pp. 442-457 ◽  
Author(s):  
Acácio Perboni ◽  
Jose A. Frizzone ◽  
Antonio P. de Camargo ◽  
Marinaldo F. Pinto

Local head losses must be considered in estimating properly the maximum length of drip irrigation laterals. The aim of this work was to develop a model based on dimensional analysis for calculating head loss along laterals accounting for in-line drippers. Several measurements were performed with 12 models of emitters to obtain the experimental data required for developing and assessing the model. Based on the Camargo & Sentelhas coefficient, the model presented an excellent result in terms of precision and accuracy on estimating head loss. The deviation between estimated and observed values of head loss increased according to the head loss and the maximum deviation reached 0.17 m. The maximum relative error was 33.75% and only 15% of the data set presented relative errors higher than 20%. Neglecting local head losses incurred a higher than estimated maximum lateral length of 19.48% for pressure-compensating drippers and 16.48% for non pressure-compensating drippers.


2014 ◽  
Vol 14 (1) ◽  
pp. 5394-5397
Author(s):  
Sourabh S. Mahajan ◽  
S.K. Pathan

Peer-to-Peer systems enables the interactions of peers to accomplish tasks. Attacks of peers with malicious can be reduced by establishing trust relationship among peers. In this paper we presents algorithms which helps a peer to reason about trustworthiness of other peers based on interactions in the past and recommendations. Local information is used to create trust network of peers and does not need to deal with global information. Trustworthiness of peers in providing services can be describedby Service metric and recommendation metric. Parameters considered for evaluating interactions and recommendations are Recentness, Importance and Peer Satisfaction. Trust relationships helps a good peer to isolate malicious peers.


Sign in / Sign up

Export Citation Format

Share Document