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.

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.

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.

An Ensemble Learning Recommender System for Interactive Platforms

In interactive platforms, we often want to predict which items could be more relevant for users, either based on their previous interactions with the system or their preferences. Such systems are called Recommender Systems. They are divided into three main groups, including content-based, collaborative and hybrid recommenders. In this paper, we focus on collaborative filtering and the improvement of the accuracy of its techniques. Then, we suggest an Ensemble Learning Recommender System model made of a probabilistic model and an efficient matrix factorization method. The interactions between users and the platform are scored by explicit and implicit scores. At each user session, implicit scores are used to train a probabilistic model to compute the maximum likelihood estimator for the probability that an item will be recommended in the next session. The explicit scores are used to know the impact of the user’s vote on an item at the time of the recommendation.

基于RoBERTa和图增强Transformer的序列推荐方法

自推荐系统出现以来,有限的数据信息就一直制约着推荐算法的进一步发展。为降低数据稀疏性的影响,增强非评分数据的利用率,基于神经网络的文本推荐模型相继被提出,但主流的卷积或循环神经网络在文本语义理解和长距离关系捕捉方面存在明显劣势。为了更好地挖掘用户与商品之间的深层潜在特征,进一步提高推荐质量,提出一种基于Ro BERTa和图增强Transformer的序列推荐(RGT)模型。引入评论文本数据,首先利用预训练的Ro BERTa模型捕获评论文本中的字词语义特征,初步建模用户的个性化兴趣,然后根据用户与商品的历史交互信息,构建具有时序特性的商品关联图注意力机制网络模型,通过图增强Transformer的方法将图模型学习到的各个商品的特征表示以序列的形式输入Transformer编码层,最后将得到的输出向量与之前捕获的语义表征以及计算得到的商品关联图的全图表征输入全连接层,以捕获用户全局的兴趣偏好,实现用户对商品的预测评分。在3组真实亚马逊公开数据集上的实验结果表明,与Deep FM、Conv MF等经典文本推荐模型相比,RGT模型在均方根误差(RMSE)和平均绝对误差(MAE)2种指标上有显著提升,相较于最优对比模型最高分别提升4.7%和5.3%。

RM-RT^(2)NI:融合评论时效与可信近邻影响力的推荐模型

基于矩阵分解的推荐模型虽然能够处理高维评分数据,但容易遭受评分数据稀疏性的困扰。基于评分和评论的推荐模型通过外加隐藏在评论中的用户偏好与物品属性信息,缓解了评分数据的稀疏性,但在特征提取时大多没有关注评论时效性和可信近邻影响力,无法获得更丰富的用户和物品特征。为进一步提高推荐精度,提出了融合评论时效与可信近邻影响力的推荐模型RM-RT^(2)NI。基于评分矩阵,该模型使用矩阵分解提取了用户偏好和物品属性的浅层特征,利用云模型和修正的用户相似度评估模型和新构建的信度评估模型提取出可信近邻影响力;基于评论文本,该模型利用BERT模型获得每条评论的隐表达,利用双向GRU提取评论间的联系,利用新构建的融合时间因子的注意力机制识别各评论的时效贡献度,以获取用户和物品的深层特征。在此基础上,将用户浅层特征、深层特征以及可信近邻影响力特征融合成用户特征,将物品浅层特征和深层特征融合成物品特征,并将它们输入全连接神经网络以预测用户-物品评分。在5组公开数据集上对RM-RM-RT^(2)NI的推荐性能进行了实验评估,结果显示,与7个基线模型相比,RM-RT^(2)NI具有更高的评分预测精度,且RMSE平均降低了3.0657%。

An E-Commerce Recommender System Based on Content-Based Filtering

Content-based filtering E-commerce recommender system was discussed fully in this paper. Users＇ unique features can be explored by means of vector space model firstly. Then based on the qualitative value of products informa tion, the recommender lists were obtained. Since the system can adapt to the users＇ feedback automatically, its performance were enhanced comprehensively. Finally the evaluation of the system and the experimental results were presented.

Enhancing Collaborative Filtering via Topic Model Integrated Uniform Euclidean Distance

Recommendation system can greatly alleviate the "information overload" in the big data era. Existing recommendation methods, however, typically focus on predicting missing rating values via analyzing user-item dualistic relationship, which neglect an important fact that the latent interests of users can influence their rating behaviors. Moreover, traditional recommendation methods easily suffer from the high dimensional problem and cold-start problem. To address these challenges, in this paper, we propose a PBUED(PLSA-Based Uniform Euclidean Distance) scheme, which utilizes topic model and uniform Euclidean distance to recommend the suitable items for users. The solution first employs probabilistic latent semantic analysis(PLSA) to extract users' interests, users with different interests are divided into different subgroups. Then, the uniform Euclidean distance is adopted to compute the users' similarity in the same interest subset; finally, the missing rating values of data are predicted via aggregating similar neighbors' ratings. We evaluate PBUED on two datasets and experimental results show PBUED can lead to better predicting performance and ranking performance than other approaches.

Dynamic Trust Model Based on Service Recommendation in Big Data

In big data of business service or transaction,it is impossible to provide entire information to both of services from cyber system,so some service providers made use of maliciously services to get more interests.Trust management is an effective solution to deal with these malicious actions.This paper gave a trust computing model based on service-recommendation in big data.This model takes into account difference of recommendation trust between familiar node and stranger node.Thus,to ensure accuracy of recommending trust computing,paper proposed a fine-granularity similarity computing method based on the similarity of service concept domain ontology.This model is more accurate in computing trust value of cyber service nodes and prevents better cheating and attacking of malicious service nodes.Experiment results illustrated our model is effective.

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.

Does knowledge of physical activity recommendations increase physical activity among Chinese college students？ Empirical investigations based on the transtheoretical model

Background: Based on the transtheoretical model, the current study investigated whether awareness of physical activity(PA) recommendations had an impact on the stages of PA behavior change and levels of PA among Chinese college students.Methods: In Study 1, with a cross-sectional study design, 9826 students were recruited, and their knowledge of international PA recommendations,PA stage distribution, and self-reported PA level were surveyed. Pearson's χ2 test was used to test whether those participants who were aware and not aware of PA guidelines were equally distributed across the stages of PA behavior, and independent t test was conducted to test the group difference in the actual levels of PA. In Study 2, 279 students who were not aware of the PA recommendations were randomly allocated to either an intervention group or a control group, and only those in the intervention group were presented with international PA guidelines. In both groups,students' PA stages and PA level were examined before the test and then 4 months post-test. Mc Nemar's test for correlated proportions and repeated-measures analysis of variance were conducted to examine the changes in PA stage membership and PA level after the intervention.Results: Study 1 results revealed that only 4.4% of the surveyed students had correct knowledge of PA recommendations. Those who were aware of the recommendations were in later stages of PA behavior(χ~2(4) = 167.19, p < 0.001). They were also significantly more physically active than those who were not aware of the recommendations(t(443.71) = 9.00, p < 0.001, Cohen's d = 0.53). Study 2 results demonstrated that the intervention group participants who were at the precontemplation and contemplation stages at the pre-test each progressed further in the PA stages in the post-test(χ~2(1) = 112.06, p < 0.001; χ~2(1) = 118.76, p = 0.03, respectively), although no significant change in PA level was observed(t(139) < 1, p = 0.89).Conclusion: The results showed that awareness of the PA recommendations was associated with higher stages and levels of PA behavior, and a brief educational exposure to PA recommendations led to improved stages of PA behavior but no change in the levels of PA among Chinese college students. More effective public health campaign strategies are needed to promote the dissemination of the PA recommendations and to raise the awareness of the Chinese student population.

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.

Recommendation algorithm of cloud computing system based on random walk algorithm and collaborative filtering model

The traditional collaborative filtering recommendation technology has some shortcomings in the large data environment. To solve this problem, a personalized recommendation method based on cloud computing technology is proposed. The large data set and recommendation computation are decomposed into parallel processing on multiple computers. A parallel recommendation engine based on Hadoop open source framework is established, and the effectiveness of the system is validated by learning recommendation on an English training platform. The experimental results show that the scalability of the recommender system can be greatly improved by using cloud computing technology to handle massive data in the cluster. On the basis of the comparison of traditional recommendation algorithms, combined with the advantages of cloud computing, a personalized recommendation system based on cloud computing is proposed.

Entity Burst Discriminative Model for Cumulative Citation Recommendation

Knowledge base acceleration-cumulative citation recommendation(KBA-CCR)aims to detect citation-worthiness documents from a chronological stream corpus for a set of target entities in a knowledge base.Most previous works only consider a number of semantic features between documents and target entities in the knowledge base,and then use powerful machine learning approaches such as logistic regression to classify relevant documents and non-relevant documents.However,the burst activities of an entity have been proved to be a significant signal to predict potential citations.In this paper,an entity burst discriminative model(EBDM)is presented to substantially exploit such burst features.The EBDM presents a new temporal representation based on the burst features,which can capture both temporal and semantic correlations between entities and documents.Meanwhile,in contrast to the bag-of-words model,the EBDM can significantly decrease the number of non-zero entries of feature vectors.An extensive set of experiments were conducted on the TREC-KBA-2012 dataset.The results show that the EBDM outperforms the performance of the state-of-the-art models.

Storm分布式计算框架下基于知识图谱的快速学习资源推荐

针对在线学习资源推荐存在精度较低或实时性较差的问题,采用知识图谱进行用户及资源的知识表示,并采用长短时间记忆网络对用户资源特征差进行优化,从而将与用户特征差最小的资源推送给用户。首先,在获得在线学习记录样本后,利用知识图谱进行实体特征关系的知识表示,并借助Storm分布式框架生成知识图谱中头尾实体及关系特征向量。接着,建立用户-资源实体的最小特征差目标函数,并采用长短时间记忆网络对最小特征差目标函数进行优化。最后,通过Storm分布式平台进行长短时间记忆网络的参数求解,从而快速生成稳定的相关资源推荐模型。实验结果表明,在Storm分布式框架下采用知识图谱和长短时间记忆网络实现在线资源推荐,可获得较高准确率及运行效率,在应对大规模资源的实时推荐方面具有较强的适应度。

Beyond Customer Churn: Generating Personalized Actions to Retain Customers in a Retail Bank by a Recommender System Approach

Customer churn may be a critical issue for banks. The extant literature on statistical and machine learning for customer churn focuses on the problem of correctly predicting that a customer is about to switch bank, while very rarely consid-ers the problem of generating personalized actions to improve the customer retention rate. However, these decisions are at least as critical as the correct identification of customers at risk. The decision of what actions to deliver to what customers is normally left to managers who can only rely upon their knowledge. By looking at the scientific literature on CRM and personalization, this research proposes a number of models which can be used to generate marketing ac-tions, and shows how to integrate them into a model embracing both the analytical prediction of customer churn and the generation of retention actions. The benefits and risks associated with each approach are discussed. The paper also describes a case of application of a predictive model of customer churn in a retail bank where the analysts have also generated a set of personalized actions to retain customers by using one of the approaches presented in the paper, namely by adapting a recommender system approach to the retention problem.

RM-structure alignment based statistical machine translation model

A novel model based on structure alignments is proposed for statistical machine translation in this paper. Meta-structure and sequence of meta-structure for a parse tree are defined. During the translation process, a parse tree is decomposed to deal with the structure divergence and the alignments can be constructed at different levels of recombination of meta-structure （RM）. This method can perform the structure mapping across the sub-tree structure between languages. As a result, we get not only the translation for the target language, but sequence of meta-stmctu .re of its parse tree at the same time. Experiments show that the model in the framework of log-linear model has better generative ability and significantly outperforms Pharaoh, a phrase-based system.

A Novel Recommendation Service Method Based on Cloud Model and User Personality

The number of Internet Web services has become increasingly large recently.Cloud services consumers face a critical challenge in selecting services from abundant candidates.Due to the uncertainty of Web service QoS and the diversity of user characteristics,this paper proposes a Web service recommendation method based on cloud model and user personality(WSRCP),which employs cloud model similarity method to analyze the similarity of QoS feedback data among different users,to identify the user with high similarity to the potential user.Based on the QoS data of the users’feedback,Finally,user characteristic attribute Web service recommendation is implemented by personalized collaborative filtering algorithm.The experimental results on the WS-Dream dataset show that our approach not only solves the drawbacks of the sparse user service,but also improves the recommend accuracy.

Collaboration Filtering Recommendation Algorithm Based on the Latent Factor Model and Improved Spectral Clustering

Due to the development of E-Commerce, collaboration filtering (CF) recommendation algorithm becomes popular in recent years. It has some limitations such as cold start, data sparseness and low operation efficiency. In this paper, a CF recommendation algorithm is propose based on the latent factor model and improved spectral clustering (CFRALFMISC) to improve the forecasting precision. The latent factor model was firstly adopted to predict the missing score. Then, the cluster validity index was used to determine the number of clusters. Finally, the spectral clustering was improved by using the FCM algorithm to replace the K-means in the spectral clustering. The simulation results show that CFRALFMISC can effectively improve the recommendation precision compared with other algorithms.

Evaluation of a model recommended for N fertilizer application in irrigated rice

The response of rice to N fertilizer applicationhas shown that high rates of N application donot always ensure a proportional increase inyield due to high N losses. A model, ORYZA-0 was developed by ten Berge for designingoptimum N fertilizer management strategy inrice. We evaluated the performance ofORYZA-0 in Jinhua, Zhejiang Province. ORYZA-0 includes N uptakes, partition-ing of N among the organs, and utilization ofleaf N in converting solar energy to dry mat-ter. It can predict the amount and time of Nfertilizer application to achieve a maximumbiomass or yield combining with Price algo-rithm optimization procedure.