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 ...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.展开更多
Intelligence and perception are two operative technologies in 6G scenarios.The intelligent wireless network and information perception require a deep fusion of artificial intelligence(AI)and wireless communications in...Intelligence and perception are two operative technologies in 6G scenarios.The intelligent wireless network and information perception require a deep fusion of artificial intelligence(AI)and wireless communications in 6G systems.Therefore,fusion is becoming a typical feature and key challenge of 6G wireless communication systems.In this paper,we focus on the critical issues and propose three application scenarios in 6G wireless systems.Specifically,we first discuss the fusion of AI and 6G networks for the enhancement of 5G-advanced technology and future wireless communication systems.Then,we introduce the wireless AI technology architecture with 6G multidimensional information perception,which includes the physical layer technology of multi-dimensional feature information perception,full spectrum fusion technology,and intelligent wireless resource management.The discussion of key technologies for intelligent 6G wireless network networks is expected to provide a guideline for future research.展开更多
With the popularity of 5G and the rapid development of mobile terminals,an endless stream of short video software exists.Browsing short-form mobile video in fragmented time has become the mainstream of user’s life.He...With the popularity of 5G and the rapid development of mobile terminals,an endless stream of short video software exists.Browsing short-form mobile video in fragmented time has become the mainstream of user’s life.Hence,designing an efficient short video recommendation method has become important for major network platforms to attract users and satisfy their requirements.Nevertheless,the explosive growth of data leads to the low efficiency of the algorithm,which fails to distill users’points of interest on one hand effectively.On the other hand,integrating user preferences and the content of items urgently intensify the requirements for platform recommendation.In this paper,we propose a collaborative filtering algorithm,integrating time context information and user context,which pours attention into expanding and discovering user interest.In the first place,we introduce the temporal context information into the typical collaborative filtering algorithm,and leverage the popularity penalty function to weight the similarity between recommended short videos and the historical short videos.There remains one more point.We also introduce the user situation into the traditional collaborative filtering recommendation algorithm,considering the context information of users in the generation recommendation stage,and weight the recommended short-formvideos of candidates.At last,a diverse approach is used to generate a Top-K recommendation list for users.And through a case study,we illustrate the accuracy and diversity of the proposed method.展开更多
Collaborative filtering is the most popular and successful information recommendation technique. However, it can suffer from data sparsity issue in cases where the systems do not have sufficient domain information. Tr...Collaborative filtering is the most popular and successful information recommendation technique. However, it can suffer from data sparsity issue in cases where the systems do not have sufficient domain information. Transfer learning, which enables information to be transferred from source domains to target domain, presents an unprecedented opportunity to alleviate this issue. A few recent works focus on transferring user-item rating information from a dense domain to a sparse target domain, while almost all methods need that each rating matrix in source domain to be extracted should be complete. To address this issue, in this paper we propose a novel multiple incomplete domains transfer learning model for cross-domain collaborative filtering. The transfer learning process consists of two steps. First, the user-item ratings information in incomplete source domains are compressed into multiple informative compact cluster-level matrixes, which are referred as codebooks. Second, we reconstruct the target matrix based on the codebooks. Specifically, for the purpose of maximizing the knowledge transfer, we design a new algorithm to learn the rating knowledge efficiently from multiple incomplete domains. Extensive experiments on real datasets demonstrate that our proposed approach significantly outperforms existing methods.展开更多
Over-use of fertilizer in paddy fields could lead to agro-environmental pollution. Therefore, the Paddy Fertilizer Recommendation System (PFRS) application package was designed to aid in the dissemination of fertilize...Over-use of fertilizer in paddy fields could lead to agro-environmental pollution. Therefore, the Paddy Fertilizer Recommendation System (PFRS) application package was designed to aid in the dissemination of fertilizer recommendations for paddy fields. PFRS utilized geographical information system (GIS) ActiveX Controls, enabling the user to select a location of interest linked to a spatial database of paddy field soil characteristics. The application package also incorporated different soil fertilizer recommendation methods, forming a relational database. The application's structure consisted primarily of building database queries using Standard Query Language (SQL) constructed during run-time, based on user provided spatial parameters of a selected location, the type of soil desired and paddy production criteria. PFRS, which was comprised of five modules including: File, View, Edit, Layer and Fertilizer/Model, provided the user with map-based fertilizer recommendations based on selected soil nutrient P and K map layers as well as N characteristics and land use maps.展开更多
The development of information technology has changed people's learning methods. Fragmented learning,as an informal learning method,has become an important way to accept new knowledge and learn new technologies. T...The development of information technology has changed people's learning methods. Fragmented learning,as an informal learning method,has become an important way to accept new knowledge and learn new technologies. Through analyzing the connotation,characteristics,and advantages and disadvantages of fragmented learning,this paper came up with reasonable recommendations for fragmented learning. To truly become systematic and holistic knowledge,fragmented knowledge must be explored,understood,integrated and internalized. This paper is expected to play an important guiding role in building a lifelong learning society.展开更多
The traditional Apriori applied in books management system causes slow system operation due to frequent scanning of database and excessive quantity of candidate item-sets, so an information recommendation book managem...The traditional Apriori applied in books management system causes slow system operation due to frequent scanning of database and excessive quantity of candidate item-sets, so an information recommendation book management system based on improved Apriori data mining algorithm is designed, in which the C/S (client/server) architecture and B/S (browser/server) architecture are integrated, so as to open the book information to library staff and borrowers. The related information data of the borrowers and books can be extracted from books lending database by the data preprocessing sub-module in the system function module. After the data is cleaned, converted and integrated, the association rule mining sub-module is used to mine the strong association rules with support degree greater than minimum support degree threshold and confidence coefficient greater than minimum confidence coefficient threshold according to the processed data and by means of the improved Apriori data mining algorithm to generate association rule database. The association matching is performed by the personalized recommendation sub-module according to the borrower and his selected books in the association rule database. The book information associated with the books read by borrower is recommended to him to realize personalized recommendation of the book information. The experimental results show that the system can effectively recommend book related information, and its CPU occupation rate is only 6.47% under the condition that 50 clients are running it at the same time. Anyway, it has good performance.展开更多
With the development of information technology, online learning has gradually become an indispensable way of knowledge acquisition. However, with the increasing amount of data information, it is increasingly difficult...With the development of information technology, online learning has gradually become an indispensable way of knowledge acquisition. However, with the increasing amount of data information, it is increasingly difficult for people to find appropriate learning materials from a large number of educational resources. The recommender system has been widely used in various Internet applications due to its high efficiency in filtering information, helping users to quickly find personalized resources from thousands of information, thereby alleviating the problem of information overload. In addition, due to its great use value, many new researches have been proposed in the field of recommender systems in recent years, but there are not many works on online course recommendation at present. Therefore, this paper aims to sort out the existing cutting-edge recommendation algorithms and the work related to online course recommendation, so as to provide a comprehensive overview of the online course recommender system. Specifically, we will first introduce the main technologies and representative work used in the online course recommender system, explain the advantages and disadvantages of various technologies, and finally discuss the future research direction of the online course recommender system.展开更多
Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their perform...Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their performance is not good enough since there lacks a good evaluation model for the pick-up points.Therefore,we propose an entropy-based model for recommendation of taxis'cruising route.Firstly,we select more positional attributes from historical pick-up points in order to obtain accurate spatial-temporal features.Secondly,the information entropy of spatial-temporal features is integrated in the evaluation model.Then it is applied for getting the next pick-up points and further recommending a series of successive points.These points are constructed a cruising route for taxi-drivers.Experimental results show that our method is able to obviously improve the recommendation accuracy of pick-up points,and help taxi-drivers make profitable benefits more than before.展开更多
Cloud Computing and in particular cloud services have become widely used in both the technology and business industries. Despite this significant use, very little research or commercial solutions exist that focus on t...Cloud Computing and in particular cloud services have become widely used in both the technology and business industries. Despite this significant use, very little research or commercial solutions exist that focus on the discovery of cloud services. This paper introduces CSRecommender—a search engine and recommender system specifically designed for the discovery of these services. To engineer the system to scale, we also describe the implementation of a Cloud Service Identifier which enables the system to crawl the Internet without human involvement. Finally, we examine the effectiveness and usefulness of the system using real-world use cases and users.展开更多
User-analysis techniques are mainly used to recommend friends and information. This paper discusses the data characteristics of microblog users and describes a multidimensional user rec- ommendation algorithm that tak...User-analysis techniques are mainly used to recommend friends and information. This paper discusses the data characteristics of microblog users and describes a multidimensional user rec- ommendation algorithm that takes into account microblog length, relativity between microblog and users, and familiarity between users. The experimental results show that this multidi- mensional algorithm is more accurate than a traditional recom- mendation algorithm.展开更多
With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately rec...With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately recommend POIs to users because the user-POI matrix is extremely sparse.In addition,a user's check-in activities are affected by many influential factors.However,most of existing studies capture only few influential factors.It is hard for them to be extended to incorporate other heterogeneous information in a unified way.To address these problems,we propose a meta-path-based deep representation learning(MPDRL)model for personalized POI recommendation.In this model,we design eight types of meta-paths to fully utilize the rich heterogeneous information in LBSNs for the representations of users and POIs,and deeply mine the correlations between users and POIs.To further improve the recommendation performance,we design an attention-based long short-term memory(LSTM)network to learn the importance of different influential factors on a user's specific check-in activity.To verify the effectiveness of our proposed method,we conduct extensive experiments on a real-world dataset,Foursquare.Experimental results show that the MPDRL model improves at least 16.97%and 23.55%over all comparison methods in terms of the metric Precision@N(Pre@N)and Recall@N(Rec@N)respectively.展开更多
Over the years, there has been increasing growth in academic digital libraries. It has therefore become overwhelming for researchers to determine important research materials. In most existing research works that cons...Over the years, there has been increasing growth in academic digital libraries. It has therefore become overwhelming for researchers to determine important research materials. In most existing research works that consider scholarly paper recommendation, the researcher’s preference is left out. In this paper, therefore, Frequent Pattern (FP) Growth Algorithm is employed on potential papers generated from the researcher’s preferences to create a list of ranked papers based on citation features. The purpose is to provide a recommender system that is user oriented. A walk through algorithm is implemented to generate all possible frequent patterns from the FP-tree after which an output of ordered recommended papers combining subjective and objective factors of the researchers is produced. Experimental results with a scholarly paper recommendation dataset show that the proposed method is very promising, as it outperforms recommendation baselines as measured with nDCG and MRR.展开更多
异构信息网络(Heterogeneous Information Network, HIN)凭借其丰富的语义信息和结构信息被广泛应用于推荐系统中,虽然取得了很好的推荐效果,但较少考虑局部特征放大、信息交互和多嵌入聚合等问题。针对这些问题,提出了一种新的用于top-...异构信息网络(Heterogeneous Information Network, HIN)凭借其丰富的语义信息和结构信息被广泛应用于推荐系统中,虽然取得了很好的推荐效果,但较少考虑局部特征放大、信息交互和多嵌入聚合等问题。针对这些问题,提出了一种新的用于top-N推荐的多嵌入融合推荐(Multi-embedding Fusion Recommendation, MFRec)模型。首先,该模型在用户和项目学习分支中都采用对象上下文表示网络,充分利用上下文信息以放大局部特征,增强相邻节点的交互性;其次,将空洞卷积和空间金字塔池化引入元路径学习分支,以便获取多尺度信息并增强元路径的节点表示;然后,采用多嵌入融合模块以便更好地进行用户、项目以及元路径的嵌入融合,细粒度地进行多嵌入之间的交互学习,并强调了各特征的不同重要性程度;最后,在两个公共推荐系统数据集上进行了实验,结果表明所提模型MFRec优于现有的其他top-N推荐系统模型。展开更多
基金This work was supported by the Kyonggi University Research Grant 2022.
文摘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.
文摘Intelligence and perception are two operative technologies in 6G scenarios.The intelligent wireless network and information perception require a deep fusion of artificial intelligence(AI)and wireless communications in 6G systems.Therefore,fusion is becoming a typical feature and key challenge of 6G wireless communication systems.In this paper,we focus on the critical issues and propose three application scenarios in 6G wireless systems.Specifically,we first discuss the fusion of AI and 6G networks for the enhancement of 5G-advanced technology and future wireless communication systems.Then,we introduce the wireless AI technology architecture with 6G multidimensional information perception,which includes the physical layer technology of multi-dimensional feature information perception,full spectrum fusion technology,and intelligent wireless resource management.The discussion of key technologies for intelligent 6G wireless network networks is expected to provide a guideline for future research.
文摘With the popularity of 5G and the rapid development of mobile terminals,an endless stream of short video software exists.Browsing short-form mobile video in fragmented time has become the mainstream of user’s life.Hence,designing an efficient short video recommendation method has become important for major network platforms to attract users and satisfy their requirements.Nevertheless,the explosive growth of data leads to the low efficiency of the algorithm,which fails to distill users’points of interest on one hand effectively.On the other hand,integrating user preferences and the content of items urgently intensify the requirements for platform recommendation.In this paper,we propose a collaborative filtering algorithm,integrating time context information and user context,which pours attention into expanding and discovering user interest.In the first place,we introduce the temporal context information into the typical collaborative filtering algorithm,and leverage the popularity penalty function to weight the similarity between recommended short videos and the historical short videos.There remains one more point.We also introduce the user situation into the traditional collaborative filtering recommendation algorithm,considering the context information of users in the generation recommendation stage,and weight the recommended short-formvideos of candidates.At last,a diverse approach is used to generate a Top-K recommendation list for users.And through a case study,we illustrate the accuracy and diversity of the proposed method.
基金supported by the National Natural Science Foundation of China (No. 91546111, 91646201)the Key Project of Beijing Municipal Education Commission (No. KZ201610005009)the General Project of Beijing Municipal Education Commission (No. KM201710005023)
文摘Collaborative filtering is the most popular and successful information recommendation technique. However, it can suffer from data sparsity issue in cases where the systems do not have sufficient domain information. Transfer learning, which enables information to be transferred from source domains to target domain, presents an unprecedented opportunity to alleviate this issue. A few recent works focus on transferring user-item rating information from a dense domain to a sparse target domain, while almost all methods need that each rating matrix in source domain to be extracted should be complete. To address this issue, in this paper we propose a novel multiple incomplete domains transfer learning model for cross-domain collaborative filtering. The transfer learning process consists of two steps. First, the user-item ratings information in incomplete source domains are compressed into multiple informative compact cluster-level matrixes, which are referred as codebooks. Second, we reconstruct the target matrix based on the codebooks. Specifically, for the purpose of maximizing the knowledge transfer, we design a new algorithm to learn the rating knowledge efficiently from multiple incomplete domains. Extensive experiments on real datasets demonstrate that our proposed approach significantly outperforms existing methods.
基金Project supported by the National Natural Science Foundation of China (No. 40001008) the China-British Higher Education Links (No. SHA/992/297).
文摘Over-use of fertilizer in paddy fields could lead to agro-environmental pollution. Therefore, the Paddy Fertilizer Recommendation System (PFRS) application package was designed to aid in the dissemination of fertilizer recommendations for paddy fields. PFRS utilized geographical information system (GIS) ActiveX Controls, enabling the user to select a location of interest linked to a spatial database of paddy field soil characteristics. The application package also incorporated different soil fertilizer recommendation methods, forming a relational database. The application's structure consisted primarily of building database queries using Standard Query Language (SQL) constructed during run-time, based on user provided spatial parameters of a selected location, the type of soil desired and paddy production criteria. PFRS, which was comprised of five modules including: File, View, Edit, Layer and Fertilizer/Model, provided the user with map-based fertilizer recommendations based on selected soil nutrient P and K map layers as well as N characteristics and land use maps.
基金Supported by Research Project on Education and Teaching Reform of Higher Education Institutions in Hainan Province(Hnjg2016-12)Education and Teaching Reform Research Project of Hainan University(hdjy1604)
文摘The development of information technology has changed people's learning methods. Fragmented learning,as an informal learning method,has become an important way to accept new knowledge and learn new technologies. Through analyzing the connotation,characteristics,and advantages and disadvantages of fragmented learning,this paper came up with reasonable recommendations for fragmented learning. To truly become systematic and holistic knowledge,fragmented knowledge must be explored,understood,integrated and internalized. This paper is expected to play an important guiding role in building a lifelong learning society.
文摘The traditional Apriori applied in books management system causes slow system operation due to frequent scanning of database and excessive quantity of candidate item-sets, so an information recommendation book management system based on improved Apriori data mining algorithm is designed, in which the C/S (client/server) architecture and B/S (browser/server) architecture are integrated, so as to open the book information to library staff and borrowers. The related information data of the borrowers and books can be extracted from books lending database by the data preprocessing sub-module in the system function module. After the data is cleaned, converted and integrated, the association rule mining sub-module is used to mine the strong association rules with support degree greater than minimum support degree threshold and confidence coefficient greater than minimum confidence coefficient threshold according to the processed data and by means of the improved Apriori data mining algorithm to generate association rule database. The association matching is performed by the personalized recommendation sub-module according to the borrower and his selected books in the association rule database. The book information associated with the books read by borrower is recommended to him to realize personalized recommendation of the book information. The experimental results show that the system can effectively recommend book related information, and its CPU occupation rate is only 6.47% under the condition that 50 clients are running it at the same time. Anyway, it has good performance.
文摘With the development of information technology, online learning has gradually become an indispensable way of knowledge acquisition. However, with the increasing amount of data information, it is increasingly difficult for people to find appropriate learning materials from a large number of educational resources. The recommender system has been widely used in various Internet applications due to its high efficiency in filtering information, helping users to quickly find personalized resources from thousands of information, thereby alleviating the problem of information overload. In addition, due to its great use value, many new researches have been proposed in the field of recommender systems in recent years, but there are not many works on online course recommendation at present. Therefore, this paper aims to sort out the existing cutting-edge recommendation algorithms and the work related to online course recommendation, so as to provide a comprehensive overview of the online course recommender system. Specifically, we will first introduce the main technologies and representative work used in the online course recommender system, explain the advantages and disadvantages of various technologies, and finally discuss the future research direction of the online course recommender system.
基金funded by the National Natural Science Foundation of China(61872139,41871320)Provincial and Municipal Joint Fund of Hunan Provincial Natural Science Foundation of China(2018JJ4052)+2 种基金Hunan Provincial Natural Science Foundation of China(2017JJ2081)the Key Project of Hunan Provincial Education Department(17A070,19A172)the Project of Hunan Provincial Education Department(17C0646).
文摘Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their performance is not good enough since there lacks a good evaluation model for the pick-up points.Therefore,we propose an entropy-based model for recommendation of taxis'cruising route.Firstly,we select more positional attributes from historical pick-up points in order to obtain accurate spatial-temporal features.Secondly,the information entropy of spatial-temporal features is integrated in the evaluation model.Then it is applied for getting the next pick-up points and further recommending a series of successive points.These points are constructed a cruising route for taxi-drivers.Experimental results show that our method is able to obviously improve the recommendation accuracy of pick-up points,and help taxi-drivers make profitable benefits more than before.
文摘Cloud Computing and in particular cloud services have become widely used in both the technology and business industries. Despite this significant use, very little research or commercial solutions exist that focus on the discovery of cloud services. This paper introduces CSRecommender—a search engine and recommender system specifically designed for the discovery of these services. To engineer the system to scale, we also describe the implementation of a Cloud Service Identifier which enables the system to crawl the Internet without human involvement. Finally, we examine the effectiveness and usefulness of the system using real-world use cases and users.
文摘User-analysis techniques are mainly used to recommend friends and information. This paper discusses the data characteristics of microblog users and describes a multidimensional user rec- ommendation algorithm that takes into account microblog length, relativity between microblog and users, and familiarity between users. The experimental results show that this multidi- mensional algorithm is more accurate than a traditional recom- mendation algorithm.
基金National Natural Science Foundation of China(No.61972080)Shanghai Rising-Star Program,China(No.19QA1400300)。
文摘With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately recommend POIs to users because the user-POI matrix is extremely sparse.In addition,a user's check-in activities are affected by many influential factors.However,most of existing studies capture only few influential factors.It is hard for them to be extended to incorporate other heterogeneous information in a unified way.To address these problems,we propose a meta-path-based deep representation learning(MPDRL)model for personalized POI recommendation.In this model,we design eight types of meta-paths to fully utilize the rich heterogeneous information in LBSNs for the representations of users and POIs,and deeply mine the correlations between users and POIs.To further improve the recommendation performance,we design an attention-based long short-term memory(LSTM)network to learn the importance of different influential factors on a user's specific check-in activity.To verify the effectiveness of our proposed method,we conduct extensive experiments on a real-world dataset,Foursquare.Experimental results show that the MPDRL model improves at least 16.97%and 23.55%over all comparison methods in terms of the metric Precision@N(Pre@N)and Recall@N(Rec@N)respectively.
文摘Over the years, there has been increasing growth in academic digital libraries. It has therefore become overwhelming for researchers to determine important research materials. In most existing research works that consider scholarly paper recommendation, the researcher’s preference is left out. In this paper, therefore, Frequent Pattern (FP) Growth Algorithm is employed on potential papers generated from the researcher’s preferences to create a list of ranked papers based on citation features. The purpose is to provide a recommender system that is user oriented. A walk through algorithm is implemented to generate all possible frequent patterns from the FP-tree after which an output of ordered recommended papers combining subjective and objective factors of the researchers is produced. Experimental results with a scholarly paper recommendation dataset show that the proposed method is very promising, as it outperforms recommendation baselines as measured with nDCG and MRR.