Graph Neural Networks for E-Learning Recommendation Systems

This paper presents a novel recommendation system for e-learning platforms. Recent years have seen the emergence of graph neural networks (GNNs) for learning representations over graph-structured data. Due to their promising performance in semi-supervised learning over graphs and in recommendation systems, we employ them in e-learning platforms for user profiling and content profiling. Affinity graphs between users and learning resources are constructed in this study, and GNNs are employed to generate recommendations over these affinity graphs. In the context of e-learning, our proposed approach outperforms multiple different content-based and collaborative filtering baselines

Shizuku2.0: Cooperative reading support system / Mao Tsunekawa, Haruki Ono, Kyoji Konishi... [et.al].

The paper aims to propose cooperative reading, which is a reading support technique that allows library users to help each other. To achieve cooperative reading, it is necessary for a user to discover others with similar interests. Therefore, this paper also aims to develop and evaluate a recommendation function that recommends similar users using Nippon Decimal Classification (NDC) Tree Profiling. Is the user recommendation using NDC Tree Profiling effective in finding similar users? Which parameter of NDC Tree Profiling method is the most effective expression of users‘ interests? We developed the Shizuku2.0 system to support the creation of a library user community in which users help each other efficiently and mutually. We also designed and developed NDC Tree Profiling, which enables the creation of library user profiles, for the purposes of the user recommendation mechanism. To verify the effect of the user recommendation mechanism, we performed an experiment with 37 student users to calculate recall and precision. We found that the recommendation using NDC Tree Profiling is more effective than a random recommendation. However, we also recognized that there is room for improvement relative to a past information recommendation technique. Moreover, we found the second level of the NDC code could be the most effective expression of users‘ interests. In the discussion of the optimization of parameters, we propose a new way of implementing the NDC Tree, based on the second division of NDC, which is expected to improve creation of user profiles

A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining

Web usage mining has become the subject of exhaustive research, as its potential for Web based personalized services, prediction user near future intentions, adaptive Web sites and customer profiling is recognized. Recently, a variety of the recommendation systems to predict user future movements through web usage mining have been proposed. However, the quality of the recommendations in the current systems to predict users‘ future requests can not still satisfy users in the particular web sites. The accuracy of prediction in a recommendation system is a main factor which is measured as quality of the system. The latest contribution in this area achieves about 50% for the accuracy of the recommendations. To provide online prediction effectively, this study has developed a Web based recommendation system to Predict User Movements, named as WebPUM, for online prediction through web usage mining system and proposed a novel approach for classifying user navigation patterns to predict users‘ future intentions. There are two main phases in WebPUM; offline phase and online phase. The approach in the offline phase is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining. In this phase, an undirected graph based on the Web pages as graph vertices and degree of connectivity between web pages as weight of the graph is created by proposing new formula for weight of the each edge in the graph. Moreover, navigation pattern mining has been done by finding connected components in the graph. In the online phase, the longest common subsequence algorithm is used as a new approach in recommendation system for classifying current user activities to predict user next movements. The longest common subsequence is a well-known string matching algorithm that we have utilized to find the most similar pattern between a set of navigation patterns and current user activities for creating the recommendations

WebPUM : a web-based recommendation system to predict user future movements.

Web usage mining has become the subject of exhaustive research, as its potential for Web-based personalized services, prediction of user near future intentions, adaptive Web sites, and customer profiling are recognized. Recently, a variety of recommendation systems to predict user future movements through Web usage mining have been proposed. However, the quality of recommendations in the current systems to predict user future requests in a particular Web site is below satisfaction. To effectively provide online prediction, we have developed a recommendation system called WebPUM, an action using Web usage mining system and propose a novel approach online prediction for classifying user navigation patterns to predict users’ future intentions. The approach is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining phase. Furthermore, longest common subsequence algorithm is used for classifying current user activities to predict user next movement. The proposed system has been tested on CTI and MSNBC datasets. The results show an improvement in the quality of recommendations. Furthermore, experiments on scalability prove that the size of dataset and the number of the users in dataset do not significantly contribute to the percentage of accuracy

An Adapted Approach for User Profiling in a Recommendation System: Application to Industrial Diagnosis

In this paper, we propose a global architecture of a recommender tool, which represents a part of an existing collaborative platform. This tool provides diagnostic documents for industrial operators. The recommendation process considered here is composed of three steps: Collecting and filtering information; Prediction or recommendation step; evaluating and improvement. In this work, we focus on collecting and filtering step. We mainly use information result from collaborative sessions and documents describing solutions that are attributed to the complex diagnostic problems. The developed tool is based on collaborative filtering that operates on users' preferences and similar responses

Explainable Active Learning for Preference Elicitation

Gaining insights into the preferences of new users and subsequently personalizing recommendations necessitate managing user interactions intelligently, namely, posing pertinent questions to elicit valuable information effectively. In this study, our focus is on a specific scenario of the cold-start problem, where the recommendation system lacks adequate user presence or access to other users' data is restricted, obstructing employing user profiling methods utilizing existing data in the system. We employ Active Learning (AL) to solve the addressed problem with the objective of maximizing information acquisition with minimal user effort. AL operates for selecting informative data from a large unlabeled set to inquire an oracle to label them and eventually updating a machine learning (ML) model. We operate AL in an integrated process of unsupervised, semi-supervised, and supervised ML within an explanatory preference elicitation process. It harvests user feedback (given for the system's explanations on the presented items) over informative samples to update an underlying ML model estimating user preferences. The designed user interaction facilitates personalizing the system by incorporating user feedback into the ML model and also enhances user trust by refining the system's explanations on recommendations. We implement the proposed preference elicitation methodology for food recommendation. We conducted human experiments to assess its efficacy in the short term and also experimented with several AL strategies over synthetic user profiles that we created for two food datasets, aiming for long-term performance analysis. The experimental results demonstrate the efficiency of the proposed preference elicitation with limited user-labeled data while also enhancing user trust through accurate explanations.Comment: Preprin

A Comparative Study of Collaborative Filtering in Product Recommendation

Product recommendation is considered a well-known technique for bringing customers and products together. With applications in music, electronic shops, or almost any platform the user daily deals with, the recommendation system’s sole scope is to help customers and attract new ones to discover new products. Through product recommendation, transaction costs can also be decreased, improving overall decision-making and quality. To perform recommendations, a recommendation system must utilize customer feedback, such as habits, interests, prior transactions as well as information used in customer profiling, and finally deliver suggestions. Hence, data is the key factor in choosing the appropriate recommendation method and drawing specific suggestions. This research investigates the data challenges of recommendation systems, specifying collaborative-based, content-based, and hybrid-based recommendations. In this context, collaborative filtering is being explored, with the Surprise library and LightFM embeddings being analysed and compared on top of foodservice transactional data. The involved algorithms’ metrics are being identified and parameterized, while hyperparameters are being tuned properly on top of this transactional data, concluding that LightFM provides more efficient recommendation results following the evaluation’s precision and recall outcomes. Nevertheless, even though the Surprise library outperforms, it should be used when constructing user-friendly models, requiring low code and low technicalities. Doi: 10.28991/ESJ-2023-07-01-01 Full Text: PD