A Framework of Mobile Context-Aware Recommender System

Mobile users can be recommended services or goods precisely according to their actual needs even in different contexts. Therefore, it is necessary to construct a framework integrating following functions: context identification,context reasoning, services or product recommendations and other tasks for the mobile terminal. In this paper, we firstly introduce mobile context awareness theory, and describe the composition of context-aware mobile systems. Secondly, we construct a framework of mobile context-aware recommendation system in line with the characteristics of mobile terminal devices and mobile context-aware data. Then, we build a nested key-value storage model and an up-to-date algorithm for mining mobile context-aware sequential pattern,in order to find both the user’s long-term behavior pattern and the new trend of his recent behavior, to predict user’s next behavior. Lastly, we discuss the difficulties and future development trend of mobile context-aware recommendation system.

A Deep Learning Based Approach for Context-Aware Multi-Criteria Recommender Systems

Recommender systems are similar to an informationfiltering system that helps identify items that best satisfy the users’demands based on their pre-ference profiles.Context-aware recommender systems(CARSs)and multi-criteria recommender systems(MCRSs)are extensions of traditional recommender sys-tems.CARSs have integrated additional contextual information such as time,place,and so on for providing better recommendations.However,the majority of CARSs use ratings as a unique criterion for building communities.Meanwhile,MCRSs utilize user preferences in multiple criteria to better generate recommen-dations.Up to now,how to exploit context in MCRSs is still an open issue.This paper proposes a novel approach,which relies on deep learning for context-aware multi-criteria recommender systems.We apply deep neural network(DNN)mod-els to predict the context-aware multi-criteria ratings and learn the aggregation function.We conduct experiments to evaluate the effect of this approach on the real-world dataset.A significant result is that our method outperforms other state-of-the-art methods for recommendation effectiveness.

Improving Recommendation for Effective Personalization in Context-Aware Data Using Novel Neural Network

The digital technologies that run based on users’content provide a platform for users to help air their opinions on various aspects of a particular subject or product.The recommendation agents play a crucial role in personalizing the needs of individual users.Therefore,it is essential to improve the user experience.The recommender system focuses on recommending a set of items to a user to help the decision-making process and is prevalent across e-commerce and media websites.In Context-Aware Recommender Systems(CARS),several influential and contextual variables are identified to provide an effective recommendation.A substantial trade-off is applied in context to achieve the proper accuracy and coverage required for a collaborative recommendation.The CARS will generate more recommendations utilizing adapting them to a certain contextual situation of users.However,the key issue is how contextual information is used to create good and intelligent recommender systems.This paper proposes an Artificial Neural Network(ANN)to achieve contextual recommendations based on usergenerated reviews.The ability of ANNs to learn events and make decisions based on similar events makes it effective for personalized recommendations in CARS.Thus,the most appropriate contexts in which a user should choose an item or service are achieved.This work converts every label set into a Multi-Label Classification(MLC)problem to enhance recommendations.Experimental results show that the proposed ANN performs better in the Binary Relevance(BR)Instance-Based Classifier,the BR Decision Tree,and the Multi-label SVM for Trip Advisor and LDOS-CoMoDa Dataset.Furthermore,the accuracy of the proposed ANN achieves better results by 1.1%to 6.1%compared to other existing methods.

Graph convolution machine for context-aware recommender system

The latest advance in recommendation shows that better user and item representations can be learned via performing graph convolutions on the user-item interaction graph.However,such finding is mostly restricted to the collaborative filtering(CF)scenario,where the interaction contexts are not available.In this work,we extend the advantages of graph convolutions to context-aware recommender system(CARS,which represents a generic type of models that can handle various side information).We propose Graph Convolution Machine(GCM),an end-to-end framework that consists of three components:an encoder,graph convolution(GC)layers,and a decoder.The encoder projects users,items,and contexts into embedding vectors,which are passed to the GC layers that refine user and item embeddings with context-aware graph convolutions on the user-item graph.The decoder digests the refined embeddings to output the prediction score by considering the interactions among user,item,and context embeddings.We conduct experiments on three real-world datasets from Yelp and Amazon,validating the effectiveness of GCM and the benefits of performing graph convolutions for CARS.

Joint Modeling of Citation Networks and User Preferences for Academic Tagging Recommender System

In the tag recommendation task on academic platforms,existing methods disregard users’customized preferences in favor of extracting tags based just on the content of the articles.Besides,it uses co-occurrence techniques and tries to combine nodes’textual content for modelling.They still do not,however,directly simulate many interactions in network learning.In order to address these issues,we present a novel system that more thoroughly integrates user preferences and citation networks into article labelling recommendations.Specifically,we first employ path similarity to quantify the degree of similarity between user labelling preferences and articles in the citation network.Then,the Commuting Matrix for massive node pair paths is used to improve computational performance.Finally,the two commonalities mentioned above are combined with the interaction paper labels based on the additivity of Poisson distribution.In addition,we also consider solving the model’s parameters by applying variational inference.Experimental results demonstrate that our suggested framework agrees and significantly outperforms the state-of-the-art baseline on two real datasets by efficiently merging the three relational data.Based on the Area Under Curve(AUC)and Mean Average Precision(MAP)analysis,the performance of the suggested task is evaluated,and it is demonstrated to have a greater solving efficiency than current techniques.

Context-Aware Practice Problem Recommendation Using Learners’ Skill Level Navigation Patterns

The use of programming online judges(POJs)has risen dramatically in recent years,owing to the fact that the auto-evaluation of codes during practice motivates students to learn programming.Since POJs have greater number of pro-gramming problems in their repository,learners experience information overload.Recommender systems are a common solution to information overload.Current recommender systems used in e-learning platforms are inadequate for POJ since recommendations should consider learners’current context,like learning goals and current skill level(topic knowledge and difficulty level).To overcome the issue,we propose a context-aware practice problem recommender system based on learners’skill level navigation patterns.Our system initially performs skill level navigation pattern mining to discover frequent skill level navigations in the POJ and tofind learners’learning goals.Collaborativefiltering(CF)and con-tent-basedfiltering approaches are employed to recommend problems in the cur-rent and next skill levels based on frequent skill level navigation patterns.The sequence similarity measure is used tofind the top k neighbors based on the sequence of problems solved by the learners.The experiment results based on the real-world POJ dataset show that our approach considering the learners’cur-rent skill level and learning goals outperforms the other approaches in practice problem recommender systems.

Intelligent Recommendation and Matching Method for Agricultural Knowledge Based on Context-Aware Models

The personalized recommendation of the cloud platform for agricultural knowledge and agricultural intelligent service is one of the core technologies for the development of smart agriculture.Revealing the implicit laws and dynamic characteristics of agricultural knowledge demand is a key problem to be solved urgently.In order to enhance the matching ability of knowledge recommendation and service in human-computer interaction of cloud platform,the mechanism of agricultural knowledge intelligent recommendation service integrated with context-aware model was analyzed.By combining context data acquisition,data analysis and matching,and personalized knowledge recommendation,a framework for agricultural knowledge recommendation service is constructed to improve the ability to extract multidimensional information features and predict sequence data.Using the cloud platform for agricultural knowledge and agricultural intelligent service,this research aims to deliver interesting video service content to users in order to solve key problems faced by farmers,including planting technology,disease control,expert advice,etc.Then the knowledge needs of different users can be met and user satisfaction can be improved.

A Conceptual and Computational Framework for Aspect-Based Collaborative Filtering Recommender Systems

Many datasets in E-commerce have rich information about items and users who purchase or rate them. This information can enable advanced machine learning algorithms to extract and assign user sentiments to various aspects of the items thus leading to more sophisticated and justifiable recommendations. However, most Collaborative Filtering (CF) techniques rely mainly on the overall preferences of users toward items only. And there is lack of conceptual and computational framework that enables an understandable aspect-based AI approach to recommending items to users. In this paper, we propose concepts and computational tools that can sharpen the logic of recommendations and that rely on users’ sentiments along various aspects of items. These concepts include: The sentiment of a user towards a specific aspect of a specific item, the emphasis that a given user places on a specific aspect in general, the popularity and controversy of an aspect among groups of users, clusters of users emphasizing a given aspect, clusters of items that are popular among a group of users and so forth. The framework introduced in this study is developed in terms of user emphasis, aspect popularity, aspect controversy, and users and items similarity. Towards this end, we introduce the Aspect-Based Collaborative Filtering Toolbox (ABCFT), where the tools are all developed based on the three-index sentiment tensor with the indices being the user, item, and aspect. The toolbox computes solutions to the questions alluded to above. We illustrate the methodology using a hotel review dataset having around 6000 users, 400 hotels and 6 aspects.

FedRec:Trusted rank-based recommender scheme for service provisioning in federated cloud environment

The emergence of on-demand service provisioning by Federated Cloud Providers(FCPs)to Cloud Users(CU)has fuelled significant innovations in cloud provisioning models.Owing to the massive traffic,massive CU resource requests are sent to FCPs,and appropriate service recommendations are sent by FCPs.Currently,the FourthGeneration(4G)-Long Term Evolution(LTE)network faces bottlenecks that affect end-user throughput and latency.Moreover,the data is exchanged among heterogeneous stakeholders,and thus trust is a prime concern.To address these limitations,the paper proposes a Blockchain(BC)-leveraged rank-based recommender scheme,FedRec,to expedite secure and trusted Cloud Service Provisioning(CSP)to the CU through the FCP at the backdrop of base 5G communication service.The scheme operates in three phases.In the first phase,a BCintegrated request-response broker model is formulated between the CU,Cloud Brokers(BR),and the FCP,where a CU service request is forwarded through the BR to different FCPs.For service requests,Anything-as-aService(XaaS)is supported by 5G-enhanced Mobile Broadband(eMBB)service.In the next phase,a weighted matching recommender model is proposed at the FCP sites based on a novel Ranking-Based Recommender(RBR)model based on the CU requests.In the final phase,based on the matching recommendations between the CU and the FCP,Smart Contracts(SC)are executed,and resource provisioning data is stored in the Interplanetary File Systems(IPFS)that expedite the block validations.The proposed scheme FedRec is compared in terms of SC evaluation and formal verification.In simulation,FedRec achieves a reduction of 27.55%in chain storage and a transaction throughput of 43.5074 Mbps at 150 blocks.For the IPFS,we have achieved a bandwidth improvement of 17.91%.In the RBR models,the maximum obtained hit ratio is 0.9314 at 200 million CU requests,showing an improvement of 1.2%in average servicing latency over non-RBR models and a maximization trade-off of QoE index of 2.7688 at the flow request 1.088 and at granted service price of USD 1.559 million to FCP for provided services.The obtained results indicate the viability of the proposed scheme against traditional approaches.

Relevant Visual Semantic Context-Aware Attention-Based Dialog

The existing dataset for visual dialog comprises multiple rounds of questions and a diverse range of image contents.However,it faces challenges in overcoming visual semantic limitations,particularly in obtaining sufficient context from visual and textual aspects of images.This paper proposes a new visual dialog dataset called Diverse History-Dialog(DS-Dialog)to address the visual semantic limitations faced by the existing dataset.DS-Dialog groups relevant histories based on their respective Microsoft Common Objects in Context(MSCOCO)image categories and consolidates them for each image.Specifically,each MSCOCO image category consists of top relevant histories extracted based on their semantic relationships between the original image caption and historical context.These relevant histories are consolidated for each image,and DS-Dialog enhances the current dataset by adding new context-aware relevant history to provide more visual semantic context for each image.The new dataset is generated through several stages,including image semantic feature extraction,keyphrase extraction,relevant question extraction,and relevant history dialog generation.The DS-Dialog dataset contains about 2.6 million question-answer pairs,where 1.3 million pairs correspond to existing VisDial’s question-answer pairs,and the remaining 1.3 million pairs include a maximum of 5 image features for each VisDial image,with each image comprising 10-round relevant question-answer pairs.Moreover,a novel adaptive relevant history selection is proposed to resolve missing visual semantic information for each image.DS-Dialog is used to benchmark the performance of previous visual dialog models and achieves better performance than previous models.Specifically,the proposed DSDialog model achieves an 8% higher mean reciprocal rank(MRR),11% higher R@1%,6% higher R@5%,5% higher R@10%,and 8% higher normalized discounted cumulative gain(NDCG)compared to LF.DS-Dialog also achieves approximately 1 point improvement on R@k,mean,MRR,and NDCG compared to the original RVA,and 2 points improvement compared to LF andDualVD.These results demonstrates the importance of the relevant semantic historical context in enhancing the visual semantic relationship between textual and visual representations of the images and questions.

Hybrid Recommender System Using Systolic Tree for Pattern Mining

A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking into account the order of transactions.This work will present the implementation of sequence pattern mining for recommender systems within the domain of e-com-merce.This work will execute the Systolic tree algorithm for mining the frequent patterns to yield feasible rules for the recommender system.The feature selec-tion's objective is to pick a feature subset having the least feature similarity as well as highest relevancy with the target class.This will mitigate the feature vector's dimensionality by eliminating redundant,irrelevant,or noisy data.This work pre-sents a new hybrid recommender system based on optimized feature selection and systolic tree.The features were extracted using Term Frequency-Inverse Docu-ment Frequency(TF-IDF),feature selection with the utilization of River Forma-tion Dynamics(RFD),and the Particle Swarm Optimization(PSO)algorithm.The systolic tree is used for pattern mining,and based on this,the recommendations are given.The proposed methods were evaluated using the MovieLens dataset,and the experimental outcomes confirmed the efficiency of the techniques.It was observed that the RFD feature selection with systolic tree frequent pattern mining with collaborativefiltering,the precision of 0.89 was achieved.

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.

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.

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.

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.

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.