ДОПОВНЕННЯ ВХІДНИХ ДАНИХ РЕКОМЕНДАЦІЙНОЇ СИСТЕМИ В СИТУАЦІЇ ЦИКЛІЧНОГО ХОЛОДНОГО СТАРТУ З ВИКОРИСТАННЯМ ТЕМПОРАЛЬНИХ ОБМЕЖЕНЬ ТИПУ «NEXT»

In this work, we present a proactive content based recommender system that employs web document clustering performed by using eye gaze data. Generally, recommender systems are used in commercial applications, where information about the user's habits and interests are of crucial importance in order to plan marketing strategies, or in information retrieval systems in order to suggest similar resources a user is interested in. Commonly, these systems use explicit relevance feedback techniques (e.g. mouse or keyboard) to improve their performance and to recommend products. In contrast, the proposed system permits to capture user's interest by using implicit relevance feedback, based on data acquired by an eye tracker Tobii T60. The purpose of the system is to collect eye gaze data during web navigation and, by employing clustering techniques, to suggest web documents similar to those that the user, implicitly, expressed greater interest. Performance evaluation was carried out on 30 users and the results show that the proposed system enhanced navigation experience in about 73% of the cases.

Click-through rate (CTR) prediction plays a critical role in recommender systems and other applications. Recently, modeling user behavior sequences attracts much attention and brings great improvements in the CTR field. Many existing works utilize attention mechanism or recurrent neural networks to exploit user interest from the sequence, but fail to recognize the simple truth that a user's real-time interests are inherently diverse and fluid. In this paper, we propose DisenCTR, a novel dynamic graph-based disentangled representation framework for CTR prediction. The key novelty of our method compared with existing approaches is to model evolving diverse interests of users. Specifically, we construct a time-evolving user-item interaction graph induced by historical interactions. And based on the rich dynamics supplied by the graph, we propose a disentangled graph representation module to extract diverse user interests. We further exploit the fluidity of user interests and model the temporal effect of historical behaviors using Mixture of Hawkes Process. Extensive experiments on three real-world datasets demonstrate the superior performance of our method comparing to state-of-the-art approaches.

Nowadays, virtual learning environments have become widespread to avoid time and space constraints and share high-quality learning resources. As a result of human–computer interaction, student behaviors are recorded instantly. This work aims to design an educational recommendation system according to the individual's interests in educational resources. This system is evaluated based on clicking or downloading the source with the help of the user so that the appropriate resources can be suggested to users. In online tutorials, in addition to the problem of choosing the right source, we face the challenge of being aware of diversity in users' preferences and tastes, especially their short-term interests in the near future, at the beginning of a session. We assume that the user's interests consist of two parts: (1) the user's long-term interests, which include the user's constant interests based on the history of the user's dynamic activities, and (2) the user's short-term interests, which indicate the user's current interests. Due to the use of Bilstm networks and their gradual learning feature, the proposed model supports learners' behavioral changes. An average accuracy of 0.9978 and a Loss of 0.0051 offer more appropriate recommendations than similar works.

Recommender systems play an important role in most modern e-commerce applications. They have allowed users to become aware of the myriad choices available to them. The ease of information and the abundance of options have helped users make educated decisions. A recommender system studies a user's preferences and continues learning the user's changing interests, so as to suggest items that incline with the user's interests. In cases where a user is new to the application, or the user prefers not to discourse preferences, the recommender system is unable to gather the user's preference on any item. This is called the cold start problem; wherein the system can make valid recommendations only once the user starts informing the system about his/her choices. In this paper, we discuss the challenges faced by the cold start problem and how this problem may be alleviated using social media. We suggest an approach where we collect public information from users' social media accounts and analyze this information to understand their preferences. In particular, we gather the new user's information using their Twitter profile; i.e., the user's interest and preferences are extracted from his/her Twitter profile by analyzing his/her tweets. These interests will help the system understand what kind of movies the user will be most interested in. We compare these preferences with the metadata about the individual items. Using this approach, we develop a movie recommendation system wherein we produce top-N movie recommendations for a user. We used the MovieTweetings dataset to model the application. Two sets of results have been produced. In the first, smaller set of 770 users, 72.67% of users have received 100% accurate movie recommendations while nearly 80% of users got more than 75% accuracy. For the second, larger set of more than 3,500 users, 53 % of users have received 100% accurate recommendations while 72% of users got more than 75% accuracy. These encouraging results have demonstrated that the approach is effectively in alleviating cold start problems in recommendation systems, and may be applicable to many other e-commerce applications.

Social trust model for rating prediction in recommender systems: Effects of similarity, centrality, and social ties

E-commerce Recommender Systems suggest useful and interesting products to customers in order to increase user satisfaction and online conversion rates. They typically exploit explicit or implicit user feedback such as ratings, buying records or clickstream data and apply statistical methods to derive recommendations. Collaborative filtering is one of the most widely used approaches in recommender systems. However, the traditional collaborative filtering methods compute users’ similarities in the dimension of products, and they do not take the influence of neighbor users into consideration when computing such similarities. This paper focuses on explicitly formulated user requirements as the sole type of user feedback. The new collaborative filtering method based on user interests’ transmission. This method computes customers’ similarities in the dimension of interests, and takes the interests transmission between different customers into reflection. This method not only can cope with cold start problem and data sparse problem, but also have prediction precision.

Session-based recommendation aims to predict the next item that is most likely to be clicked by an anonymous user, based on his/her clicking sequence within one visit. It becomes an essential function of many recommender systems since it protects privacy. However, as the accumulated session records keep increasing, it becomes challenging to model the user interests since they would drift when the time span is large. Efforts have been devoted to handling dynamic user interests by modeling all historical sessions at one time or conducting offline retraining regularly. These solutions are far from practical requirements in terms of efficiency and capturing timely user interests. To this end, we propose a memory-efficient framework - TASRec. It constructs a graph for each day to model the relations among items. Thus, the same item on different days could have different neighbors, corresponding to the drifting user interests. We design a tailored graph neural network to embed this dynamic graph of items and learn temporal augmented item representations. Based on this, we leverage a sequential neural architecture to predict the next item of a given sequence. Experiments on real-world datasets demonstrate that TASRec outperforms state-of-the-art session-based recommendation methods.

In the era of digitization, online digital advertising is one of the best techniques for modern marketing. This makes advertisers rely heavily on accurate user interest and behavior modelling to deliver precise advertisement impressions and increase click-through rates. The classic approach to model user interests has often required the use of predefined feature sets which are typically stagnant and not representative of temporal changes and trends in user behavior. While recent advances in deep learning offer potential solutions to these obstacles, many existing approaches fail to address the sequential nature of user interactions. In this paper, we propose an optimized Bi-Directional Long Short-Term Memory (Bi-LSTM) based user interest modeling approach together with an Updated version of Parrot Optimizer (UPO) to enhance performance. It treats the user activity as a temporal sequence which well fits the changing nature of user interest and preferences over time. The proposed approach is evaluated on two important tasks: predicting the probability that a user will click on an ad and predicting the probability that a user will click on a particular type of ad campaign. Simulation results demonstrate that the proposed method provides superior results than the static set-based approaches and achieves significant improvements on both user ad responses predictions and user ad clicks at the campaign level. The research also enhances the efficiency of user interest modeling with significant implications for online advertising, recommendation systems, and personalized marketing.

Current short video recommendation systems face challenges in accurately identifying user interests due to large-scale, heterogeneous user data, as well as addressing cold-start problems when encountering new users and content. This study proposes a deep learning and reinforcement learning (DLRL) framework to enhance recommendation performance. User and video data are collected and preprocessed using the Hadoop platform, while automated metadata extraction tools, optical character recognition (OCR), and audio-to-text technologies extract multimodal features, including subtitles and audio content. A convolutional neural network (CNN) extracts semantic and visual features from text-image data, while a long short-term memory (LSTM) network captures temporal dependencies in user behavior to detect interest changes. A multimodal attention mechanism integrates these diverse features to form comprehensive user portraits, and a deep neural network (DNN) reduces feature dimensionality to represent user preferences accurately. The recommendation process is formulated as a reinforcement learning task optimized through Deep Q Network (DQN) and Proximal Policy Optimization (PPO) algorithms. Experimental results demonstrate that the proposed approach achieves superior click-through rates (6.22%), viewing duration (73.31 s), accuracy (0.877), and recall (0.858), effectively overcoming cold-start limitations and dynamically adapting to evolving user interests. This shows that combining DLRL can optimize the performance of short video recommendations, improve accuracy and experience, and address the issues of cold start and capturing changes in user interests.

Recommender systems have become increasingly accurate in suggesting content to users, resulting in users primarily consuming content through recommendations. This can cause the user's interest to narrow toward the recommended content, something we refer to as preference amplification. While this can contribute to increased engagement, it can also lead to negative experiences such as lack of diversity and echo chambers. We propose a theoretical framework for studying such amplification in a matrix factorization based recommender system. We model the dynamics of the system, where users interact with the recommender systems and gradually drift'' toward the recommended content, with the recommender system adapting, based on user feedback, to the updated preferences. We study the conditions under which preference amplification manifests, and validate our results with simulations. Finally, we evaluate mitigation strategies that prevent the adverse effects of preference amplification and present experimental results using a real-world large-scale video recommender system showing that by reducing exposure to potentially objectionable content we can increase user engagement by up to 2%.

Target tracking is a hot topic in the field of computer vision. It uses the context information of video or image sequence to model the appearance and motion information of the target, so as to predict the motion state of the target and calibrate the position of the target. From the perspective of building models, target tracking algorithms can be divided into generative models and discriminant models; From the number of tracking targets, it can be divided into single target tracking and multi-target tracking. Target tracking integrates the theories and algorithms of image processing, machine learning, optimization and other fields. It is the premise and foundation to complete higher-level image understanding.The basic task of target tracking is to give the initial position of the target in a video sequence and continuously track and locate the target in each subsequent frame. In this process, a priori conditions such as the color, shape and size of the target will not be provided, that is, the tracking algorithm can track only by learning the target in the first frame. The traditional solution is to calculate the project similarity offline and save it in the system for algorithm call, but it can not make full use of the latest scoring data to reflect the change of user interest. To solve the above problems, a target tracking item similarity incremental update mechanism suitable for online applications is proposed, so that the recommendation system can update the similarity data between the corresponding item and other items in real time after the current user submits the item score, so that the recommendation system can recommend based on the latest item similarity data, To adapt to changes in user interests.

The rapid development of Internet and mobile communication, smart phone, tablet computer and other mobile devices become widespread, they have become an indispensable part of life, changing the human lifestyle, way of working and learning style, it brings great convenience and fun to us. This paper mainly discusses the status of personalized recommendation system, mobile application and analyse the main problems of recommendation system. This research proposes a rising mobile application domain, which uses web crawling technique to get explicit feedback from a real-world mobile application market. The explicit feedback is the users’ ratings data on Apps and the corresponding category information. To establish a mobile application recommendation model based on user interest and categorization information and propose a novel collective matrix factorization algorithm. Through the crawled data, the improved algorithm, and the traditional collaborative. The traditional mobile application recommendation systems are mostly based on keyword search, popularity, download usage and categories, thus they do not make personalized recommendation to users, and invalid to find applications that users are interested in. Through the user’s historical behaviour, a personalized recommendation system can be established to recommend the applications that fit user’s interests effectively. This paper is based on the collective matrix factorization using user interest such as user’s ratings and category information, designs a personalized recommendation system for mobile applications by using the relationship between them.

Over the past decade, internet usage has grown rapidly, creating opportunities for various online businesses to expand. One of the most significant areas of growth is e-commerce. As more people shop online, recommendation systems have become essential. These systems personalize the user experience, help customers find products quickly, and boost sales for businesses. However, building an effective recommendation system comes with challenges, especially when handling large amounts of data. A recommendation system suggests products to users based on their interests. It identifies the right items by analyzing past purchases, browsing history, and product details. Many recommendation systems generate long lists of suggested items, ranking them based on predicted user preferences. Recommendations can be based on factors like price, location, wish-listed items, cart history, search history, and past purchases. A well-designed recommendation system improves customer satisfaction, increases sales, and enhances user engagement. This research will develop to create a recommendation system for both new and existing users. It will use Neighborhood-Based Collaborative Filtering to suggest products based on user ratings and past purchases. Additionally, the system will remove duplicate ratings to provide more accurate and relevant recommendations based on user interests.

In today's information-rich environment, recommendation systems play a pivotal role in helping users efficiently navigate vast amounts of data, with applications spanning online platforms, e-commerce, streaming services, and digital advertising. Among various algorithms, Thompson Sampling (TS) stands out for its ability to balance exploring new options with leveraging known preferences, thereby preventing recommendation stagnation and adapting to shifts in user interests. This paper investigates TS within the context of advertising and movie recommendations, exploring its Bayesian probabilistic foundation, uncertainty modeling, practical integration within recommendation architectures, handling of large-scale data streams, and real-time feedback mechanisms. Performance is evaluated through metrics including accuracy, user engagement, click-through rates, and conversion rates, with comparisons against ETC and UCB algorithms. Results demonstrate that TS enhances recommendation accuracy, user satisfaction, and system revenue, establishing its position as a valuable and versatile tool for improving modern recommendation systems. Furthermore, the study provides insights into practical deployment strategies for real-world applications.

Traveling to other locations for pleasure, business, or other reasons is called tourism. In every sort of recommender system, there are a certain amount of users and items. Creating a recommendation systems is made more difficult by the abundance of information available online and the high volume of website visits. A recommender system pulls the user's preferences or interests from relevant data sets to reduce information overload. This calls for the development of a new recommended system that will deliver higher-quality recommendations for massive data sets. To solve these kinds of problems, we have found several approaches for making recommendations, including three different types: content-based filtering, collaborative filtering, and hybrid filtering. With each type of recommender system, this research also analyses several algorithms. The main aim of this paper is to review several trends and techniques currently being used in tourist recommender systems.