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.

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.

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 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.

Hybrid Scalable Researcher Recommendation System Using Azure Data Lake Analytics

This research paper has provided the methodology and design for implementing the hybrid author recommender system using Azure Data Lake Analytics and Power BI. It offers a recommendation for the top 1000 Authors of computer science in different fields of study. The technique used in this paper is handling the inadequate Information for citation;it removes the problem of cold start, which is encountered by very many other recommender systems. In this paper, abstracts, the titles, and the Microsoft academic graphs have been used in coming up with the recommendation list for every document, which is used to combine the content-based approaches and the co-citations. Prioritization and the blending of every technique have been allowed by the tuning system parameters, allowing for the authority in results of recommendation versus the paper novelty. In the end, we do observe that there is a direct correlation between the similarity rankings that have been produced by the system and the scores of the participant. The results coming from the associated scrips of analysis and the user survey have been made available through the recommendation system. Managers must gain the required expertise to fully utilize the benefits that come with business intelligence systems [1]. Data mining has become an important tool for managers that provides insights about their daily operations and leverage the information provided by decision support systems to improve customer relationships [2]. Additionally, managers require business intelligence systems that can rank the output in the order of priority. Ranking algorithm can replace the traditional data mining algorithms that will be discussed in-depth in the literature review [3].

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.

Recommendation Algorithm Integrating CNN and Attention System in Data Extraction

With the rapid development of the Internet globally since the 21st century,the amount of data information has increased exponentially.Data helps improve people’s livelihood and working conditions,as well as learning efficiency.Therefore,data extraction,analysis,and processing have become a hot issue for people from all walks of life.Traditional recommendation algorithm still has some problems,such as inaccuracy,less diversity,and low performance.To solve these problems and improve the accuracy and variety of the recommendation algorithms,the research combines the convolutional neural networks(CNN)and the attention model to design a recommendation algorithm based on the neural network framework.Through the text convolutional network,the input layer in CNN has transformed into two channels:static ones and non-static ones.Meanwhile,the self-attention system focuses on the system so that data can be better processed and the accuracy of feature extraction becomes higher.The recommendation algorithm combines CNN and attention system and divides the embedding layer into user information feature embedding and data name feature extraction embedding.It obtains data name features through a convolution kernel.Finally,the top pooling layer obtains the length vector.The attention system layer obtains the characteristics of the data type.Experimental results show that the proposed recommendation algorithm that combines CNN and the attention system can perform better in data extraction than the traditional CNN algorithm and other recommendation algorithms that are popular at the present stage.The proposed algorithm shows excellent accuracy and robustness.

Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering

Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.

Content-Based Movie Recommendation System Using MBO with DBN

The content-basedfiltering technique has been used effectively in a variety of Recommender Systems(RS).The user explicitly or implicitly provides data in the Content-Based Recommender System.The system collects this data and creates a profile for all the users,and the recommendation is generated by the user profile.The recommendation generated via content-basedfiltering is provided by observing just a single user’s profile.The primary objective of this RS is to recommend a list of movies based on the user’s preferences.A con-tent-based movie recommendation model is proposed in this research,which recommends movies based on the user’s profile from the Facebook platform.The recommendation system is built with a hybrid model that combines the Mon-arch Butterfly Optimization(MBO)with the Deep Belief Network(DBN).For feature selection,the MBO is utilized,while DBN is used for classification.The datasets used in the experiment are collected from Facebook and MovieLens.The dataset features are evaluated for performance evaluation to validate if data with various attributes can solve the matching recommendations.Eachfile is com-pared with features that prove the features will support movie recommendations.The proposed model’s mean absolute error(MAE)and root-mean-square error(RMSE)values are 0.716 and 0.915,and its precision and recall are 97.35 and 96.60 percent,respectively.Extensive tests have demonstrated the advantages of the proposed method in terms of MAE,RMSE,Precision,and Recall compared to state-of-the-art algorithms such as Fuzzy C-means with Bat algorithm(FCM-BAT),Collaborativefiltering with k-NN and the normalized discounted cumulative gain method(CF-kNN+NDCG),User profile correlation-based similarity(UPCSim),and Deep Autoencoder.

Construction of Intelligent Recommendation Retrieval Model of FuJian Intangible Cultural Heritage Digital Archives Resources

In order to improve the consistency between the recommended retrieval results and user needs,improve the recommendation efficiency,and reduce the average absolute deviation of resource retrieval,a design method of intelligent recommendation retrieval model for Fujian intangible cultural heritage digital archive resources based on knowledge atlas is proposed.The TG-LDA(Tag-granularity LDA)model is proposed on the basis of the standard LDA(Linear Discriminant Analysis)model.The model is used to mine archive resource topics.The Pearson correlation coefficient is used to measure the relevance between topics.Based on the measurement results,the FastText deep learning model is used to achieve archive resource classification.According to the classification results,TF-IDF(term frequency–inverse document frequency)algorithm is used to calculate the weight of resource retrieval keywords to achieve resource retrieval,and a recommendation model of intangible cultural heritage digital archives resources is built through the knowledge map to achieve comprehensive and personalized recommendation of resources.The experimental results show that the recommendation and retrieval results of the proposed method are more in line with users’needs,can provide users with personalized digital archive resources,and the average absolute deviation of resource retrieval is low,the recommendation efficiency is high,and the utilization effect of archive resources is effectively improved.

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.

Time Highlighted Multi-Interest Network for Sequential Recommendation

Sequential recommendation based on amulti-interest framework aims to analyze different aspects of interest based on historical interactions and generate predictions of a user’s potential interest in a list of items.Most existing methods only focus on what are themultiple interests behind interactions but neglect the evolution of user interests over time.To explore the impact of temporal dynamics on interest extraction,this paper explicitly models the timestamp with amulti-interest network and proposes a time-highlighted network to learn user preferences,which considers not only the interests at different moments but also the possible trends of interest over time.More specifically,the time intervals between historical interactions and prediction moments are first mapped to vectors.Meanwhile,a time-attentive aggregation layer is designed to capture the trends of items in the sequence over time,where the time intervals are seen as additional information to distinguish the importance of different neighbors.Then,the learned items’transition trends are aggregated with the items themselves by a gated unit.Finally,a self-attention network is deployed to capture multiple interests with the obtained temporal information vectors.Extensive experiments are carried out based on three real-world datasets and the results convincingly establish the superiority of the proposed method over other state-of-the-art baselines in terms of model performance.

Exercise Recommendation with Preferences and Expectations Based on Ability Computation

In the era of artificial intelligence,cognitive computing,based on cognitive science;and supported by machine learning and big data,brings personalization into every corner of our social life.Recommendation systems are essential applications of cognitive computing in educational scenarios.They help learners personalize their learning better by computing student and exercise characteristics using data generated from relevant learning progress.The paper introduces a Learning and Forgetting Convolutional Knowledge Tracking Exercise Recommendation model(LFCKT-ER).First,the model computes students’ability to understand each knowledge concept,and the learning progress of each knowledge concept,and the model consider their forgetting behavior during learning progress.Then,students’learning stage preferences are combined with filtering the exercises that meet their learning progress and preferences.Then students’ability is used to evaluate whether their expectations of the difficulty of the exercises are reasonable.Then,the model filters the exercises that best match students’expectations again by students’expectations.Finally,we use a simulated annealing optimization algorithm to assemble a set of exercises with the highest diversity.From the experimental results,the LFCKT-ER model can better meet students’personalized learning needs and is more accurate than other exercise recommendation systems under various metrics on real online education public datasets.

Graph Convolutional Network-Based Repository Recommendation System

GitHub repository recommendation is a research hotspot in the field of open-source software. The current problemswith the repository recommendation systemare the insufficient utilization of open-source community informationand the fact that the scoring metrics used to calculate the matching degree between developers and repositoriesare developed manually and rely too much on human experience, leading to poor recommendation results. Toaddress these problems, we design a questionnaire to investigate which repository information developers focus onand propose a graph convolutional network-based repository recommendation system (GCNRec). First, to solveinsufficient information utilization in open-source communities, we construct a Developer-Repository networkusing four types of behavioral data that best reflect developers’ programming preferences and extract features ofdevelopers and repositories from the repository content that developers focus on. Then, we design a repositoryrecommendation model based on a multi-layer graph convolutional network to avoid the manual formulation ofscoringmetrics. Thismodel takes the Developer-Repository network, developer features and repository features asinputs, and recommends the top-k repositories that developers are most likely to be interested in by learning theirpreferences. We have verified the proposed GCNRec on the dataset, and by comparing it with other open-sourcerepository recommendation methods, GCNRec achieves higher precision and hit rate.

Modeling Price-Aware Session-Based Recommendation Based on Graph Neural Network

Session-based Recommendation(SBR)aims to accurately recom-mend a list of items to users based on anonymous historical session sequences.Existing methods for SBR suffer from several limitations:SBR based on Graph Neural Network often has information loss when constructing session graphs;Inadequate consideration is given to influencing factors,such as item price,and users’dynamic interest evolution is not taken into account.A new session recommendation model called Price-aware Session-based Recommendation(PASBR)is proposed to address these limitations.PASBR constructs session graphs by information lossless approaches to fully encode the original session information,then introduces item price as a new factor and models users’price tolerance for various items to influence users’preferences.In addition,PASBR proposes a new method to encode user intent at the item category level and tries to capture the dynamic interest of users over time.Finally,PASBR fuses the multi-perspective features to generate the global representation of users and make a prediction.Specifically,the intent,the short-term and long-term interests,and the dynamic interests of a user are combined.Experiments on two real-world datasets show that PASBR can outperform representative baselines for SBR.

Deep Learning Enabled Social Media Recommendation Based on User Comments

Nowadays,review systems have been developed with social media Recommendation systems(RS).Although research on RS social media is increas-ing year by year,the comprehensive literature review and classification of this RS research is limited and needs to be improved.The previous method did notfind any user reviews within a time,so it gets poor accuracy and doesn’tfilter the irre-levant comments efficiently.The Recursive Neural Network-based Trust Recom-mender System(RNN-TRS)is proposed to overcome this method’s problem.So it is efficient to analyse the trust comment and remove the irrelevant sentence appropriately.Thefirst step is to collect the data based on the transactional reviews of social media.The second step is pre-processing using Imbalanced Col-laborative Filtering(ICF)to remove the null values from the dataset.Extract the features from the pre-processing step using the Maximum Support Grade Scale(MSGS)to extract the maximum number of scaling features in the dataset and grade the weights(length,count,etc.).In the Extracting features for Training and testing method before that in the feature weights evaluating the softmax acti-vation function for calculating the average weights of the features.Finally,In the classification method,the Recursive Neural Network-based Trust Recommender System(RNN-TRS)for User reviews based on the Positive and negative scores is analysed by the system.The simulation results improve the predicting accuracy and reduce time complexity better than previous methods.

Deep learning framework for multi‐round service bundle recommendation in iterative mashup development

Recent years have witnessed the rapid development of service‐oriented computing technologies.The boom of Web services increases software developers'selection burden in developing new service‐based systems such as mashups.Timely recommending appropriate component services for developers to build new mashups has become a fundamental problem in service‐oriented software engineering.Existing service recom-mendation approaches are mainly designed for mashup development in the single‐round scenario.It is hard for them to effectively update recommendation results according to developers'requirements and behaviours(e.g.instant service selection).To address this issue,the authors propose a service bundle recommendation framework based on deep learning,DLISR,which aims to capture the interactions among the target mashup to build,selected(component)services,and the following service to recommend.Moreover,an attention mechanism is employed in DLISR to weigh selected services when rec-ommending a candidate service.The authors also design two separate models for learning interactions from the perspectives of content and invocation history,respectively,and a hybrid model called HISR.Experiments on a real‐world dataset indicate that HISR can outperform several state‐of‐the‐art service recommendation methods to develop new mashups iteratively.

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.