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 prefe...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.展开更多
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 aspe...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.展开更多
Aiming at the problem that the traditional collaborative filtering recommendation algorithm does not fully consider the influence of correlation between projects on recommendation accuracy,this paper introduces projec...Aiming at the problem that the traditional collaborative filtering recommendation algorithm does not fully consider the influence of correlation between projects on recommendation accuracy,this paper introduces project attribute fuzzy matrix,measures the project relevance through fuzzy clustering method,and classifies all project attributes.Then,the weight of the project relevance is introduced in the user similarity calculation,so that the nearest neighbor search is more accurate.In the prediction scoring section,considering the change of user interest with time,it is proposed to use the time weighting function to improve the influence of the time effect of the evaluation,so that the newer evaluation information in the system has a relatively large weight.The experimental results show that the improved algorithm improves the recommendation accuracy and improves the recommendation quality.展开更多
Faced with hundreds of thousands of news articles in the news websites,it is difficult for users to find the news articles they are interested in.Therefore,various news recommender systems were built.In the news recom...Faced with hundreds of thousands of news articles in the news websites,it is difficult for users to find the news articles they are interested in.Therefore,various news recommender systems were built.In the news recommendation,these news articles read by a user is typically in the form of a time sequence.However,traditional news recommendation algorithms rarely consider the time sequence characteristic of user browsing behaviors.Therefore,the performance of traditional news recommendation algorithms is not good enough in predicting the next news article which a user will read.To solve this problem,this paper proposes a time-ordered collaborative filtering recommendation algorithm(TOCF),which takes the time sequence characteristic of user behaviors into account.Besides,a new method to compute the similarity among different users,named time-dependent similarity,is proposed.To demonstrate the efficiency of our solution,extensive experiments are conducted along with detailed performance analysis.展开更多
In social tagging systems, users are allowed to label resources with tags, and thus the system builds a personalized tag vocabulary for every user based on their distinct preferences. In order to make the best of the ...In social tagging systems, users are allowed to label resources with tags, and thus the system builds a personalized tag vocabulary for every user based on their distinct preferences. In order to make the best of the personalized characteristic of users’ tagging behavior, firstly the transfer matrix is used in this paper, and the tag distributions of query resources are mapped to users’ query before the recommendation. Meanwhile, we find that only considering the user’s preference model, the method cannot recommend new tags for users. So we utilize the thought of collaborative filtering, and produce the recommend tags based on the query user and his/her nearest neighbors' preference models. The experiments conducted on the Delicious corpus show that our method combining transfer matrix with collaborative filtering produces better recommendation results.展开更多
Collaborative filtering(CF)methods are widely adopted by existing medical recommendation systems,which can help clinicians perform their work by seeking and recommending appropriate medical advice.However,privacy issu...Collaborative filtering(CF)methods are widely adopted by existing medical recommendation systems,which can help clinicians perform their work by seeking and recommending appropriate medical advice.However,privacy issue arises in this process as sensitive patient private data are collected by the recommendation server.Recently proposed privacy-preserving collaborative filtering methods,using computation-intensive cryptography techniques or data perturbation techniques are not appropriate in medical online service.The aim of this study is to address the privacy issues in the context of neighborhoodbased CF methods by proposing a Privacy Preserving Medical Recommendation(PPMR)algorithm,which can protect patients’treatment information and demographic information during online recommendation process without compromising recommendation accuracy and efficiency.The proposed algorithm includes two privacy preserving operations:Private Neighbor Selection and Neighborhood-based Differential Privacy Recommendation.Private Neighbor Selection is conducted on the basis of the notion of k-anonymity method,meaning that neighbors are privately selected for the target user according to his/her similarities with others.Neighborhood-based Differential Privacy Recommendation and a differential privacy mechanism are introduced in this operation to enhance the performance of recommendation.Our algorithm is evaluated using the real-world hospital EMRs dataset.Experimental results demonstrate that the proposed method achieves stable recommendation accuracy while providing comprehensive privacy for individual patients.展开更多
The era of the Internet of things(IoT)has marked a continued exploration of applications and services that can make people’s lives more convenient than ever before.However,the exploration of IoT services also means t...The era of the Internet of things(IoT)has marked a continued exploration of applications and services that can make people’s lives more convenient than ever before.However,the exploration of IoT services also means that people face unprecedented difficulties in spontaneously selecting the most appropriate services.Thus,there is a paramount need for a recommendation system that can help improve the experience of the users of IoT services to ensure the best quality of service.Most of the existing techniques—including collaborative filtering(CF),which is most widely adopted when building recommendation systems—suffer from rating sparsity and cold-start problems,preventing them from providing high quality recommendations.Inspired by the great success of deep learning in a wide range of fields,this work introduces a deep-learning-enabled autoencoder architecture to overcome the setbacks of CF recommendations.The proposed deep learning model is designed as a hybrid architecture with three key networks,namely autoencoder(AE),multilayered perceptron(MLP),and generalized matrix factorization(GMF).The model employs two AE networks to learn deep latent feature representations of users and items respectively and in parallel.Next,MLP and GMF networks are employed to model the linear and non-linear user-item interactions respectively with the extracted latent user and item features.Finally,the rating prediction is performed based on the idea of ensemble learning by fusing the output of the GMF and MLP networks.We conducted extensive experiments on two benchmark datasets,MoiveLens100K and MovieLens1M,using four standard evaluation metrics.Ablation experiments were conducted to confirm the validity of the proposed model and the contribution of each of its components in achieving better recommendation performance.Comparative analyses were also carried out to demonstrate the potential of the proposed model in gaining better accuracy than the existing CF methods with resistance to rating sparsity and cold-start problems.展开更多
In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of consider...In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users' ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage.展开更多
Many tourists who travel to explore different cultures and cities worldwide aim to find the best tourist sites,accommodation,and food according to their interests.This objective makes it harder for tourists to decide ...Many tourists who travel to explore different cultures and cities worldwide aim to find the best tourist sites,accommodation,and food according to their interests.This objective makes it harder for tourists to decide and plan where to go and what to do.Aside from hiring a local guide,an option which is beyond most travelers’budgets,the majority of sojourners nowadays use mobile devices to search for or recommend interesting sites on the basis of user reviews.Therefore,this work utilizes the prevalent recommender systems and mobile app technologies to overcome this issue.Accordingly,this study proposes location-aware personalized traveler assistance(LAPTA),a system which integrates user preferences and the global positioning system(GPS)to generate personalized and location-aware recommendations.That integration will enable the enhanced recommendation of the developed scheme relative to those from the traditional recommender systems used in customer ratings.Specifically,LAPTA separates the data obtained from Google locations into name and category tags.After the data separation,the system fetches the keywords from the user’s input according to the user’s past research behavior.The proposed system uses the K-Nearest algorithm to match the name and category tags with the user’s input to generate personalized suggestions.The system also provides suggestions on the basis of nearby popular attractions using the Google point of interest feature to enhance system usability.The experimental results showed that LAPTA could provide more reliable and accurate recommendations compared to the reviewed recommendation applications.展开更多
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...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.展开更多
The project review information plays an important role in the recommendation of review experts. In this paper, we aim to determine review expert’s rating by using the historical rating records and the final decision ...The project review information plays an important role in the recommendation of review experts. In this paper, we aim to determine review expert’s rating by using the historical rating records and the final decision results on the previous projects, and by means of some rules, we construct a rating matrix for projects and experts. For the data sparseness problem of the rating matrix and the 'cold start' problem of new expert recommendation, we assume that those projects/experts with similar topics have similar feature vectors and propose a review expert collaborative recommendation algorithm based on topic relationship. Firstly, we obtain topics of projects/experts based on latent Dirichlet allocation(LDA) model, and build the topic relationship network of projects/experts. Then, through the topic relationship between projects/experts, we find a neighbor collection which shares the largest similarity with target project/expert,and integrate the collection into the collaborative filtering recommendation algorithm based on matrix factorization. Finally, by learning the rating matrix to get feature vectors of the projects and experts, we can predict the ratings that a target project will give candidate review experts, and thus achieve the review expert recommendation. Experiments on real data set show that the proposed method could predict the review expert rating more effectively, and improve the recommendation effect of review experts.展开更多
Requirements engineering(RE)is among the most valuable and critical processes in software development.The quality of this process significantly affects the success of a software project.An important step in RE is requ...Requirements engineering(RE)is among the most valuable and critical processes in software development.The quality of this process significantly affects the success of a software project.An important step in RE is requirements elicitation,which involves collecting project-related requirements from different sources.Repositories of reusable requirements are typically important sources of an increasing number of reusable software requirements.However,the process of searching such repositories to collect valuable project-related requirements is time-consuming and difficult to perform accurately.Recommender systems have been widely recognized as an effective solution to such problem.Accordingly,this study proposes an effective hybrid content-based collaborative filtering recommendation approach.The proposed approach will support project stake-holders in mitigating the risk of missing requirements during requirements elicitation by identifying related requirements from software requirement repositories.The experimental results on the RALIC dataset demonstrate that the proposed approach considerably outperforms baseline collaborative filtering-based recom-mendation methods in terms of prediction accuracy and coverage in addition to mitigating the data sparsity and cold-start item problems.展开更多
The aim of a recommender system is filtering the enormous quantity of information to obtain useful information based on the user’s interest. Collaborative filtering is a technique which improves the efficiency of rec...The aim of a recommender system is filtering the enormous quantity of information to obtain useful information based on the user’s interest. Collaborative filtering is a technique which improves the efficiency of recommendation systems by considering the similarity between users. The similarity is based on the given rating to data by similar users. However, user’s interest may change over time. In this paper we propose an adaptive metric which considers the time in measuring the similarity of users. The experimental results show that our approach is more accurate than the traditional collaborative filtering algorithm.展开更多
Matrix factorization(MF) has been proved to be a very effective technique for collaborative filtering(CF),and hence has been widely adopted in today's recommender systems.Yet due to its lack of consideration of th...Matrix factorization(MF) has been proved to be a very effective technique for collaborative filtering(CF),and hence has been widely adopted in today's recommender systems.Yet due to its lack of consideration of the users' and items' local structures,the recommendation accuracy is not fully satisfied.By taking the trusts among users' and between items' effect on rating information into consideration,trust-aware recommendation systems(TARS) made a relatively good performance.In this paper,a method of incorporating trust into MF was proposed by building user-based and item-based implicit trust network under different contexts and implementing two implicit trust-based context-aware MF(ITMF)models.Experimental results proved the effectiveness of the methods.展开更多
Mobile edge computing(MEC)is an emerging technolohgy that extends cloud computing to the edge of a network.MEC has been applied to a variety of services.Specially,MEC can help to reduce network delay and improve the s...Mobile edge computing(MEC)is an emerging technolohgy that extends cloud computing to the edge of a network.MEC has been applied to a variety of services.Specially,MEC can help to reduce network delay and improve the service quality of recommendation systems.In a MEC-based recommendation system,users’rating data are collected and analyzed by the edge servers.If the servers behave dishonestly or break down,users’privacy may be disclosed.To solve this issue,we design a recommendation framework that applies local differential privacy(LDP)to collaborative filtering.In the proposed framework,users’rating data are perturbed to satisfy LDP and then released to the edge servers.The edge servers perform partial computing task by using the perturbed data.The cloud computing center computes the similarity between items by using the computing results generated by edge servers.We propose a data perturbation method to protect user’s original rating values,where the Harmony mechanism is modified so as to preserve the accuracy of similarity computation.And to enhance the protection of privacy,we propose two methods to protect both users’rating values and rating behaviors.Experimental results on real-world data demonstrate that the proposed methods perform better than existing differentially private recommendation methods.展开更多
At present, 5G network technology is being applied to various social network modes, and it can provide technical and traffic support for social networks. Potential friendship discovery technology in 5G-enabled social ...At present, 5G network technology is being applied to various social network modes, and it can provide technical and traffic support for social networks. Potential friendship discovery technology in 5G-enabled social networks is beneficial for users to make potential friends and expand their range of activities and social hierarchy, which is highly sought after in today's social networks and has great economic and application value. However, the sparsity of the dominant user association dataset in 5G-enabled social networks and the limitations of traditional collaborative filtering algorithms are two major challenges for the friend recommendation problem. Therefore, in order to overcome these problems regarding previous models, we propose a Hybrid Ensemble Multiple Collaborative Filtering Model (HEMCF) for discovering potential buddy relationships. The HEMCF model draws on a special autoencoder method that can effectively exploit the association matrix between friends and additional information to extract a hidden representation of users containing global structural information. Then, it uses the random walk-based graph embedding algorithm DeepWalk to extract another hidden representation of users in the buddy network containing local structural information. Finally, in the output module, the HEMCF model stacks and multiplies the two types of hidden representations of users to ensure that the information mentioned above is concentrated in the final output to generate the final prediction value. The magnitude of the prediction value represents the probability of the users being friends, with larger values representing a high probability of the two users being friends, and vice versa. Experimental results show that the proposed method boosts the accuracy of the relationship prediction over baselines on 3 real-world public datasets dramatically.展开更多
Recommender systems are rapidly transforming the digital world into intelligent information hubs.The valuable context information associated with the users’prior transactions has played a vital role in determining th...Recommender systems are rapidly transforming the digital world into intelligent information hubs.The valuable context information associated with the users’prior transactions has played a vital role in determining the user preferences for items or rating prediction.It has been a hot research topic in collaborative filtering-based recommender systems for the last two decades.This paper presents a novel Context Based Rating Prediction(CBRP)model with a unique similarity scoring estimation method.The proposed algorithm computes a context score for each candidate user to construct a similarity pool for the given subject user-item pair and intuitively choose the highly influential users to forecast the item ratings.The context scoring strategy has an inherent capability to incorporate multiple conditional factors to filter down the most relevant recommendations.Compared with traditional similarity estimation methods,CBRP makes it possible for the full use of neighboring collaborators’choice on various conditions.We conduct experiments on three publicly available datasets to evaluate our proposed method with random user-item pairs and got considerable improvement in prediction accuracy over the standard evaluation measures.Also,we evaluate prediction accuracy for every user-item pair in the system and the results show that our proposed framework has outperformed existing methods.展开更多
Collaborative filtering recommender systems often suffer from the 'Matchmaker' problem, which comes from the false assumption that users are counted only based on their similarity, and high similarity means go...Collaborative filtering recommender systems often suffer from the 'Matchmaker' problem, which comes from the false assumption that users are counted only based on their similarity, and high similarity means good advisers. In order to find good advisers for every user, a matchmaker's reliability mode based on the algorithm deriving from Hits is constructed, and it is applied in the proposed World Wide Web (WWW) collaborative recommendation system. Comparative experimental results also show that our approach obviously improves the substantial performance.展开更多
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)+2 种基金Hunan Provincial Social Science Achievement Review Committee results appraisal identification project(Xiang social assessment 2016JD05)Key Project of Hunan Provincial Social Science Achievement Review Committee(XSP 19ZD1005)the financial support provided by the Key Laboratory of Hunan Province for New Retail Virtual Reality Technology(2017TP1026).
文摘Aiming at the problem that the traditional collaborative filtering recommendation algorithm does not fully consider the influence of correlation between projects on recommendation accuracy,this paper introduces project attribute fuzzy matrix,measures the project relevance through fuzzy clustering method,and classifies all project attributes.Then,the weight of the project relevance is introduced in the user similarity calculation,so that the nearest neighbor search is more accurate.In the prediction scoring section,considering the change of user interest with time,it is proposed to use the time weighting function to improve the influence of the time effect of the evaluation,so that the newer evaluation information in the system has a relatively large weight.The experimental results show that the improved algorithm improves the recommendation accuracy and improves the recommendation quality.
基金supported by the Natural Science Foundation of China(No.61170174, 61370205)Tianjin Training plan of University Innovation Team(No.TD12-5016)
文摘Faced with hundreds of thousands of news articles in the news websites,it is difficult for users to find the news articles they are interested in.Therefore,various news recommender systems were built.In the news recommendation,these news articles read by a user is typically in the form of a time sequence.However,traditional news recommendation algorithms rarely consider the time sequence characteristic of user browsing behaviors.Therefore,the performance of traditional news recommendation algorithms is not good enough in predicting the next news article which a user will read.To solve this problem,this paper proposes a time-ordered collaborative filtering recommendation algorithm(TOCF),which takes the time sequence characteristic of user behaviors into account.Besides,a new method to compute the similarity among different users,named time-dependent similarity,is proposed.To demonstrate the efficiency of our solution,extensive experiments are conducted along with detailed performance analysis.
文摘In social tagging systems, users are allowed to label resources with tags, and thus the system builds a personalized tag vocabulary for every user based on their distinct preferences. In order to make the best of the personalized characteristic of users’ tagging behavior, firstly the transfer matrix is used in this paper, and the tag distributions of query resources are mapped to users’ query before the recommendation. Meanwhile, we find that only considering the user’s preference model, the method cannot recommend new tags for users. So we utilize the thought of collaborative filtering, and produce the recommend tags based on the query user and his/her nearest neighbors' preference models. The experiments conducted on the Delicious corpus show that our method combining transfer matrix with collaborative filtering produces better recommendation results.
文摘Collaborative filtering(CF)methods are widely adopted by existing medical recommendation systems,which can help clinicians perform their work by seeking and recommending appropriate medical advice.However,privacy issue arises in this process as sensitive patient private data are collected by the recommendation server.Recently proposed privacy-preserving collaborative filtering methods,using computation-intensive cryptography techniques or data perturbation techniques are not appropriate in medical online service.The aim of this study is to address the privacy issues in the context of neighborhoodbased CF methods by proposing a Privacy Preserving Medical Recommendation(PPMR)algorithm,which can protect patients’treatment information and demographic information during online recommendation process without compromising recommendation accuracy and efficiency.The proposed algorithm includes two privacy preserving operations:Private Neighbor Selection and Neighborhood-based Differential Privacy Recommendation.Private Neighbor Selection is conducted on the basis of the notion of k-anonymity method,meaning that neighbors are privately selected for the target user according to his/her similarities with others.Neighborhood-based Differential Privacy Recommendation and a differential privacy mechanism are introduced in this operation to enhance the performance of recommendation.Our algorithm is evaluated using the real-world hospital EMRs dataset.Experimental results demonstrate that the proposed method achieves stable recommendation accuracy while providing comprehensive privacy for individual patients.
基金supported by the deanship of Scientific Research at Prince Sattam Bin Abdulaziz University,Alkharj,Saudi Arabia through Research Proposal No.2020/01/17215。
文摘The era of the Internet of things(IoT)has marked a continued exploration of applications and services that can make people’s lives more convenient than ever before.However,the exploration of IoT services also means that people face unprecedented difficulties in spontaneously selecting the most appropriate services.Thus,there is a paramount need for a recommendation system that can help improve the experience of the users of IoT services to ensure the best quality of service.Most of the existing techniques—including collaborative filtering(CF),which is most widely adopted when building recommendation systems—suffer from rating sparsity and cold-start problems,preventing them from providing high quality recommendations.Inspired by the great success of deep learning in a wide range of fields,this work introduces a deep-learning-enabled autoencoder architecture to overcome the setbacks of CF recommendations.The proposed deep learning model is designed as a hybrid architecture with three key networks,namely autoencoder(AE),multilayered perceptron(MLP),and generalized matrix factorization(GMF).The model employs two AE networks to learn deep latent feature representations of users and items respectively and in parallel.Next,MLP and GMF networks are employed to model the linear and non-linear user-item interactions respectively with the extracted latent user and item features.Finally,the rating prediction is performed based on the idea of ensemble learning by fusing the output of the GMF and MLP networks.We conducted extensive experiments on two benchmark datasets,MoiveLens100K and MovieLens1M,using four standard evaluation metrics.Ablation experiments were conducted to confirm the validity of the proposed model and the contribution of each of its components in achieving better recommendation performance.Comparative analyses were also carried out to demonstrate the potential of the proposed model in gaining better accuracy than the existing CF methods with resistance to rating sparsity and cold-start problems.
基金Supported by the National Natural Science Foun-dation of China (60573095)
文摘In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users' ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage.
基金The authors would like to acknowledge the support of Prince Sultan University for paying the Article Processing Charges(APC)of this publication.
文摘Many tourists who travel to explore different cultures and cities worldwide aim to find the best tourist sites,accommodation,and food according to their interests.This objective makes it harder for tourists to decide and plan where to go and what to do.Aside from hiring a local guide,an option which is beyond most travelers’budgets,the majority of sojourners nowadays use mobile devices to search for or recommend interesting sites on the basis of user reviews.Therefore,this work utilizes the prevalent recommender systems and mobile app technologies to overcome this issue.Accordingly,this study proposes location-aware personalized traveler assistance(LAPTA),a system which integrates user preferences and the global positioning system(GPS)to generate personalized and location-aware recommendations.That integration will enable the enhanced recommendation of the developed scheme relative to those from the traditional recommender systems used in customer ratings.Specifically,LAPTA separates the data obtained from Google locations into name and category tags.After the data separation,the system fetches the keywords from the user’s input according to the user’s past research behavior.The proposed system uses the K-Nearest algorithm to match the name and category tags with the user’s input to generate personalized suggestions.The system also provides suggestions on the basis of nearby popular attractions using the Google point of interest feature to enhance system usability.The experimental results showed that LAPTA could provide more reliable and accurate recommendations compared to the reviewed recommendation applications.
基金the National Natural Science Foundation of China (Grant No. 61762031)Guangxi Key Research and Development Plan (Gui Science AB17195029, Gui Science AB18126006)+3 种基金Guangxi key Laboratory Fund of Embedded Technology and Intelligent System, 2017 Innovation Project of Guangxi Graduate Education (No. YCSW2017156)2018 Innovation Project of Guangxi Graduate Education (No. YCSW2018157)Subsidies for the Project of Promoting the Ability of Young and Middleaged Scientific Research in Universities and Colleges of Guangxi (KY2016YB184)2016 Guilin Science and Technology Project (Gui Science 2016010202).
文摘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.
基金supported by National Natural Science Foundation of China(611750 68,61472168,61163004)Natural Science Foundation of Yunnan Province(2013FA130)Talent Promotion Project of Ministry of Science and Technology(2014HE001)
文摘The project review information plays an important role in the recommendation of review experts. In this paper, we aim to determine review expert’s rating by using the historical rating records and the final decision results on the previous projects, and by means of some rules, we construct a rating matrix for projects and experts. For the data sparseness problem of the rating matrix and the 'cold start' problem of new expert recommendation, we assume that those projects/experts with similar topics have similar feature vectors and propose a review expert collaborative recommendation algorithm based on topic relationship. Firstly, we obtain topics of projects/experts based on latent Dirichlet allocation(LDA) model, and build the topic relationship network of projects/experts. Then, through the topic relationship between projects/experts, we find a neighbor collection which shares the largest similarity with target project/expert,and integrate the collection into the collaborative filtering recommendation algorithm based on matrix factorization. Finally, by learning the rating matrix to get feature vectors of the projects and experts, we can predict the ratings that a target project will give candidate review experts, and thus achieve the review expert recommendation. Experiments on real data set show that the proposed method could predict the review expert rating more effectively, and improve the recommendation effect of review experts.
文摘Requirements engineering(RE)is among the most valuable and critical processes in software development.The quality of this process significantly affects the success of a software project.An important step in RE is requirements elicitation,which involves collecting project-related requirements from different sources.Repositories of reusable requirements are typically important sources of an increasing number of reusable software requirements.However,the process of searching such repositories to collect valuable project-related requirements is time-consuming and difficult to perform accurately.Recommender systems have been widely recognized as an effective solution to such problem.Accordingly,this study proposes an effective hybrid content-based collaborative filtering recommendation approach.The proposed approach will support project stake-holders in mitigating the risk of missing requirements during requirements elicitation by identifying related requirements from software requirement repositories.The experimental results on the RALIC dataset demonstrate that the proposed approach considerably outperforms baseline collaborative filtering-based recom-mendation methods in terms of prediction accuracy and coverage in addition to mitigating the data sparsity and cold-start item problems.
文摘The aim of a recommender system is filtering the enormous quantity of information to obtain useful information based on the user’s interest. Collaborative filtering is a technique which improves the efficiency of recommendation systems by considering the similarity between users. The similarity is based on the given rating to data by similar users. However, user’s interest may change over time. In this paper we propose an adaptive metric which considers the time in measuring the similarity of users. The experimental results show that our approach is more accurate than the traditional collaborative filtering algorithm.
文摘Matrix factorization(MF) has been proved to be a very effective technique for collaborative filtering(CF),and hence has been widely adopted in today's recommender systems.Yet due to its lack of consideration of the users' and items' local structures,the recommendation accuracy is not fully satisfied.By taking the trusts among users' and between items' effect on rating information into consideration,trust-aware recommendation systems(TARS) made a relatively good performance.In this paper,a method of incorporating trust into MF was proposed by building user-based and item-based implicit trust network under different contexts and implementing two implicit trust-based context-aware MF(ITMF)models.Experimental results proved the effectiveness of the methods.
基金supported by National Natural Science Foundation of China(No.61871037)supported by Natural Science Foundation of Beijing(No.M21035).
文摘Mobile edge computing(MEC)is an emerging technolohgy that extends cloud computing to the edge of a network.MEC has been applied to a variety of services.Specially,MEC can help to reduce network delay and improve the service quality of recommendation systems.In a MEC-based recommendation system,users’rating data are collected and analyzed by the edge servers.If the servers behave dishonestly or break down,users’privacy may be disclosed.To solve this issue,we design a recommendation framework that applies local differential privacy(LDP)to collaborative filtering.In the proposed framework,users’rating data are perturbed to satisfy LDP and then released to the edge servers.The edge servers perform partial computing task by using the perturbed data.The cloud computing center computes the similarity between items by using the computing results generated by edge servers.We propose a data perturbation method to protect user’s original rating values,where the Harmony mechanism is modified so as to preserve the accuracy of similarity computation.And to enhance the protection of privacy,we propose two methods to protect both users’rating values and rating behaviors.Experimental results on real-world data demonstrate that the proposed methods perform better than existing differentially private recommendation methods.
基金supported by National Key R&D Program of China(Grant No:2018YFC0407904)Key Research Projects of Tibet Autonomous Region for Innovation and Entrepreneur(Grant No.Z2016D01G01/01).
文摘At present, 5G network technology is being applied to various social network modes, and it can provide technical and traffic support for social networks. Potential friendship discovery technology in 5G-enabled social networks is beneficial for users to make potential friends and expand their range of activities and social hierarchy, which is highly sought after in today's social networks and has great economic and application value. However, the sparsity of the dominant user association dataset in 5G-enabled social networks and the limitations of traditional collaborative filtering algorithms are two major challenges for the friend recommendation problem. Therefore, in order to overcome these problems regarding previous models, we propose a Hybrid Ensemble Multiple Collaborative Filtering Model (HEMCF) for discovering potential buddy relationships. The HEMCF model draws on a special autoencoder method that can effectively exploit the association matrix between friends and additional information to extract a hidden representation of users containing global structural information. Then, it uses the random walk-based graph embedding algorithm DeepWalk to extract another hidden representation of users in the buddy network containing local structural information. Finally, in the output module, the HEMCF model stacks and multiplies the two types of hidden representations of users to ensure that the information mentioned above is concentrated in the final output to generate the final prediction value. The magnitude of the prediction value represents the probability of the users being friends, with larger values representing a high probability of the two users being friends, and vice versa. Experimental results show that the proposed method boosts the accuracy of the relationship prediction over baselines on 3 real-world public datasets dramatically.
基金This work is supported by National Natural Science Foundation of China(No.61672133)Sichuan Science and Technology Program(No.2019YFG0535)the 111 Project(No.B17008).
文摘Recommender systems are rapidly transforming the digital world into intelligent information hubs.The valuable context information associated with the users’prior transactions has played a vital role in determining the user preferences for items or rating prediction.It has been a hot research topic in collaborative filtering-based recommender systems for the last two decades.This paper presents a novel Context Based Rating Prediction(CBRP)model with a unique similarity scoring estimation method.The proposed algorithm computes a context score for each candidate user to construct a similarity pool for the given subject user-item pair and intuitively choose the highly influential users to forecast the item ratings.The context scoring strategy has an inherent capability to incorporate multiple conditional factors to filter down the most relevant recommendations.Compared with traditional similarity estimation methods,CBRP makes it possible for the full use of neighboring collaborators’choice on various conditions.We conduct experiments on three publicly available datasets to evaluate our proposed method with random user-item pairs and got considerable improvement in prediction accuracy over the standard evaluation measures.Also,we evaluate prediction accuracy for every user-item pair in the system and the results show that our proposed framework has outperformed existing methods.
文摘Collaborative filtering recommender systems often suffer from the 'Matchmaker' problem, which comes from the false assumption that users are counted only based on their similarity, and high similarity means good advisers. In order to find good advisers for every user, a matchmaker's reliability mode based on the algorithm deriving from Hits is constructed, and it is applied in the proposed World Wide Web (WWW) collaborative recommendation system. Comparative experimental results also show that our approach obviously improves the substantial performance.