This paper derives a square-root information-type filtering algorithm for nonlinear multi-sensor fusion problems using the cubature Kalman filter theory. The resulting filter is called the square-root cubature Informa...This paper derives a square-root information-type filtering algorithm for nonlinear multi-sensor fusion problems using the cubature Kalman filter theory. The resulting filter is called the square-root cubature Information filter (SCIF). The SCIF propagates the square-root information matrices derived from numerically stable matrix operations and is therefore numerically robust. The SCIF is applied to a highly maneuvering target tracking problem in a distributed sensor network with feedback. The SCIF’s performance is finally compared with the regular cubature information filter and the traditional extended information filter. The results, presented herein, indicate that the SCIF is the most reliable of all three filters and yields a more accurate estimate than the extended information filter.展开更多
Aimed at information overload and personalized characteristic of user information requirement, this letter presents a type of multilevel index structure and algorithm which is applied to large scale information filter...Aimed at information overload and personalized characteristic of user information requirement, this letter presents a type of multilevel index structure and algorithm which is applied to large scale information filtering system and has better performance and stronger scalability.展开更多
Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the k...Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.展开更多
Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants t...Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.展开更多
Recommendation services become an essential and hot research topic for researchers nowadays.Social data such asReviews play an important role in the recommendation of the products.Improvement was achieved by deep lear...Recommendation services become an essential and hot research topic for researchers nowadays.Social data such asReviews play an important role in the recommendation of the products.Improvement was achieved by deep learning approaches for capturing user and product information from a short text.However,such previously used approaches do not fairly and efficiently incorporate users’preferences and product characteristics.The proposed novel Hybrid Deep Collaborative Filtering(HDCF)model combines deep learning capabilities and deep interaction modeling with high performance for True Recommendations.To overcome the cold start problem,the new overall rating is generated by aggregating the Deep Multivariate Rating DMR(Votes,Likes,Stars,and Sentiment scores of reviews)from different external data sources because different sites have different rating scores about the same product that make confusion for the user to make a decision,either product is truly popular or not.The proposed novel HDCF model consists of four major modules such as User Product Attention,Deep Collaborative Filtering,Neural Sentiment Classifier,and Deep Multivariate Rating(UPA-DCF+NSC+DMR)to solve the addressed problems.Experimental results demonstrate that our novel model is outperforming state-of-the-art IMDb,Yelp2013,and Yelp2014 datasets for the true top-n recommendation of products using HDCF to increase the accuracy,confidence,and trust of recommendation services.展开更多
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.展开更多
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.展开更多
Information filtering (IF) systems are important for personalized information service. However, most current IF systems suffer from low quality and long training time. In this paper, a refined evolving information fil...Information filtering (IF) systems are important for personalized information service. However, most current IF systems suffer from low quality and long training time. In this paper, a refined evolving information filtering method is presented. This method describes user's information need from multi-aspects and improves filtering quality through a process like natural selection. Experimental result shows this method can shorten training time, improve filtering quality, and reduce the relevance between filtering results and training sequence.展开更多
This paper develops a fast filtering algorithm based on vibration systems theory and neural information exchange approach. The characters, including the derivation process and parameter analysis, are discussed and the...This paper develops a fast filtering algorithm based on vibration systems theory and neural information exchange approach. The characters, including the derivation process and parameter analysis, are discussed and the feasibility and the effectiveness are testified by the filtering performance compared with various filtering methods, such as the fast wavelet transform algorithm, the particle filtering method and our previously developed single degree of freedom vibration system filtering algorithm, according to simulation and practical approaches. Meanwhile, the comparisons indicate that a significant advantage of the proposed fast filtering algorithm is its extremely fast filtering speed with good filtering perfi^rmance. Further, the developed fast filtering algorithm is applied to the navigation and positioning system of the micro motion robot, which is a high real-time requirement for the signals preprocessing. Then, the preprocessing data is used to estimate the heading angle error and the attitude angle error of the micro motion robot. The estimation experiments illustrate the high practicality of the proposed fast filtering algorithm.展开更多
Using similar single-difference methodology(SSDM) to solve the deformation values of the monitoring points, there is unstability of the deformation information series, at sometimes.In order to overcome this shortcomin...Using similar single-difference methodology(SSDM) to solve the deformation values of the monitoring points, there is unstability of the deformation information series, at sometimes.In order to overcome this shortcoming, Kalman filtering algorithm for this series is established,and its correctness and validity are verified with the test data obtained on the movable platform in plane. The results show that Kalman filtering can improve the correctness, reliability and stability of the deformation information series.展开更多
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.展开更多
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.展开更多
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.展开更多
Automated collaborative filtering has become a popular technique for reducing information overload. We have developed a new method for recommending items using multiple agents. The agents were established by employing...Automated collaborative filtering has become a popular technique for reducing information overload. We have developed a new method for recommending items using multiple agents. The agents were established by employing the fuzzy C-means clustering technique. We employ these agents collaborating each other to get recommendation for users. The results were evaluated by using MovieLens movie's rating data. It is shown that the algorithm is an effective metrics in collaborative filtering.展开更多
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.展开更多
With the rapid development of the Internet,the amount of data recorded on the Internet has increased dramatically.It is becoming more and more urgent to effectively obtain the specific information we need from the vas...With the rapid development of the Internet,the amount of data recorded on the Internet has increased dramatically.It is becoming more and more urgent to effectively obtain the specific information we need from the vast ocean of data.In this study,we propose a novel collaborative filtering algorithm for generating recommendations in e-commerce.This study has two main innovations.First,we propose a mechanismthat embeds temporal behavior information to find a neighbor set in which each neighbor has a very significant impact on the current user or item.Second,we propose a novel collaborative filtering algorithm by injecting the neighbor set into probability matrix factorization.We compared the proposed method with several state-of-the-art alternatives on real datasets.The experimental results show that our proposed method outperforms the prevailing approaches.展开更多
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.展开更多
When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes ...When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.展开更多
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.展开更多
文摘This paper derives a square-root information-type filtering algorithm for nonlinear multi-sensor fusion problems using the cubature Kalman filter theory. The resulting filter is called the square-root cubature Information filter (SCIF). The SCIF propagates the square-root information matrices derived from numerically stable matrix operations and is therefore numerically robust. The SCIF is applied to a highly maneuvering target tracking problem in a distributed sensor network with feedback. The SCIF’s performance is finally compared with the regular cubature information filter and the traditional extended information filter. The results, presented herein, indicate that the SCIF is the most reliable of all three filters and yields a more accurate estimate than the extended information filter.
基金Supported by key project 972044 of China Academy of Engineering Physics
文摘Aimed at information overload and personalized characteristic of user information requirement, this letter presents a type of multilevel index structure and algorithm which is applied to large scale information filtering system and has better performance and stronger scalability.
基金This work is supported by National Science Foundatinon Grant60273035"Software Performance Assure and Recovery"
文摘Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.
基金supported by the National Natural Science Foundation of China(Grant No.62102449)awarded to W.J.Wang.
文摘Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.
文摘Recommendation services become an essential and hot research topic for researchers nowadays.Social data such asReviews play an important role in the recommendation of the products.Improvement was achieved by deep learning approaches for capturing user and product information from a short text.However,such previously used approaches do not fairly and efficiently incorporate users’preferences and product characteristics.The proposed novel Hybrid Deep Collaborative Filtering(HDCF)model combines deep learning capabilities and deep interaction modeling with high performance for True Recommendations.To overcome the cold start problem,the new overall rating is generated by aggregating the Deep Multivariate Rating DMR(Votes,Likes,Stars,and Sentiment scores of reviews)from different external data sources because different sites have different rating scores about the same product that make confusion for the user to make a decision,either product is truly popular or not.The proposed novel HDCF model consists of four major modules such as User Product Attention,Deep Collaborative Filtering,Neural Sentiment Classifier,and Deep Multivariate Rating(UPA-DCF+NSC+DMR)to solve the addressed problems.Experimental results demonstrate that our novel model is outperforming state-of-the-art IMDb,Yelp2013,and Yelp2014 datasets for the true top-n recommendation of products using HDCF to increase the accuracy,confidence,and trust of recommendation services.
文摘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 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.
基金he National '863' High-Tech Programme of China (No. 863-306- ZT01- 03- 1 ) ,IBM China Research Lab and Huawei Enterprise Fundi
文摘Information filtering (IF) systems are important for personalized information service. However, most current IF systems suffer from low quality and long training time. In this paper, a refined evolving information filtering method is presented. This method describes user's information need from multi-aspects and improves filtering quality through a process like natural selection. Experimental result shows this method can shorten training time, improve filtering quality, and reduce the relevance between filtering results and training sequence.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60901074,51075092,61005076,and 61175107)the National High Technology Research and Development Program of China(Grant No.2007AA042105)the Natural Science Foundation of Heilongjiang Province,China(Grant No.E200903)
文摘This paper develops a fast filtering algorithm based on vibration systems theory and neural information exchange approach. The characters, including the derivation process and parameter analysis, are discussed and the feasibility and the effectiveness are testified by the filtering performance compared with various filtering methods, such as the fast wavelet transform algorithm, the particle filtering method and our previously developed single degree of freedom vibration system filtering algorithm, according to simulation and practical approaches. Meanwhile, the comparisons indicate that a significant advantage of the proposed fast filtering algorithm is its extremely fast filtering speed with good filtering perfi^rmance. Further, the developed fast filtering algorithm is applied to the navigation and positioning system of the micro motion robot, which is a high real-time requirement for the signals preprocessing. Then, the preprocessing data is used to estimate the heading angle error and the attitude angle error of the micro motion robot. The estimation experiments illustrate the high practicality of the proposed fast filtering algorithm.
文摘Using similar single-difference methodology(SSDM) to solve the deformation values of the monitoring points, there is unstability of the deformation information series, at sometimes.In order to overcome this shortcoming, Kalman filtering algorithm for this series is established,and its correctness and validity are verified with the test data obtained on the movable platform in plane. The results show that Kalman filtering can improve the correctness, reliability and stability of the deformation information series.
基金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 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.
基金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.
基金Project supported by the National Natural Science Foundation of China (Grant No.69975001)
文摘Automated collaborative filtering has become a popular technique for reducing information overload. We have developed a new method for recommending items using multiple agents. The agents were established by employing the fuzzy C-means clustering technique. We employ these agents collaborating each other to get recommendation for users. The results were evaluated by using MovieLens movie's rating data. It is shown that the algorithm is an effective metrics in collaborative filtering.
文摘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 National Natural Science Foundation of China under Grant Nos.81873915,61702225 and 61806026Ministry of Science and Technology Key Research and Development Program of China under Grant No.2018YFC0116902+3 种基金by the Natural Science Foundation of Jiangsu Province under Grant No.BK20180956by the 2018 Six Talent Peaks Project of Jiangsu Province under Grant No.XYDXX-127by the Science and Technology demonstration project of social development of Wuxi under Grant WX18IVJN002by the Philosophy and Social Science Foundation of Jiangsu Province(18YSC009).
文摘With the rapid development of the Internet,the amount of data recorded on the Internet has increased dramatically.It is becoming more and more urgent to effectively obtain the specific information we need from the vast ocean of data.In this study,we propose a novel collaborative filtering algorithm for generating recommendations in e-commerce.This study has two main innovations.First,we propose a mechanismthat embeds temporal behavior information to find a neighbor set in which each neighbor has a very significant impact on the current user or item.Second,we propose a novel collaborative filtering algorithm by injecting the neighbor set into probability matrix factorization.We compared the proposed method with several state-of-the-art alternatives on real datasets.The experimental results show that our proposed method outperforms the prevailing approaches.
文摘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.
基金supported by Phase 4,Software Engineering(Software Service Engineering)under Grant No.XXKZD1301
文摘When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.
基金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.