A fused method for news recommendation

Personalized news recommendation methods are widely used in online news services. These methods usually recommend news based on the matching between news content and user interest inferred from historical behaviors. However, these methods usually have difficulties in making accurate recommendations to cold-start users, and tend to recommend similar news with those users have read. In general, popular news usually contain important information and can attract users with different interests. Besides, they are usually diverse in content and topic. Thus, in this paper we propose to incorporate news popularity information to alleviate the cold-start and diversity problems for personalized news recommendation. In our method, the ranking score for recommending a candidate news to a target user is the combination of a personalized matching score and a news popularity score. The former is used to capture the personalized user interest in news. The latter is used to measure time-aware popularity of candidate news, which is predicted based on news content, recency, and real-time CTR using a unified framework. Besides, we propose a popularity-aware user encoder to eliminate the popularity bias in user behaviors for accurate interest modeling. Experiments on two real-world datasets show our method can effectively improve the accuracy and diversity for news recommendation.

Joint latent factors and attributes to discover interpretable preferences in recommendation

Personalized news recommendation is a critical technology to help users find interested news, and how to precisely match users' interests and candidate news lies in the core of news recommendation. Existing studies generally learn user's interest vector by aggregating his/her browsed news and then match it with the candidate news vector, which may lose the textual semantic matching signals for recommendation. In this paper, we propose an Attentive Multi-field Matching (AMM) framework for news recommendation which captures the semantic matching representations between each browsed news and candidate news, and then aggregates them as final user-news matching signal. In addition, our method incorporates multi-field information and designs a within-field and cross-field matching mechanism, which leverages complementary information from different fields (e.g., titles, abstracts and bodies) and obtain the multi-field matching representations. To achieve a comprehensive semantic understanding, we employ the most popular language model BERT to learn the matching representation of each browsed-candidate news pair, and incorporate the attention mechanism in aggregating procedure to characterize the importance of each matching representation for the final user-news matching signal. Experiments on the real world datasets validate the effectiveness of AMM.

A significant increase in news sources has been brought about by the growth of the online and the social web. The easy access to numerous news sources results in a flood of information that is frequently contradictory and confusing. When news circulates on the social web, it can be challenging to distinguish between legitimate and false reports. False news can be used for a variety of purposes, including as political influence, financial gain, and strict convictions to solve these problems, a new news aggregator was developed to help users distinguish between authentic, fake, and copy content. News from multiple news sources is reviewed, approved, and presented to the client in the suggested system. The news aggregator also suggests important news to the customer by anticipating consumer preference via a recommendation algorithm. It has been demonstrated that news recommendation systems can naturally handle lengthy articles and distinguish between them for readers who are taking into account established models.

Using complex language models has been a common strategy as personalized news recommendation systems are adopted by online news sites more and more. Before the epoch of GPT-3, news recommendation systems underwent a progression from rule-based and collaborative filtering approaches in the pre-2010s, through the integration of neural networks in the 2010s, to the emergence of earlier iterations of large language models like GPT-2 in 2019. Pre-trained language models have ushered in a new era of recommendation paradigms, thanks to the emergence of huge language models like GPT-3 and T-5. With its easy-to-use interface, ChatGPT is becoming more and more popular for text-based jobs. Focusing on news provider fairness, individualized news recommendations, and fake news identification, this study starts an inquiry into ChatGPT's efficacy in news recommendations. We acknowledge that ChatGPT's output sensitivity to input phrasing is a limitation, and our goal is to investigate these limitations from each angle. We also investigate whether certain prompt formats can help to alleviate these constraints or if more research is needed. To go beyond set assessments, we create a webpage where ChatGPT's performance on the examined activities and prompts is tracked once a week. Through the use of big language models, this work seeks to improve news recommendation performance and stimulate more research in this area.

In recent years, the type and quantity of news are growing rapidly, and it is not easy for users to find the news they are interested in the massive amount of news. A news recommendation system can score and predict the candidate news, and finally recommend the news with high scores to users. However, existing user models usually only consider users’ long-term interests and ignore users’ recent interests, which affects users’ usage experience. Therefore, this paper introduces gated recurrent unit (GRU) sequence network to capture users’ short-term interests and combines users’ short-term interests and long-term interests to characterize users. While existing models often only use the user’s browsing history and ignore the variability of different users’ interest in the same news, we introduce additional user’s ID information and apply the personalized attention mechanism for user representation. Thus, we achieve a more accurate user representation. We also consider the risk of compromising user privacy if the user model training is placed on the server side. To solve this problem, we design the training of the user model locally on the client side by introducing a federated learning framework to keep the user’s browsing history on the client side. We further employ secure multi-party computation to request news representations from the server side, which protects privacy to some extent. Extensive experiments on a real-world news dataset show that our proposed news recommendation model has a better improvement in several performance evaluation metrics. Compared with the current state-of-the-art federated news recommendation models, our model has increased by 0.54% in AUC, 1.97% in MRR, 2.59% in nDCG@5%, and 1.89% in nDCG@10. At the same time, because we use a federated learning framework, compared with other centralized news recommendation methods, we achieve privacy protection for users.

Recent rises in political polarization across the globe are often ascribed to algorithmic content filtering on social media, news platforms, or search engines. The widespread usage of news recommendation systems (NRS) is theorized to drive users in homogenous information environments and, thereby, drive affective, ideological, and perceived polarization. To test this assumption, we conducted an online experiment ( n = 750) with running algorithms that enriches content-based NRS with negative or neutral sentiment. Our experiment finds only limited evidence for polarization effects of content-based NRS. Nevertheless, the time spent with an NRS and its recommended articles seems to play a crucial role as a moderator of polarization. The longer participants were using an NRS enriched with negative sentiment, the more they got affectively polarized, whereas participants using an NRS incorporating balanced sentiment ideologically depolarized over time. Implications for future research are discussed.

Collaborating Filtering (CF) is a recommendation method that can make predictions about a given user's interest by collecting a large number of other user' appreciation. Some of the major problems encountered in the use of CF are the cold-start problem and the fact that personalized recommendations cannot be done. In turn, CF-based recommendations produces ranked results where the success rate can be improved. The method proposed in this research is a hybrid recommender system that utilizes Case-Based Reasoning (CBR) in order to overcome these shortcomings and improve the success rate of the recommender system. To show the usability of the proposed hybrid recommender method, we have used a music recommendation dataset and build music listening assistant that uses the implementation of the method. The performance of the proposed method was evaluated and results are reported. The results indicate that our proposed method is successful.

Now that we have so much information available, recommender systems are becoming more and more important in many different areas. Traditional methods are very popular because they work well, but they have problems with the cold-start problem and data sparsity. Large language models (LLMs) are a new breakthrough for recommender systems because they can understand and generate text in natural language. This study suggests a better recommendation method that uses both collaborative filtering and LLMs. This method combines the strengths of both methods, using collaborative filtering to model user preferences and LLMs to improve understanding of user and item information. This improves the accuracy and variety of recommendations. In this paper, we start by explaining the basic ideas behind collaborative filtering and LLMs. Then, we design a recommendation system that combines the two and test how well it works. The results show that the hybrid model based on collaborative filtering and LLM significantly improves accuracy, recall and user satisfaction, demonstrating its potential in complex recommendation scenarios.

In recent years, E-commerce had made a tremendous impact on the world. However before the emergence of E-commerce, individuals can't skim the information about the products within short time of the period, so therefore recommendation system was introduced. The principle point of the recommendation system is to prescribe the most appropriate items to the user. Many of the recommendation systems mainly use content based method, collaborative filtering method, demographic based method and hybrid method. In this paper, the major challenges such as "data sparsity" and "cold start problem" are addressed. To overcome these challenges, we propose a new methodology by combining the clustering algorithm with Eclat Algorithm for better rules generation. Firstly we cluster the rating matrix based on the user similarity. Then we convert the clustered data into Boolean data and applying Eclat Algorithm on Boolean data efficient rules generation takes place. At last based on rules generation recommendation takes place. Our experiments shows that approach not only decrease the sparsity level but also increase the accuracy of a system.

Collaborative filtering (CF), the most successful and widely used technique, recommends items based on the preferences of similar users. The main potentials of CF are its cross-genre recommendation ability, and that it is completely independent of representation of the items being recommended. However, CF suffers from sparsity and cold start problems. On the other hand, a highly effective variant of content-based filtering (CBF), reclusive methods (RMs) based on the preference of the single individual for whom recommendations to be made, provides a methodology that considers uncertainty and the multivalued nature of item features as well as user preferences in a content-based framework using fuzzy logic approaches. The adoption of RM paradigm has several advantages when compared to CF such as sparsity and new item problem, but it suffers from overspecialization and limited content analysis. In view of the complementary nature of CF and RM, we develop a hybrid recommender system (RS) that helps in alleviating aforementioned problems in each approach. First, we propose fuzzy naïve Bayesian classifier based CF (FNB-CF) and RM (FNB-RM) for handling correlation-based similarity problems. To overcome individual weaknesses of FNB-CF and FNB-RM, we develop a hybrid RS, FNB-CF-RM. Effectiveness of our proposed hybrid RS is demonstrated through experimental results using the MovieLens and IMDb data sets.

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.

An explicit trust and distrust clustering based collaborative filtering recommendation approach

With the continuous development of information technology, we are now in an era of information explosion, and we are also facing the problem of information overload, i.e., it is difficult to find the news that interests us from the huge news sources on the Internet. Based on this problem, this paper proposes a perceptron model-based news recommendation system, which uses the perceptron model to extract news keywords and realize the classification of the news; for user interest preferences, we analyze users’ news browsing preferences by collecting user behavior logs and use a multi-layer perceptron model to aggregate users’ interest features. The perceptron model is compared with traditional recommendation methods in terms of accuracy and recall, and one user is selected from 50 users who have been using the system for three months to analyze their news browsing preferences by single-day, short-term and long-term news data to verify the effectiveness of the perceptron model in aggregating users’ interest features. In terms of accuracy and recall, the accuracy of the perceptron model is higher than that of the traditional method for each news type, improving the accuracy by at least 5%-10%, e.g., 10% for real estate news and 9% for financial news. The recall rate of the perceptron model is improved by more than 6% for all news types except for social and entertainment news types. In terms of user interest preference mining, the whole change process of user browsing preference trend is in line with the human forgetting curve, which verifies that the perceptron model in the system is better used and meets the design requirements. Therefore, the applicability and reliability of the model proposed in this paper for news recommendation systems are verified in terms of accuracy, recall, and user interest preference mining.

How do users interact with algorithm recommender systems? The interaction of users, algorithms, and performance