scholarly journals Recommendation Algorithm in Double-Layer Network Based on Vector Dynamic Evolution Clustering and Attention Mechanism

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Jianrui Chen ◽  
Zhihui Wang ◽  
Tingting Zhu ◽  
Fernando E. Rosas
Keyword(s):  
Collaborative Filtering ◽  
Double Layer ◽  
State Of The Art ◽  
Single Layer ◽  
Attention Mechanism ◽  
User Preference ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
The Status ◽  
Single Layer Network

The purpose of recommendation systems is to help users find effective information quickly and conveniently and also to present the items that users are interested in. While the literature of recommendation algorithms is vast, most collaborative filtering recommendation approaches attain low recommendation accuracies and are also unable to track temporal changes of preferences. Additionally, previous differential clustering evolution processes relied on a single-layer network and used a single scalar quantity to characterise the status values of users and items. To address these limitations, this paper proposes an effective collaborative filtering recommendation algorithm based on a double-layer network. This algorithm is capable of fully exploring dynamical changes of user preference over time and integrates the user and item layers via an attention mechanism to build a double-layer network model. Experiments on Movielens, CiaoDVD, and Filmtrust datasets verify the effectiveness of our proposed algorithm. Experimental results show that our proposed algorithm can attain a better performance than other state-of-the-art algorithms.

scholarly journals A social trust and preference segmentation-based matrix factorization recommendation algorithm

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Wei Peng ◽  
Baogui Xin
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
User Preference ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Commercial Activities ◽  
Trust Relationships ◽  
Recommendation Algorithms ◽  
The Difference

AbstractA recommendation can inspire potential demands of users and make e-commerce platforms more intelligent and is essential for e-commerce enterprises’ sustainable development. 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 limited to specific areas. To solve these problems mentioned above, we propose a social trust and preference segmentation-based matrix factorization (SPMF) recommendation algorithm. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly superior to that of some state-of-the-art recommendation algorithms. The SPMF algorithm is a better recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.

Special features of the endometrium’s structure of the childhood

2016 ◽  
Vol 21 (32) ◽  
pp. 63-68
Author(s):  
Тотоева ◽  
Olga Totoeva ◽  
Туаева ◽  
Zarema Tuaeva
Keyword(s):  
Double Layer ◽  
Microscopic Examination ◽  
Single Layer ◽  
Blood Capillaries ◽  
Mucous Coat ◽  
Vascular Bed ◽  
Single Layer Network

The paper presents the results of the macro-microscopic examination of the vascular bed and the structure of the endometrium at 20 specimens of uterus, taken from the corpses of children’s and teenage periods of ontogenesis. It is shown, that the growth of the glands of the mucous coat of the uterus begins in the second infant periodand intensifies in teens. This determines the transformation of single-layer network of lymphatic capillaries to the double-layer one. There were marked transformations of glands and fibrous structures during the cyclical changes of endometrium. Glands increase and lymphatic and blood capillaries and lymphoid elements occur as the primary divisions of the glands and their ducts.

scholarly journals A Triangular Personalized Recommendation Algorithm for Improving Diversity

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Biao Cai ◽  
Xiaowang Yang ◽  
Yusheng Huang ◽  
Hongjun Li ◽  
Qiang Sang
Keyword(s):  
Collaborative Filtering ◽  
Information Overload ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Method ◽  
Online Databases ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
Third Dimension ◽  
Triangular Area

Recommendation systems are used when searching online databases. As such they are very important tools because they provide users with predictions of the outcomes of different potential choices and help users to avoid information overload. They can be used on e-commerce websites and have attracted considerable attention in the scientific community. To date, many personalized recommendation algorithms have aimed to improve recommendation accuracy from the perspective of vertex similarities, such as collaborative filtering and mass diffusion. However, diversity is also an important evaluation index in the recommendation algorithm. In order to study both the accuracy and diversity of a recommendation algorithm at the same time, this study introduced a “third dimension” to the commonly used user/product two-dimensional recommendation, and a recommendation algorithm is proposed that is based on a triangular area (TR algorithm). The proposed algorithm combines the Markov chain and collaborative filtering method to make recommendations for users by building a triangle model, making use of the triangulated area. Additionally, recommendation algorithms based on a triangulated area are parameter-free and are more suitable for applications in real environments. Furthermore, the experimental results showed that the TR algorithm had better performance on diversity and novelty for real datasets of MovieLens-100K and MovieLens-1M than did the other benchmark methods.

CAN DISSIMILAR USERS CONTRIBUTE TO ACCURACY AND DIVERSITY OF PERSONALIZED RECOMMENDATION?

2010 ◽  
Vol 21 (10) ◽  
pp. 1217-1227 ◽  
Author(s):  
WEI ZENG ◽  
MING-SHENG SHANG ◽  
QIAN-MING ZHANG ◽  
LINYUAN LÜ ◽  
TAO ZHOU
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
High Accuracy ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Recommendation Algorithms ◽  
Collaborative Filtering Algorithm ◽  
High Diversity ◽  
Better Than

Recommender systems are becoming a popular and important set of personalization techniques that assist individual users with navigating through the rapidly growing amount of information. A good recommender system should be able to not only find out the objects preferred by users, but also help users in discovering their personalized tastes. The former corresponds to high accuracy of the recommendation, while the latter to high diversity. A big challenge is to design an algorithm that provides both highly accurate and diverse recommendation. Traditional recommendation algorithms only take into account the contributions of similar users, thus, they tend to recommend popular items for users ignoring the diversity of recommendations. In this paper, we propose a recommendation algorithm by considering both the effects of similar and dissimilar users under the framework of collaborative filtering. Extensive analyses on three datasets, namely MovieLens, Netflix and Amazon, show that our method performs much better than the standard collaborative filtering algorithm for both accuracy and diversity.

scholarly journals Intelligent Recommendation Algorithm of Multimedia English Distance Education Resources Based on User Model

2022 ◽  
Vol 2022 ◽  
pp. 1-8
Author(s):  
Xiushan Zhang
Keyword(s):  
Collaborative Filtering ◽  
Nearest Neighbor ◽  
Absolute Error ◽  
User Model ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
Similarity Calculation ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Based on the understanding and comparison of various main recommendation algorithms, this paper focuses on the collaborative filtering algorithm and proposes a collaborative filtering recommendation algorithm with improved user model. Firstly, the algorithm considers the score difference caused by different user scoring habits when expressing preferences and adopts the decoupling normalization method to normalize the user scoring data; secondly, considering the forgetting shift of user interest with time, the forgetting function is used to simulate the forgetting law of score, and the weight of time forgetting is introduced into user score to improve the accuracy of recommendation; finally, the similarity calculation is improved when calculating the nearest neighbor set. Based on the Pearson similarity calculation, the effective weight factor is introduced to obtain a more accurate and reliable nearest neighbor set. The algorithm establishes an offline user model, which makes the algorithm have better recommendation efficiency. Two groups of experiments were designed based on the mean absolute error (MAE). One group of experiments tested the parameters in the algorithm, and the other group of experiments compared the proposed algorithm with other algorithms. The experimental results show that the proposed method has better performance in recommendation accuracy and recommendation efficiency.

scholarly journals Recommendation Algorithm Based on Knowledge Graph to Propagate User Preference

2021 ◽  
Author(s):  
Zhisheng Yang ◽  
Jinyong Cheng
Keyword(s):  
Deep Learning ◽  
Auxiliary Information ◽  
Substantial Improvement ◽  
User Preference ◽  
Knowledge Graph ◽  
Historical Records ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Recommendation Algorithms

Abstract In recommendation algorithms, data sparsity and cold start problems are always inevitable. In order to solve such problems, researchers apply auxiliary information to recommendation algorithms to mine and obtain more potential information through users' historical records and then improve recommendation performance. This paper proposes a model ST_RippleNet, which combines knowledge graph with deep learning. In this model, users' potential interests are mined in the knowledge graph to stimulate the propagation of users' preferences on the set of knowledge entities. In the propagation of preferences, we adopt a triple-based multi-layer attention mechanism, and the distribution of users' preferences for candidate items formed by users' historical click information is used to predict the final click probability. In ST_RippleNet model, music data set is added to the original movie and book data set, and the improved loss function is applied to the model, which is optimized by RMSProp optimizer. Finally, tanh function is added to predict click probability to improve recommendation performance. Compared with the current mainstream recommendation methods, ST_RippleNet recommendation algorithm has very good performance in AUC and ACC, and has substantial improvement in movie, book and music recommendation.

scholarly journals A music recommendation algorithm based on clustering and latent factor model

2020 ◽  
Vol 309 ◽  
pp. 03009
Author(s):  
Yingjie Jin ◽  
Chunyan Han
Keyword(s):  
Collaborative Filtering ◽  
Large Scale ◽  
User Preference ◽  
Implicit Feedback ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Latent Factor ◽  
Latent Factor Models ◽  
Feedback Data ◽  
Preference Matrix

The collaborative filtering recommendation algorithm is a technique for predicting items that a user may be interested in based on user history preferences. In the recommendation process of music data, it is often difficult to score music and the display score data for music is less, resulting in data sparseness. Meanwhile, implicit feedback data is more widely distributed than display score data, and relatively easy to collect, but implicit feedback data training efficiency is relatively low, usually lacking negative feedback. In order to effectively solve the above problems, we propose a music recommendation algorithm combining clustering and latent factor models. First, the user-music play record data is processed to generate a user-music matrix. The data is then analyzed using a latent factor probability model on the resulting matrix to obtain a user preference matrix U and a musical feature matrix V. On this basis, we use two K- means algorithms to perform user clustering and music clustering on two matrices. Finally, for the user preference matrix and the commodity feature matrix that complete the clustering, a user-based collaborative filtering algorithm is used for prediction. The experimental results show that the algorithm can reduce the running cost of large-scale data and improve the recommendation effect.

A Novel Personalized Filtering Recommendation Algorithm Based on Collaborative Tagging

2011 ◽  
Vol 186 ◽  
pp. 621-625
Author(s):  
Ming Yang Sun ◽  
Wei Feng Sun ◽  
Xi Dong Liu ◽  
Lei Xue
Keyword(s):  
Computational Complexity ◽  
Collaborative Filtering ◽  
Collaborative Tagging ◽  
Recommendation Algorithm ◽  
Trade Off ◽  
Filtering Method ◽  
Recommendation Algorithms ◽  
Sparsity Level ◽  
Personal Interests

Recommendation algorithms suffer the quality from the huge and sparse dataset. Memory-based collaborative filtering method has addressed the problem of sparsity by predicting unrated values. However, this method increases the computational complexity, sparsity and expensive complexity of computation are trade-off. In this paper, we propose a novel personalized filtering (PF) recommendation algorithm based on collaborative tagging, which weights the feature of tags that show latent personal interests and constructs a top-N tags set to filter out the undersized and dense dataset. The PF recommendation algorithm can track the changes of personal interests, which is an untilled field for previous studies. The results of empirical experiments show that the sparsity level of PF recommendation algorithm is much lower, and it is more computationally economic than previous algorithms.

Sign in / Sign up

Export Citation Format

Share Document