scholarly journals AIRC: Attentive Implicit Relation Recommendation Incorporating Content Information for Bipartite Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2132
Author(s):  
Xintao Ma ◽  
Liyan Dong ◽  
Yuequn Wang ◽  
Yongli Li ◽  
Minghui Sun
Keyword(s):  
Recommendation System ◽  
Bipartite Graphs ◽  
Research Topic ◽  
Online Information ◽  
Unique Type ◽  
Implicit Relation ◽  
Recommendation Algorithms ◽  
Relation Graph ◽  
Content Information ◽  
Better Than

With users being exposed to the growing volume of online information, the recommendation system aiming at mining the important or interesting information is becoming a modern research topic. One approach of recommendation is to integrate the graph neural network with deep learning algorithms. However, some of them are not tailored for bipartite graphs, which is a unique type of heterogeneous graph having two entity types. Others, though customized, neglect the importance of implicit relation and content information. In this paper, we propose the attentive implicit relation recommendation incorporating content information (AIRC) framework that is designed for bipartite graphs based on the GC–MC algorithm. First, through reconstructing the bipartite graphs, we obtain the implicit relation graphs. Then we analyze the content information of users and items with a CNN process, so that each user and item has its feature-tailored embeddings. Besides, we expand the GC–MC algorithms by adding a graph attention mechanism layer, which handles the implicit relation graph by highlighting important features and neighbors. Therefore, our framework takes into consideration both the implicit relation and content information. Finally, we test our framework on Movielens dataset and the results show that our framework performs better than other state-of-art recommendation algorithms.

scholarly journals A Two-Stage Neural Network-Based Cold Start Item Recommender

2021 ◽  
Vol 11 (9) ◽  
pp. 4243
Author(s):  
Chieh-Yuan Tsai ◽  
Yi-Fan Chiu ◽  
Yu-Jen Chen
Keyword(s):  
Neural Network ◽  
Recommendation System ◽  
Service Providers ◽  
Cold Start ◽  
Computational Time ◽  
Two Stage ◽  
The Neural Network ◽  
Textual Description ◽  
Recommendation Algorithms ◽  
Content Information

Nowadays, recommendation systems have been successfully adopted in variant online services such as e-commerce, news, and social media. The recommenders provide users a convenient and efficient way to find their exciting items and increase service providers’ revenue. However, it is found that many recommenders suffered from the cold start (CS) problem where only a small number of ratings are available for some new items. To conquer the difficulties, this research proposes a two-stage neural network-based CS item recommendation system. The proposed system includes two major components, which are the denoising autoencoder (DAE)-based CS item rating (DACR) generator and the neural network-based collaborative filtering (NNCF) predictor. In the DACR generator, a textual description of an item is used as auxiliary content information to represent the item. Then, the DAE is applied to extract the content features from high-dimensional textual vectors. With the compact content features, a CS item’s rating can be efficiently derived based on the ratings of similar non-CS items. Second, the NNCF predictor is developed to predict the ratings in the sparse user–item matrix. In the predictor, both spare binary user and item vectors are projected to dense latent vectors in the embedding layer. Next, latent vectors are fed into multilayer perceptron (MLP) layers for user–item matrix learning. Finally, appropriate item suggestions can be accurately obtained. The extensive experiments show that the DAE can significantly reduce the computational time for item similarity evaluations while keeping the original features’ characteristics. Besides, the experiments show that the proposed NNCF predictor outperforms several popular recommendation algorithms. We also demonstrate that the proposed CS item recommender can achieve up to 8% MAE improvement compared to adding no CS item rating.

Feature-based multi-criteria recommendation system using a weighted approach with ranking correlation

2021 ◽  
Vol 25 (4) ◽  
pp. 1013-1029
Author(s):  
Zeeshan Zeeshan ◽  
Qurat ul Ain ◽  
Uzair Aslam Bhatti ◽  
Waqar Hussain Memon ◽  
Sajid Ali ◽  
...  
Keyword(s):  
Recommendation System ◽  
Sources Of Information ◽  
Multiple Features ◽  
Recommendation Algorithms ◽  
Label Correlations ◽  
Feature Based ◽  
Multicriteria Model ◽  
Implicit And Explicit ◽  
Hybrid Recommendation ◽  
Different Sources

With the increase of online businesses, recommendation algorithms are being researched a lot to facilitate the process of using the existing information. Such multi-criteria recommendation (MCRS) helps a lot the end-users to attain the required results of interest having different selective criteria – such as combinations of implicit and explicit interest indicators in the form of ranking or rankings on different matched dimensions. Current approaches typically use label correlation, by assuming that the label correlations are shared by all objects. In real-world tasks, however, different sources of information have different features. Recommendation systems are more effective if being used for making a recommendation using multiple criteria of decisions by using the correlation between the features and items content (content-based approach) or finding a similar user rating to get targeted results (Collaborative filtering). To combine these two filterings in the multicriteria model, we proposed a features-based fb-knn multi-criteria hybrid recommendation algorithm approach for getting the recommendation of the items by using multicriteria features of items and integrating those with the correlated items found in similar datasets. Ranks were assigned to each decision and then weights were computed for each decision by using the standard deviation of items to get the nearest result. For evaluation, we tested the proposed algorithm on different datasets having multiple features of information. The results demonstrate that proposed fb-knn is efficient in different types of datasets.

scholarly journals Application of Improved Recommendation System Based on Spark Platform in Big Data Analysis

2016 ◽  
Vol 16 (6) ◽  
pp. 245-255 ◽  
Author(s):  
Li Xie ◽  
Wenbo Zhou ◽  
Yaosen Li
Keyword(s):  
Big Data ◽  
Recommender System ◽  
Recommendation System ◽  
Parallel Implementation ◽  
Implementation Process ◽  
Recommendation Algorithm ◽  
Filtration Problem ◽  
Information Filtration ◽  
Similarity Information ◽  
Better Than

Abstract In the era of big data, people have to face information filtration problem. For those cases when users do not or cannot express their demands clearly, recommender system can analyse user’s information more proactive and intelligent to filter out something users want. This property makes recommender system play a very important role in the field of e-commerce, social network and so on. The collaborative filtering recommendation algorithm based on Alternating Least Squares (ALS) is one of common algorithms using matrix factorization technique of recommendation system. In this paper, we design the parallel implementation process of the recommendation algorithm based on Spark platform and the related technology research of recommendation systems. Because of the shortcomings of the recommendation algorithm based on ALS model, a new loss function is designed. Before the model is trained, the similarity information of users and items is fused. The experimental results show that the performance of the proposed algorithm is better than that of algorithm based on ALS.

scholarly journals Using the Generative Adversarial Network to Generate Recommendations

2020 ◽  
Author(s):  
A.V. Prosvetov
Keyword(s):  
Real World ◽  
Recommendation System ◽  
Generative Adversarial Networks ◽  
Generative Adversarial Network ◽  
Theoretical Comparison ◽  
New Methods ◽  
Adversarial Network ◽  
Adversarial Networks ◽  
Recommendation Algorithms ◽  
Cold Start Problem

Widely used recommendation systems do not meet all industry requirements, so the search for more advanced methods for creating recommendations continues. The proposed new methods based on Generative Adversarial Networks (GAN) have a theoretical comparison with other recommendation algorithms; however, real-world comparisons are needed to introduce new methods in the industry. In our work, we compare recommendations from the Generative Adversarial Network with recommendation from the Deep Semantic Similarity Model (DSSM) on real-world case of airflight tickets. We found a way to train the GAN so that users receive appropriate recommendations, and during A/B testing, we noted that the GAN-based recommendation system can successfully compete with other neural networks in generating recommendations. One of the advantages of the proposed approach is that the GAN training process avoids a negative sampling, which causes a number of distortions in the final ratings of recommendations. Due to the ability of the GAN to generate new objects from the distribution of the training set, we assume that the Conditional GAN is able to solve the cold start problem.

scholarly journals SIS dynamic network model based on product semantics from the perspective of infectious disease dynamics

2021 ◽  
Vol 235 ◽  
pp. 03035
Author(s):  
jiaojiao Lv ◽  
yingsi Zhao
Keyword(s):  
Network Model ◽  
Purchase Intention ◽  
Recommendation System ◽  
Optimal Algorithm ◽  
Dynamic Network ◽  
Distribution Model ◽  
Recommendation Algorithm ◽  
Model Based ◽  
Dynamic Network Model ◽  
Recommendation Algorithms

Recommendation system is unable to achive the optimal algorithm, recommendation system precision problem into bottleneck. Based on the perspective of product marketing, paper takes the inherent attribute as the classification standard and focuses on the core problem of “matching of product classification and recommendation algorithm of users’ purchase demand”. Three hypotheses are proposed: (1) inherent attributes of the product directly affect user demand; (2) classified product is suitable for different recommendation algorithms; (3) recommendation algorithm integration can achieve personalized customization. Based on empirical research on the relationship between characteristics of recommendation information (independent variable) and purchase intention (dependent variable), it is concluded that predictability and difference of recommendation information are not fully perceived and stimulation is insufficient. Therefore, SIS dynamic network model based on the distribution model of SIS virus is constructed. It discusses the spreading path of recommendation information and “infection” situation of consumers to enhance accurate matching of recommendation system.

scholarly journals The algorithm and the flow: Netflix, machine learning and recommendation algorithms

Intexto ◽  
2019 ◽  
pp. 166-184
Author(s):  
João Damasceno Martins Ladeira
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Recommendation System ◽  
Cultural Impact ◽  
Recommendation Algorithms ◽  
Definition Of

This article discusses the Netflix recommendation system, expecting to understand these techniques as a part of the contemporary strategies for the reorganization of television and audiovisual. It renders problematic a technology indispensable to these suggestions: the tools for artificial intelligence, expecting to infer questions of cultural impact inscribed in this technique. These recommendations will be analyzed in their relationship with the formerly decisive form for the constitution of broadcast: the television flow. The text investigates the meaning such influential tools at the definition of a television based on the manipulation of collections, and not in the predetermined programming, decided previously to the transmission of content. The conclusion explores the consequences of these archives, which concedes to the user a sensation of choice in tension with the mechanical character of those images.

scholarly journals Augmented Context-Based Conceptual User Modeling for Personalized Recommendation System in Online Social Networks

2020 ◽  
Vol 14 (3) ◽  
pp. 1-19
Author(s):  
Ammar Alnahhas ◽  
Bassel Alkhatib
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Recommendation System ◽  
Contextual Information ◽  
Detailed Comparison ◽  
Personalized Recommendation ◽  
User Models ◽  
Proposed Model ◽  
Recommendation Algorithms ◽  
Novel Method

As the data on the online social networks is getting larger, it is important to build personalized recommendation systems that recommend suitable content to users, there has been much research in this field that uses conceptual representations of text to match user models with best content. This article presents a novel method to build a user model that depends on conceptual representation of text by using ConceptNet concepts that exceed the named entities to include the common-sense meaning of words and phrases. The model includes the contextual information of concepts as well, the authors also show a novel method to exploit the semantic relations of the knowledge base to extend user models, the experiment shows that the proposed model and associated recommendation algorithms outperform all previous methods as a detailed comparison shows in this article.

Constructing Recommendation Systems for Effective Health Messages Using Content, Collaborative, and Hybrid Algorithms

2015 ◽  
Vol 659 (1) ◽  
pp. 290-306 ◽  
Author(s):  
Joseph N. Cappella ◽  
Sijia Yang ◽  
Sungkyoung Lee
Keyword(s):  
Recommendation System ◽  
Recommendation Systems ◽  
Theory Development ◽  
Health Messages ◽  
Recommendation Algorithms ◽  
Public Health Messages ◽  
Message Testing ◽  
Conventional Models ◽  
Content Similarity ◽  
Empirical Approaches

Theoretical and empirical approaches to the design of effective messages to increase healthy and reduce risky behavior have shown only incremental progress. This article explores approaches to the development of a “recommendation system” for archives of public health messages. Recommendation systems are algorithms operating on dense data involving both individual preferences and objective message features. Their goal is to predict ratings for items (i.e., messages) not previously seen by the user on content similarity, prior preference patterns, or their combination. Standard approaches to message testing and research, while making progress, suffer from very slow accumulation of knowledge. This article seeks to leapfrog conventional models of message research, taking advantage of modeling developments in recommendation systems from the commercial arena. After sketching key components in developing recommendation algorithms, this article concludes with reflections on the implications of these approaches in both theory development and application.

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 Recommendation Based on Trust Diffusion Model

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Jinfeng Yuan ◽  
Li Li
Keyword(s):  
Matrix Factorization ◽  
High Performance ◽  
Recommendation System ◽  
Online Information ◽  
Trust Network ◽  
Data Sparsity ◽  
Pmf Model ◽  
Probabilistic Matrix Factorization ◽  
Sparsity Problem ◽  
Relationship Of

Recommender system is emerging as a powerful and popular tool for online information relevant to a given user. The traditional recommendation system suffers from the cold start problem and the data sparsity problem. Many methods have been proposed to solve these problems, but few can achieve satisfactory efficiency. In this paper, we present a method which combines the trust diffusion (DiffTrust) algorithm and the probabilistic matrix factorization (PMF). DiffTrust is first used to study the possible diffusions of trust between various users. It is able to make use of the implicit relationship of the trust network, thus alleviating the data sparsity problem. The probabilistic matrix factorization (PMF) is then employed to combine the users' tastes with their trusted friends' interests. We evaluate the algorithm on Flixster, Moviedata, and Epinions datasets, respectively. The experimental results show that the recommendation based on our proposed DiffTrust + PMF model achieves high performance in terms of the root mean square error (RMSE), Recall, andFMeasure.

Sign in / Sign up

Export Citation Format

Share Document