Exploiting Geo-Social Correlations to Improve Pairwise Ranking for Point-of-Interest Recommendation

Recently, as location-based social network(LBSN) rapidly grow, point-of-interest(POI) recommendation has become an important way to help people locate interesting places. Nowadays, there have been deep studies conducted on the geographical and social influence in the point-of-interest recommendation model based on the rating prediction. The fact is, however, relying solely on the rating fails to reflect the user's preferences very accurately, because the users are most concerned with the list of ranked point-of-interests(POIs) on the actual output of recommender systems. In this paper, we propose a co-pairwise ranking model called Geo-Social Bayesian Personalized Ranking model(GSBPR), which is based on the pairwise ranking with the exploiting geo-social correlations by incorporating the method of ranking learning into the process of POI recommendation. In this model, we develop a novel BPR pairwise ranking assumption by injecting users' geo-social preference. Based on this assumption, the POI recommendation model is reformulated by a three-level joint pairwise ranking model. And the experimental results based on real datasets show that the proposed method in this paper enjoys better recommendation performance compared to other state-of-the-art POI recommendation models.

Point-of-Interest Recommendation in LocationBased Social Networks with Personalized Geo-Social Influence

Point-of-interest(POI) recommendation is a popular topic on location-based social networks(LBSNs).Geographical proximity,known as a unique feature of LBSNs,significantly affects user check-in behavior.However,most of prior studies characterize the geographical influence based on a universal or personalized distribution of geographic distance,leading to unsatisfactory recommendation results.In this paper,the personalized geographical influence in a two-dimensional geographical space is modeled using the data field method,and we propose a semi-supervised probabilistic model based on a factor graph model to integrate different factors such as the geographical influence.Moreover,a distributed learning algorithm is used to scale up our method to large-scale data sets.Experimental results based on the data sets from Foursquare and Gowalla show that our method outperforms other competing POI recommendation techniques.

Adaptive Successive POI Recommendation via Trajectory Sequences Processing and Long Short-Term Preference Learning

Point-of-interest(POI)recommendations in location-based social networks(LBSNs)have developed rapidly by incorporating feature information and deep learning methods.However,most studies have failed to accurately reflect different users’preferences,in particular,the short-term preferences of inactive users.To better learn user preferences,in this study,we propose a long-short-term-preference-based adaptive successive POI recommendation(LSTP-ASR)method by combining trajectory sequence processing,long short-term preference learning,and spatiotemporal context.First,the check-in trajectory sequences are adaptively divided into recent and historical sequences according to a dynamic time window.Subsequently,an adaptive filling strategy is used to expand the recent check-in sequences of users with inactive check-in behavior using those of similar active users.We further propose an adaptive learning model to accurately extract long short-term preferences of users to establish an efficient successive POI recommendation system.A spatiotemporal-context-based recurrent neural network and temporal-context-based long short-term memory network are used to model the users’recent and historical checkin trajectory sequences,respectively.Extensive experiments on the Foursquare and Gowalla datasets reveal that the proposed method outperforms several other baseline methods in terms of three evaluation metrics.More specifically,LSTP-ASR outperforms the previously best baseline method(RTPM)with a 17.15%and 20.62%average improvement on the Foursquare and Gowalla datasets in terms of the Fβmetric,respectively.

Exploring nonlinear spatiotemporal effects for personalized next point-of-interest recommendation

Next point-of-interest(POI)recommendation is an important personalized task in location-based social networks(LBSNs)and aims to recommend the next POI for users in a specific situation with historical check-in data.State-of-the-art studies linearly discretize the user’s spatiotemporal information and then use recurrent neural network(RNN)based models for modeling.However,these studies ignore the nonlinear effects of spatiotemporal information on user preferences and spatiotemporal correlations between user trajectories and candidate POIs.To address these limitations,a spatiotemporal trajectory(STT)model is proposed in this paper.We use the long short-term memory(LSTM)model with an attention mechanism as the basic framework and introduce the user’s spatiotemporal information into the model in encoding.In the process of encoding information,an exponential decay factor is applied to reflect the nonlinear drift of user interest over time and distance.In addition,we design a spatiotemporal matching module in the process of recalling the target to select the most relevant POI by measuring the relevance between the user’s current trajectory and the candidate set.We evaluate the performance of our STT model with four real-world datasets.Experimental results show that our model outperforms existing state-of-the-art methods.

A multilayer network diffusion-based model for reviewer recommendation

With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.

An Adaptive Program Recommendation System for Multi-User Sharing Environment

More and more accounts or devices are shared by multiple users in video applications,which makes it difficult to provide recommendation service.Existing recommendation schemes overlook multiuser sharing scenarios,and they cannot make effective use of the mixed information generated by multi-user when exploring users’potential interests.To solve these problems,this paper proposes an adaptive program recommendation system for multi-user sharing environment.Specifically,we first design an offline periodic identification module by building multi-user features and periodically predicting target user in future sessions,which can separate the profile of target user from mixed log records.Subsequently,an online recommendation module with adaptive timevarying exploration strategy is constructed by jointly using personal information and multi-user social information provided by identification module.On one hand,to learn the dynamic changes in user-interest,a time-varying linear upper confidence bound(LinUCB)based on personal information is designed.On the other hand,to reduce the risk of exploration,a timeinvariant LinUCB based on separated multi-user social information from one account/device is proposed to compute the quality scores of programs for each user,which is integrated into the time-varying LinUCB by cross-weighting strategy.Finally,experimental results validate the efficiency of the proposed scheme.

Improving Diversity with Multi-Loss Adversarial Training in Personalized News Recommendation

Users’interests are often diverse and multi-grained,with their underlying intents even more so.Effectively captur-ing users’interests and uncovering the relationships between diverse interests are key to news recommendation.Meanwhile,diversity is an important metric for evaluating news recommendation algorithms,as users tend to reject excessive homogeneous information in their recommendation lists.However,recommendation models themselves lack diversity awareness,making it challenging to achieve a good balance between the accuracy and diversity of news recommendations.In this paper,we propose a news recommendation algorithm that achieves good performance in both accuracy and diversity.Unlike most existing works that solely optimize accuracy or employ more features to meet diversity,the proposed algorithm leverages the diversity-aware capability of the model.First,we introduce an augmented user model to fully capture user intent and the behavioral guidance they might undergo as a result.Specifically,we focus on the relationship between the original clicked news and the augmented clicked news.Moreover,we propose an effective adversarial training method for diversity(AT4D),which is a pluggable component that can enhance both the accuracy and diversity of news recommendation results.Extensive experiments on real-world datasets confirm the efficacy of the proposed algorithm in improving both the accuracy and diversity of news recommendations.

Urban Traffic Control Meets Decision Recommendation System:A Survey and Perspective

Urban traffic control is a multifaceted and demanding task that necessitates extensive decision-making to ensure the safety and efficiency of urban transportation systems.Traditional approaches require traffic signal professionals to manually intervene on traffic control devices at the intersection level,utilizing their knowledge and expertise.However,this process is cumbersome,labor-intensive,and cannot be applied on a large network scale.Recent studies have begun to explore the applicability of recommendation system for urban traffic control,which offer increased control efficiency and scalability.Such a decision recommendation system is complex,with various interdependent components,but a systematic literature review has not yet been conducted.In this work,we present an up-to-date survey that elucidates all the detailed components of a recommendation system for urban traffic control,demonstrates the utility and efficacy of such a system in the real world using data and knowledgedriven approaches,and discusses the current challenges and potential future directions of this field.

Recommendation Method for Contrastive Enhancement of Neighborhood Information

Knowledge graph can assist in improving recommendation performance and is widely applied in various person-alized recommendation domains.However,existing knowledge-aware recommendation methods face challenges such as weak user-item interaction supervisory signals and noise in the knowledge graph.To tackle these issues,this paper proposes a neighbor information contrast-enhanced recommendation method by adding subtle noise to construct contrast views and employing contrastive learning to strengthen supervisory signals and reduce knowledge noise.Specifically,first,this paper adopts heterogeneous propagation and knowledge-aware attention networks to obtain multi-order neighbor embedding of users and items,mining the high-order neighbor informa-tion of users and items.Next,in the neighbor information,this paper introduces weak noise following a uniform distribution to construct neighbor contrast views,effectively reducing the time overhead of view construction.This paper then performs contrastive learning between neighbor views to promote the uniformity of view information,adjusting the neighbor structure,and achieving the goal of reducing the knowledge noise in the knowledge graph.Finally,this paper introduces multi-task learning to mitigate the problem of weak supervisory signals.To validate the effectiveness of our method,experiments are conducted on theMovieLens-1M,MovieLens-20M,Book-Crossing,and Last-FM datasets.The results showthat compared to the best baselines,our method shows significant improvements in AUC and F1.

Research on Collaborative Filtering Recommendation Algorithm Based on Improved User Portraits

With the arrival of the big data era,the phenomenon of information overload is becoming increasingly severe.In response to the common issue of sparse user rating matrices in recommendation systems,a collaborative filtering recommendation algorithm was proposed based on improved user profiles in this study.Firstly,a profile labeling system was constructed based on user characteristics.This study proposed that user profile labels should be created using basic user information and basic item information,in order to construct multidimensional user profiles.TF-IDF algorithm was used to determine the weights of user-item feature labels.Secondly,user similarity was calculated by weighting both profile-based collaborative filtering and user-based collaborative filtering algorithms,and the final user similarity was obtained by harmonizing these weights.Finally,personalized recommendations were generated using Top-N method.Validation with the MovieLens-1M dataset revealed that this algorithm enhances both recommendation Precision and Recall compared to single-method approaches(recommendation algorithm based on user portrait and user-based collaborative filtering algorithm).

The use of oral human immunodeficiency virus pre-exposure prophylaxis in pregnant and lactating women in sub-Saharan Africa:considerations,barriers,and recommendations

In sub-Saharan Africa(SSA),63%of new human immunodeficiency virus(HIV)infections in 2021 were among women,particularly adolescent girls,and young women.There is a high incidence of HIV among pregnant and lactating women(PLW)in SSA.It is estimated that the risk of HIV-acquisition during pregnancy and the postpartum period more than doubles.In this article,we discuss the safety and effectiveness of drugs used for oral HIV pre-exposure prophylaxis(PrEP),considerations for initiating PrEP in PLW,the barriers to initiating and adhering to PrEP among them and suggest recommendations to address these barriers.Tenofovir/emtricitabine,the most widely used combination in SSA,is safe,clinically effective,and cost-effective among PLW.Any PLW who requests PrEP and has no medical contraindications should receive it.PrEP users who are pregnant or lactating may experience barriers to starting and adhering for a variety of reasons,including personal,pill-related,and healthcare facility-related issues.To address the barriers,we recommend an increased provision of information on PrEP to the women and the communities,increasing and/or facilitating access to PrEP among the PLW,and developing strategies to increase adherence.

Recommendation System Based on Perceptron and Graph Convolution Network

The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction data.This paper presents a new approach to address such issues,utilizing the graph convolution network to extract association relations.The proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction layer.The embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation layer.The forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph convolution.Furthermore,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction layer.The score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,respectively.Finally,the prediction score of users to items is obtained.The recall rate and normalized discounted cumulative gain were used as evaluation indexes.The proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.

Diversified and compatible web APIs recommendation based on game theory in IoT

With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.

Combined CNN-LSTM Deep Learning Algorithms for Recognizing Human Physical Activities in Large and Distributed Manners:A Recommendation System

Recognizing human activity(HAR)from data in a smartphone sensor plays an important role in the field of health to prevent chronic diseases.Daily and weekly physical activities are recorded on the smartphone and tell the user whether he is moving well or not.Typically,smartphones and their associated sensing devices operate in distributed and unstable environments.Therefore,collecting their data and extracting useful information is a significant challenge.In this context,the aimof this paper is twofold:The first is to analyze human behavior based on the recognition of physical activities.Using the results of physical activity detection and classification,the second part aims to develop a health recommendation system to notify smartphone users about their healthy physical behavior related to their physical activities.This system is based on the calculation of calories burned by each user during physical activities.In this way,conclusions can be drawn about a person’s physical behavior by estimating the number of calories burned after evaluating data collected daily or even weekly following a series of physical workouts.To identify and classify human behavior our methodology is based on artificial intelligence models specifically deep learning techniques like Long Short-Term Memory(LSTM),stacked LSTM,and bidirectional LSTM.Since human activity data contains both spatial and temporal information,we proposed,in this paper,to use of an architecture allowing the extraction of the two types of information simultaneously.While Convolutional Neural Networks(CNN)has an architecture designed for spatial information,our idea is to combine CNN with LSTM to increase classification accuracy by taking into consideration the extraction of both spatial and temporal data.The results obtained achieved an accuracy of 96%.On the other side,the data learned by these algorithms is prone to error and uncertainty.To overcome this constraint and improve performance(96%),we proposed to use the fusion mechanisms.The last combines deep learning classifiers tomodel non-accurate and ambiguous data to obtain synthetic information to aid in decision-making.The Voting and Dempster-Shafer(DS)approaches are employed.The results showed that fused classifiers based on DS theory outperformed individual classifiers(96%)with the highest accuracy level of 98%.Also,the findings disclosed that participants engaging in physical activities are healthy,showcasing a disparity in the distribution of physical activities between men and women.

LKPNR: Large Language Models and Knowledge Graph for Personalized News Recommendation Framework

Accurately recommending candidate news to users is a basic challenge of personalized news recommendation systems.Traditional methods are usually difficult to learn and acquire complex semantic information in news texts,resulting in unsatisfactory recommendation results.Besides,these traditional methods are more friendly to active users with rich historical behaviors.However,they can not effectively solve the long tail problem of inactive users.To address these issues,this research presents a novel general framework that combines Large Language Models(LLM)and Knowledge Graphs(KG)into traditional methods.To learn the contextual information of news text,we use LLMs’powerful text understanding ability to generate news representations with rich semantic information,and then,the generated news representations are used to enhance the news encoding in traditional methods.In addition,multi-hops relationship of news entities is mined and the structural information of news is encoded using KG,thus alleviating the challenge of long-tail distribution.Experimental results demonstrate that compared with various traditional models,on evaluation indicators such as AUC,MRR,nDCG@5 and nDCG@10,the framework significantly improves the recommendation performance.The successful integration of LLM and KG in our framework has established a feasible way for achieving more accurate personalized news recommendation.Our code is available at https://github.com/Xuan-ZW/LKPNR.

Adaptive Music Recommendation: Applying Machine Learning Algorithms Using Low Computing Device

In the digital music landscape, the accuracy and response speed of music recommendation systems (MRS) are crucial for user experience optimization. Traditional MRS often relies on the use of high-performance servers for large-scale training to produce recommendation results, which may result in the inability to achieve music recommendation in some areas due to substandard hardware conditions. This study evaluates the adaptability of four popular machine learning algorithms (K-means clustering, fuzzy C-means (FCM) clustering, hierarchical clustering, and self-organizing map (SOM)) on low-computing servers. Our comparative analysis highlights that while K-means and FCM are robust in high-performance settings, they underperform in low-power scenarios where SOM excels, delivering fast and reliable recommendations with minimal computational overhead. This research addresses a gap in the literature by providing a detailed comparative analysis of MRS algorithms, offering practical insights for implementing adaptive MRS in technologically diverse environments. We conclude with strategic recommendations for emerging streaming services in resource-constrained settings, emphasizing the need for scalable solutions that balance cost and performance. This study advocates an adaptive selection of recommendation algorithms to manage operational costs effectively and accommodate growth.

Levels of evidence and grades of recommendation supporting European society for medical oncology clinical practice guidelines

Background:The European Society for Medical Oncology(ESMO)guidelines are among the most comprehensive and widely used clinical practice guidelines(CPGs)globally.However,the level of scientific evidence supporting ESMO CPG recommendations has not been systematically investigated.This study assessed ESMO CPG levels of evidence(LOE)and grades of recommendations(GOR),as well as their trends over time across various cancer settings.Methods:We manually extracted every recommendation with the Infectious Diseases Society of America(IDSA)classification from each CPG.We examined the distribution of LOE and GOR in all available ESMO CPG guidelines across different topics and cancer types.Results:Among the 1,823 recommendations in the current CPG,30%were classified as LOEⅠ,and 43%were classified as GOR A.Overall,there was a slight decrease in LOEⅠ(−2%)and an increase in the proportion of GOR A(+1%)in the current CPG compared to previous versions.The proportion of GOR A recommendations based on higher levels of evidence such as randomized trials(LOEⅠ–Ⅱ)shows a decrease(71%vs.63%,p=0.009)while recommendations based on lower levels of evidence(LOEⅢ–Ⅴ)show an increase(29%vs.37%,p=0.01)between previous and current version.In the current versions,the highest proportion of LOEⅠ(42%)was found in recommendations related to pharmacotherapy,while the highest proportion of GOR A recommendations was found in the areas of pathology(50%)and diagnostic(50%)recommendations.Significant variability in LOEⅠand GOR A recommendations and their changes over time was observed across different cancer types.Conclusion:One-third of the current ESMO CPG recommendations are supported by the highest level of evidence.More well-designed randomized clinical trials are needed to increase the proportion of LOEⅠand GOR A recommendations,ultimately leading to improved outcomes for cancer patients.

Enhancing personalized exercise recommendation with student and exercise portraits

The exercise recommendation system is emerging as a promising application in online learning scenarios,providing personalized recommendations to assist students with explicit learning directions.Existing solutions generally follow a collaborative filtering paradigm,while the implicit connections between students(exercises)have been largely ignored.In this study,we aim to propose an exercise recommendation paradigm that can reveal the latent connections between student-student(exercise-exercise).Specifically,a new framework was proposed,namely personalized exercise recommendation with student and exercise portraits(PERP).It consists of three sequential and interdependent modules:Collaborative student exercise graph(CSEG)construction,joint random walk,and recommendation list optimization.Technically,CSEG is created as a unified heterogeneous graph with students’response behaviors and student(exercise)relationships.Then,a joint random walk to take full advantage of the spectral properties of nearly uncoupled Markov chains is performed on CSEG,which allows for full exploration of both similar exercises that students have finished and connections between students(exercises)with similar portraits.Finally,we propose to optimize the recommendation list to obtain different exercise suggestions.After analyses of two public datasets,the results demonstrated that PERP can satisfy novelty,accuracy,and diversity.

Enhancing Multicriteria-Based Recommendations by Alleviating Scalability and Sparsity Issues Using Collaborative Denoising Autoencoder

A Recommender System(RS)is a crucial part of several firms,particularly those involved in e-commerce.In conventional RS,a user may only offer a single rating for an item-that is insufficient to perceive consumer preferences.Nowadays,businesses in industries like e-learning and tourism enable customers to rate a product using a variety of factors to comprehend customers’preferences.On the other hand,the collaborative filtering(CF)algorithm utilizing AutoEncoder(AE)is seen to be effective in identifying user-interested items.However,the cost of these computations increases nonlinearly as the number of items and users increases.To triumph over the issues,a novel expanded stacked autoencoder(ESAE)with Kernel Fuzzy C-Means Clustering(KFCM)technique is proposed with two phases.In the first phase of offline,the sparse multicriteria rating matrix is smoothened to a complete matrix by predicting the users’intact rating by the ESAE approach and users are clustered using the KFCM approach.In the next phase of online,the top-N recommendation prediction is made by the ESAE approach involving only the most similar user from multiple clusters.Hence the ESAE_KFCM model upgrades the prediction accuracy of 98.2%in Top-N recommendation with a minimized recommendation generation time.An experimental check on the Yahoo!Movies(YM)movie dataset and TripAdvisor(TA)travel dataset confirmed that the ESAE_KFCM model constantly outperforms conventional RS algorithms on a variety of assessment measures.

Weighted Forwarding in Graph Convolution Networks for Recommendation Information Systems

Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.