Attackers inject the designed adversarial sample into the target recommendation system to achieve illegal goals,seriously affecting the security and reliability of the recommendation system.It is difficult for attacke...Attackers inject the designed adversarial sample into the target recommendation system to achieve illegal goals,seriously affecting the security and reliability of the recommendation system.It is difficult for attackers to obtain detailed knowledge of the target model in actual scenarios,so using gradient optimization to generate adversarial samples in the local surrogate model has become an effective black‐box attack strategy.However,these methods suffer from gradients falling into local minima,limiting the transferability of the adversarial samples.This reduces the attack's effectiveness and often ignores the imperceptibility of the generated adversarial samples.To address these challenges,we propose a novel attack algorithm called PGMRS‐KL that combines pre‐gradient‐guided momentum gradient optimization strategy and fake user generation constrained by Kullback‐Leibler divergence.Specifically,the algorithm combines the accumulated gradient direction with the previous step's gradient direction to iteratively update the adversarial samples.It uses KL loss to minimize the distribution distance between fake and real user data,achieving high transferability and imperceptibility of the adversarial samples.Experimental results demonstrate the superiority of our approach over state‐of‐the‐art gradient‐based attack algorithms in terms of attack transferability and the generation of imperceptible fake user data.展开更多
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.展开更多
Recommender system (RS) has become a very important factor in many eCommerce sites. In our daily life, we rely on the recommendation from other persons either by word of mouth, recommendation letters, movie, item and ...Recommender system (RS) has become a very important factor in many eCommerce sites. In our daily life, we rely on the recommendation from other persons either by word of mouth, recommendation letters, movie, item and book reviews printed in newspapers, etc. The typical Recommender Systems are software tools and techniques that provide support to people by identifying interesting products and services in online store. It also provides a recommendation for certain users who search for the recommendations. The most important open challenge in Collaborative filtering recommender system is the cold start problem. If the adequate or sufficient information is not available for a new item or users, the recommender system runs into the cold start problem. To increase the usefulness of collaborative recommender systems, it could be desirable to eliminate the challenge such as cold start problem. Revealing the community structures is crucial to understand and more important with the increasing popularity of online social networks. The community detection is a key issue in social network analysis in which nodes of the communities are tightly connected each other and loosely connected between other communities. Many algorithms like Givan-Newman algorithm, modularity maximization, leading eigenvector, walk trap, etc., are used to detect the communities in the networks. To test the community division is meaningful we define a quality function called modularity. Modularity is that the links within a community are higher than the expected links in those communities. In this paper, we try to give a solution to the cold-start problem based on community detection algorithm that extracts the community from the social networks and identifies the similar users on that network. Hence, within the proposed work several intrinsic details are taken as a rule of thumb to boost the results higher. Moreover, the simulation experiment was taken to solve the cold start problem.展开更多
Recommender systems are similar to an informationfiltering system that helps identify items that best satisfy the users’demands based on their pre-ference profiles.Context-aware recommender systems(CARSs)and multi-cr...Recommender systems are similar to an informationfiltering system that helps identify items that best satisfy the users’demands based on their pre-ference profiles.Context-aware recommender systems(CARSs)and multi-criteria recommender systems(MCRSs)are extensions of traditional recommender sys-tems.CARSs have integrated additional contextual information such as time,place,and so on for providing better recommendations.However,the majority of CARSs use ratings as a unique criterion for building communities.Meanwhile,MCRSs utilize user preferences in multiple criteria to better generate recommen-dations.Up to now,how to exploit context in MCRSs is still an open issue.This paper proposes a novel approach,which relies on deep learning for context-aware multi-criteria recommender systems.We apply deep neural network(DNN)mod-els to predict the context-aware multi-criteria ratings and learn the aggregation function.We conduct experiments to evaluate the effect of this approach on the real-world dataset.A significant result is that our method outperforms other state-of-the-art methods for recommendation effectiveness.展开更多
1 Introduction Large language models(LLMs)have achieved remarkable progress in the field of natural language processing(NLP),showing impressive abilities to generate human-like texts for a broad range of tasks[1].Cons...1 Introduction Large language models(LLMs)have achieved remarkable progress in the field of natural language processing(NLP),showing impressive abilities to generate human-like texts for a broad range of tasks[1].Consequently,recent works start to investigate the application of LLMs in recommender systems.They adopt LLMs for various recommendation tasks,and show promising performance from different aspects(e.g.,user profiling).In this letter,we mainly focus on promoting the sample efficiency of recommender systems by involving large language models.展开更多
Blockchain technology has gained traction in Food Supply Chain Management(FSCM),enhancing traceability and transparency.The existing deployments of public or private blockchains face issues in achieving an optimal bal...Blockchain technology has gained traction in Food Supply Chain Management(FSCM),enhancing traceability and transparency.The existing deployments of public or private blockchains face issues in achieving an optimal balance between transparency and decentralization.This work proposes a hybrid blockchain model complemented by an Access Control(AC)mechanism to bolster security,reliability,and usability within FSCM systems.Furthermore,the integration of a recommender system is proposed to utilize data analytics and machine learning for personalizing product offerings and optimizing inventory management,aiming to boost efficiency and consumer satisfaction.The synergy between the hybrid blockchain framework and the recommender system is anticipated to cultivate a more engaged,efficient,and gratified supply chain ecosystem.The model significantly enhances monitoring in 30%of the use cases and supports transparency in a quarter.It also reduces vulnerability cases by 20%.Inventory management is markedly improved,reducing overstock by 25%,confirming the effectiveness of the proposed hybrid blockchain approach.展开更多
The exponential growth of over-the-top(OTT)entertainment has fueled a surge in content consumption across diverse formats,especially in regional Indian languages.With the Indian film industry producing over 1500 films...The exponential growth of over-the-top(OTT)entertainment has fueled a surge in content consumption across diverse formats,especially in regional Indian languages.With the Indian film industry producing over 1500 films annually in more than 20 languages,personalized recommendations are essential to highlight relevant content.To overcome the limitations of traditional recommender systems-such as static latent vectors,poor handling of cold-start scenarios,and the absence of uncertainty modeling-we propose a deep Collaborative Neural Generative Embedding(C-NGE)model.C-NGE dynamically learns user and item representations by integrating rating information and metadata features in a unified neural framework.It uses metadata as sampled noise and applies the reparameterization trick to capture latent patterns better and support predictions for new users or items without retraining.We evaluate CNGE on the Indian Regional Movies(IRM)dataset,along with MovieLens 100 K and 1 M.Results show that our model consistently outperforms several existing methods,and its extensibility allows for incorporating additional signals like user reviews and multimodal data to enhance recommendation quality.展开更多
Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that lever...Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that leverages user-item interactions to generate recommendations.However,it struggles with challenges like the cold-start problem,scalability issues,and data sparsity.To address these limitations,we develop a Graph Convolutional Networks(GCNs)model that captures the complex network of interactions between users and items,identifying subtle patterns that traditional methods may overlook.We integrate this GCNs model into a federated learning(FL)framework,enabling themodel to learn fromdecentralized datasets.This not only significantly enhances user privacy—a significant improvement over conventionalmodels but also reassures users about the safety of their data.Additionally,by securely incorporating demographic information,our approach further personalizes recommendations and mitigates the coldstart issue without compromising user data.We validate our RSs model using the openMovieLens dataset and evaluate its performance across six key metrics:Precision,Recall,Area Under the Receiver Operating Characteristic Curve(ROC-AUC),F1 Score,Normalized Discounted Cumulative Gain(NDCG),and Mean Reciprocal Rank(MRR).The experimental results demonstrate significant enhancements in recommendation quality,underscoring that combining GCNs with CF in a federated setting provides a transformative solution for advanced recommendation systems.展开更多
Previous studies on the behavioral implications of recommender systems suggest that consumer preferences after consumption are malleable and tend to shift towards the ratings presented by a recommender system because ...Previous studies on the behavioral implications of recommender systems suggest that consumer preferences after consumption are malleable and tend to shift towards the ratings presented by a recommender system because of the anchoring effects.Drawing upon the literature on consumer satisfaction,we show that such a view on the anchoring effects of recommender systems is incomplete.Apart from the assimilation effects that pull the consumers’preferences towards the anchor,the contrast effects may shift their preferences in the other direction.Therefore,we theoretically hypothesize that the impacts of recommendations on consumers’constructed preferences are dependent on the level of deviation of the presented rating.The hypotheses are validated through a laboratory experiment.Our findings extend the existing literature on behavioral implications of recommender systems and provide a more comprehensive theoretical lens for understanding the anchoring effects,which may offer helpful insights for improving the design and use of recommender systems.展开更多
Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been ...Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.展开更多
A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking in...A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking into account the order of transactions.This work will present the implementation of sequence pattern mining for recommender systems within the domain of e-com-merce.This work will execute the Systolic tree algorithm for mining the frequent patterns to yield feasible rules for the recommender system.The feature selec-tion's objective is to pick a feature subset having the least feature similarity as well as highest relevancy with the target class.This will mitigate the feature vector's dimensionality by eliminating redundant,irrelevant,or noisy data.This work pre-sents a new hybrid recommender system based on optimized feature selection and systolic tree.The features were extracted using Term Frequency-Inverse Docu-ment Frequency(TF-IDF),feature selection with the utilization of River Forma-tion Dynamics(RFD),and the Particle Swarm Optimization(PSO)algorithm.The systolic tree is used for pattern mining,and based on this,the recommendations are given.The proposed methods were evaluated using the MovieLens dataset,and the experimental outcomes confirmed the efficiency of the techniques.It was observed that the RFD feature selection with systolic tree frequent pattern mining with collaborativefiltering,the precision of 0.89 was achieved.展开更多
With the rapid development of social network in recent years, a huge number of social information has been produced. As traditional recommender systems often face data sparsity and cold-start problem, the use of socia...With the rapid development of social network in recent years, a huge number of social information has been produced. As traditional recommender systems often face data sparsity and cold-start problem, the use of social information has attracted many researchers' attention to improve the prediction accuracy of recommender systems. Social trust and social relation have been proven useful to improve the performance of recommendation. Based on the classic collaborative filtering technique, we propose a PCCTTF recommender method that takes the rating time of users, social trust among users, and item tags into consideration, then do the item recommending. Experimental results show that the PCCTTF method has better prediction accuracy than classical collaborative filtering technique and the state-of-the-art recommender methods, and can also effectively alleviate data sparsity and cold-start problem. Furthermore, the PCCTTF method has better performance than all the compared methods while counting against shilling attacks.展开更多
Knowledge graphs(KGs)have garnered significant attention in recommender systems as auxiliary information.Most existing studies consider an item as an entity of a KG and utilize graph neural networks to learn item repr...Knowledge graphs(KGs)have garnered significant attention in recommender systems as auxiliary information.Most existing studies consider an item as an entity of a KG and utilize graph neural networks to learn item representations.However,two challenges exist regarding these algorithms:1)they provide recommended results but fail to explain the reason for which they are preferred by users;2)user vector representations are concentrated in a small area,thus resulting in similar mass recommendations.In this study,we focus on learning fine-grained user preferences(LFUP)via user-item interactions and using KGs that can capture the reason for which users interact with items.Additionally,a personalized recommendation task is achieved by optimizing the distribution of users in the vector space.User preferences are modeled by using historical interaction items pertaining to users and important relations within the KG.Subsequently,information from two views is aggregated to reduce the semantic differences between them.Finally,user preferences are personalized by maximizing the spatial distance between various user representations via contrastive learning.Experiments on public datasets prove that LFUP significantly benefits user-preference modeling and personalized recommendations.展开更多
With the increasing of data on the internet, data analysis has become inescapable to gain time and efficiency, especially in bibliographic information retrieval systems. We can estimate the number of actual scientific...With the increasing of data on the internet, data analysis has become inescapable to gain time and efficiency, especially in bibliographic information retrieval systems. We can estimate the number of actual scientific journals points to around 40</span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">,</span></span></span><span><span><span style="font-family:""><span style="font-family:Verdana;">000 with about four million articles published each year. Machine learning and deep learning applied to recommender systems had become unavoidable whether in industry or in research. In this current, we propose an optimized interface for bibliographic information retrieval as a </span><span style="font-family:Verdana;">running example, which allows different kind of researchers to find their</span><span style="font-family:Verdana;"> needs following some relevant criteria through natural language understanding. Papers indexed in Web of Science and Scopus are in high demand. Natural language including text and linguistic-based techniques, such as tokenization, named entity recognition, syntactic and semantic analysis, are used to express natural language queries. Our Interface uses association rules to find more related papers for recommendation. Spanning trees are challenged to optimize the search process of the system.展开更多
Personalized social matching systems can be seen as recommender systems that recommend people to others in the social networks, with desirable skills/characteristics. In this work, an algorithm based on Ant Colony is ...Personalized social matching systems can be seen as recommender systems that recommend people to others in the social networks, with desirable skills/characteristics. In this work, an algorithm based on Ant Colony is proposed to solve the optimization problem of clustering/matching people in a social network specifically designed for this purpose;during this process, their personal characteristics and preferences (and the degree of importance thereof) are taken into account. The numerical results indicate that the proposed algorithm can successfully perform clustering with a variable number of individuals.展开更多
A blockchain is a digitized, decentralized, public ledger of all cryptocurrency transactions. The blockchain is transforming industries by enabling innovative business practices. Its revolutionary power has permeated ...A blockchain is a digitized, decentralized, public ledger of all cryptocurrency transactions. The blockchain is transforming industries by enabling innovative business practices. Its revolutionary power has permeated areas such as bank-ing, financing, trading, manufacturing, supply chain management, healthcare, and government. Blockchain and the Internet of Things (BIOT) apply the us-age of blockchain in the inter-IOT communication system, therefore, security and privacy factors are achievable. The integration of blockchain technology and IoT creates modern decentralized systems. The BIOT models can be ap-plied by various industries including e-commerce to promote decentralization, scalability, and security. This research calls for innovative and advanced re-search on Blockchain and recommendation systems. We aim at building a se-cure and trust-based system using the advantages of blockchain-supported secure multiparty computation by adding smart contracts with the main blockchain protocol. Combining the recommendation systems and blockchain technology allows online activities to be more secure and private. A system is constructed for enterprises to collaboratively create a secure database and host a steadily updated model using smart contract systems. Learning case studies include a model to recommend movies to users. The accuracy of models is evaluated by an incentive mechanism that offers a fully trust-based recom-mendation system with acceptable performance.展开更多
In this era of digital domination,it is fit to say that individuals are more inclined towards viewership on online platforms due to the wide variety and the scope of individual preferences it provides.In the past few ...In this era of digital domination,it is fit to say that individuals are more inclined towards viewership on online platforms due to the wide variety and the scope of individual preferences it provides.In the past few years,there has been a massive growth in the popularity of Over-The-Top platforms,with an increasing number of consumers adapting to them.The Covid-19 pandemic has also caused the proliferation of these services as people are restricted to their homes.Consumers are often in a dilemma about which subscription plan to choose,and this iswhere a recommendation systemmakes their task easy.The Subscription recommendation system allows potential users to pick the most suitable and convenient plan for their daily consumption from diverse OTT platforms.The economic equilibrium behind allocating these resources follows a unique voting and bidding system propped by us in this paper.The systemis dependent on two types of individuals,type 1 seeking the recommendation plan,and type 2 suggesting it.In our study,the system collaborates with the latterwho participate in voting and invest/bid in the available options,keeping in mind the user preferences.This architecture runs on an interface where the candidates can login to participate at their convenience.As a result,selective participants are awarded monetary gains considering the rules of the suggested mechanism,and the most voted subscription plan gets recommended to the user.展开更多
With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to d...With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.展开更多
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.展开更多
Gamification in education enables for the holistic optimization of the learning process,empowering learners to ameliorate their digital,cognitive,emotional and social skills,via their active experimentation with game ...Gamification in education enables for the holistic optimization of the learning process,empowering learners to ameliorate their digital,cognitive,emotional and social skills,via their active experimentation with game design elements,accompanying pertinent pedagogical objectives of interest.This paper focuses on a cross-platform,innovative,gamified,educational learning system product,funded by the Hellenic Republic Ministry of Development and Investments:howlearn.By applying gamification techniques,in 3D virtual environments,within which,learners fulfil STEAM(Science,Technology,Engineering,Arts and Mathematics)-related Experiments(Simulations,Virtual Labs,Interactive Storytelling Scenarios,Decision Making Case Studies),howlearn covers learners’subject material,while,simultaneously,functioning,as an Authoring Gamification Tool and as a Game Metrics Repository;users’metrics are being,dynamically,analyzed,through Machine Learning Algorithms.Consequently,the System learns from the data and learners receive Personalized Feedback Report Dashboards of their overall performance,weaknesses,interests and general class competency.A Custom Recommendation System(Collaborative Filtering,Content-Based Filtering)then supplies suggestions,representing the best matches between Experiments and learners,while also focusing on the reinforcement of the learning weaknesses of the latter.Ultimately,by optimizing the Accuracy,Performance and Predictive capability of the Personalized Feedback Report,we provide learners with scientifically valid performance assessments and educational recommendations,thence intensifying sustainable,learner-centered education.展开更多
基金The National Natural Science Foundation of China (61876001)Opening Foundation of State Key Laboratory of Cognitive Intelligence,Opening Foundation of State Key Laboratory of Cognitive Intelligence(iED2022-006)Scientific Research Planning Project of Anhui Province (2022AH050072)
文摘Attackers inject the designed adversarial sample into the target recommendation system to achieve illegal goals,seriously affecting the security and reliability of the recommendation system.It is difficult for attackers to obtain detailed knowledge of the target model in actual scenarios,so using gradient optimization to generate adversarial samples in the local surrogate model has become an effective black‐box attack strategy.However,these methods suffer from gradients falling into local minima,limiting the transferability of the adversarial samples.This reduces the attack's effectiveness and often ignores the imperceptibility of the generated adversarial samples.To address these challenges,we propose a novel attack algorithm called PGMRS‐KL that combines pre‐gradient‐guided momentum gradient optimization strategy and fake user generation constrained by Kullback‐Leibler divergence.Specifically,the algorithm combines the accumulated gradient direction with the previous step's gradient direction to iteratively update the adversarial samples.It uses KL loss to minimize the distribution distance between fake and real user data,achieving high transferability and imperceptibility of the adversarial samples.Experimental results demonstrate the superiority of our approach over state‐of‐the‐art gradient‐based attack algorithms in terms of attack transferability and the generation of imperceptible fake user data.
基金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.
文摘Recommender system (RS) has become a very important factor in many eCommerce sites. In our daily life, we rely on the recommendation from other persons either by word of mouth, recommendation letters, movie, item and book reviews printed in newspapers, etc. The typical Recommender Systems are software tools and techniques that provide support to people by identifying interesting products and services in online store. It also provides a recommendation for certain users who search for the recommendations. The most important open challenge in Collaborative filtering recommender system is the cold start problem. If the adequate or sufficient information is not available for a new item or users, the recommender system runs into the cold start problem. To increase the usefulness of collaborative recommender systems, it could be desirable to eliminate the challenge such as cold start problem. Revealing the community structures is crucial to understand and more important with the increasing popularity of online social networks. The community detection is a key issue in social network analysis in which nodes of the communities are tightly connected each other and loosely connected between other communities. Many algorithms like Givan-Newman algorithm, modularity maximization, leading eigenvector, walk trap, etc., are used to detect the communities in the networks. To test the community division is meaningful we define a quality function called modularity. Modularity is that the links within a community are higher than the expected links in those communities. In this paper, we try to give a solution to the cold-start problem based on community detection algorithm that extracts the community from the social networks and identifies the similar users on that network. Hence, within the proposed work several intrinsic details are taken as a rule of thumb to boost the results higher. Moreover, the simulation experiment was taken to solve the cold start problem.
基金This work is supported by project No.B2020-DQN-08 from the Ministry of Education and Training of Vietnam.
文摘Recommender systems are similar to an informationfiltering system that helps identify items that best satisfy the users’demands based on their pre-ference profiles.Context-aware recommender systems(CARSs)and multi-criteria recommender systems(MCRSs)are extensions of traditional recommender sys-tems.CARSs have integrated additional contextual information such as time,place,and so on for providing better recommendations.However,the majority of CARSs use ratings as a unique criterion for building communities.Meanwhile,MCRSs utilize user preferences in multiple criteria to better generate recommen-dations.Up to now,how to exploit context in MCRSs is still an open issue.This paper proposes a novel approach,which relies on deep learning for context-aware multi-criteria recommender systems.We apply deep neural network(DNN)mod-els to predict the context-aware multi-criteria ratings and learn the aggregation function.We conduct experiments to evaluate the effect of this approach on the real-world dataset.A significant result is that our method outperforms other state-of-the-art methods for recommendation effectiveness.
基金supported by the National Natural Science Foundation of China(Grant No.62177033).
文摘1 Introduction Large language models(LLMs)have achieved remarkable progress in the field of natural language processing(NLP),showing impressive abilities to generate human-like texts for a broad range of tasks[1].Consequently,recent works start to investigate the application of LLMs in recommender systems.They adopt LLMs for various recommendation tasks,and show promising performance from different aspects(e.g.,user profiling).In this letter,we mainly focus on promoting the sample efficiency of recommender systems by involving large language models.
文摘Blockchain technology has gained traction in Food Supply Chain Management(FSCM),enhancing traceability and transparency.The existing deployments of public or private blockchains face issues in achieving an optimal balance between transparency and decentralization.This work proposes a hybrid blockchain model complemented by an Access Control(AC)mechanism to bolster security,reliability,and usability within FSCM systems.Furthermore,the integration of a recommender system is proposed to utilize data analytics and machine learning for personalizing product offerings and optimizing inventory management,aiming to boost efficiency and consumer satisfaction.The synergy between the hybrid blockchain framework and the recommender system is anticipated to cultivate a more engaged,efficient,and gratified supply chain ecosystem.The model significantly enhances monitoring in 30%of the use cases and supports transparency in a quarter.It also reduces vulnerability cases by 20%.Inventory management is markedly improved,reducing overstock by 25%,confirming the effectiveness of the proposed hybrid blockchain approach.
文摘The exponential growth of over-the-top(OTT)entertainment has fueled a surge in content consumption across diverse formats,especially in regional Indian languages.With the Indian film industry producing over 1500 films annually in more than 20 languages,personalized recommendations are essential to highlight relevant content.To overcome the limitations of traditional recommender systems-such as static latent vectors,poor handling of cold-start scenarios,and the absence of uncertainty modeling-we propose a deep Collaborative Neural Generative Embedding(C-NGE)model.C-NGE dynamically learns user and item representations by integrating rating information and metadata features in a unified neural framework.It uses metadata as sampled noise and applies the reparameterization trick to capture latent patterns better and support predictions for new users or items without retraining.We evaluate CNGE on the Indian Regional Movies(IRM)dataset,along with MovieLens 100 K and 1 M.Results show that our model consistently outperforms several existing methods,and its extensibility allows for incorporating additional signals like user reviews and multimodal data to enhance recommendation quality.
基金funded by Soonchunhyang University,Grant Numbers 20241422BK21 FOUR(Fostering Outstanding Universities for Research,Grant Number 5199990914048).
文摘Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that leverages user-item interactions to generate recommendations.However,it struggles with challenges like the cold-start problem,scalability issues,and data sparsity.To address these limitations,we develop a Graph Convolutional Networks(GCNs)model that captures the complex network of interactions between users and items,identifying subtle patterns that traditional methods may overlook.We integrate this GCNs model into a federated learning(FL)framework,enabling themodel to learn fromdecentralized datasets.This not only significantly enhances user privacy—a significant improvement over conventionalmodels but also reassures users about the safety of their data.Additionally,by securely incorporating demographic information,our approach further personalizes recommendations and mitigates the coldstart issue without compromising user data.We validate our RSs model using the openMovieLens dataset and evaluate its performance across six key metrics:Precision,Recall,Area Under the Receiver Operating Characteristic Curve(ROC-AUC),F1 Score,Normalized Discounted Cumulative Gain(NDCG),and Mean Reciprocal Rank(MRR).The experimental results demonstrate significant enhancements in recommendation quality,underscoring that combining GCNs with CF in a federated setting provides a transformative solution for advanced recommendation systems.
基金the TsinghuaUniversity Initiative Scientific Research Program under Grant No.2019THZWYX08the MOE Project of Key Research Institute of Humanities and Social Sciences at Universities No.17JJD630006the Research Center for Interactive Technology Industry TsinghuaUniversity under Grant No.RCITI2022T002.
文摘Previous studies on the behavioral implications of recommender systems suggest that consumer preferences after consumption are malleable and tend to shift towards the ratings presented by a recommender system because of the anchoring effects.Drawing upon the literature on consumer satisfaction,we show that such a view on the anchoring effects of recommender systems is incomplete.Apart from the assimilation effects that pull the consumers’preferences towards the anchor,the contrast effects may shift their preferences in the other direction.Therefore,we theoretically hypothesize that the impacts of recommendations on consumers’constructed preferences are dependent on the level of deviation of the presented rating.The hypotheses are validated through a laboratory experiment.Our findings extend the existing literature on behavioral implications of recommender systems and provide a more comprehensive theoretical lens for understanding the anchoring effects,which may offer helpful insights for improving the design and use of recommender systems.
基金This work was supported by the Kyonggi University Research Grant 2022.
文摘Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.
文摘A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking into account the order of transactions.This work will present the implementation of sequence pattern mining for recommender systems within the domain of e-com-merce.This work will execute the Systolic tree algorithm for mining the frequent patterns to yield feasible rules for the recommender system.The feature selec-tion's objective is to pick a feature subset having the least feature similarity as well as highest relevancy with the target class.This will mitigate the feature vector's dimensionality by eliminating redundant,irrelevant,or noisy data.This work pre-sents a new hybrid recommender system based on optimized feature selection and systolic tree.The features were extracted using Term Frequency-Inverse Docu-ment Frequency(TF-IDF),feature selection with the utilization of River Forma-tion Dynamics(RFD),and the Particle Swarm Optimization(PSO)algorithm.The systolic tree is used for pattern mining,and based on this,the recommendations are given.The proposed methods were evaluated using the MovieLens dataset,and the experimental outcomes confirmed the efficiency of the techniques.It was observed that the RFD feature selection with systolic tree frequent pattern mining with collaborativefiltering,the precision of 0.89 was achieved.
基金Supported by the National Natural Science Foundation of China(71662014,61602219,71861013)。
文摘With the rapid development of social network in recent years, a huge number of social information has been produced. As traditional recommender systems often face data sparsity and cold-start problem, the use of social information has attracted many researchers' attention to improve the prediction accuracy of recommender systems. Social trust and social relation have been proven useful to improve the performance of recommendation. Based on the classic collaborative filtering technique, we propose a PCCTTF recommender method that takes the rating time of users, social trust among users, and item tags into consideration, then do the item recommending. Experimental results show that the PCCTTF method has better prediction accuracy than classical collaborative filtering technique and the state-of-the-art recommender methods, and can also effectively alleviate data sparsity and cold-start problem. Furthermore, the PCCTTF method has better performance than all the compared methods while counting against shilling attacks.
基金supported by the National Natural Science Foundation of China(No.72471236)the National Defense Science and Technology Basic Strengthening Project(No.2021-JCJQ-QT-050).
文摘Knowledge graphs(KGs)have garnered significant attention in recommender systems as auxiliary information.Most existing studies consider an item as an entity of a KG and utilize graph neural networks to learn item representations.However,two challenges exist regarding these algorithms:1)they provide recommended results but fail to explain the reason for which they are preferred by users;2)user vector representations are concentrated in a small area,thus resulting in similar mass recommendations.In this study,we focus on learning fine-grained user preferences(LFUP)via user-item interactions and using KGs that can capture the reason for which users interact with items.Additionally,a personalized recommendation task is achieved by optimizing the distribution of users in the vector space.User preferences are modeled by using historical interaction items pertaining to users and important relations within the KG.Subsequently,information from two views is aggregated to reduce the semantic differences between them.Finally,user preferences are personalized by maximizing the spatial distance between various user representations via contrastive learning.Experiments on public datasets prove that LFUP significantly benefits user-preference modeling and personalized recommendations.
文摘With the increasing of data on the internet, data analysis has become inescapable to gain time and efficiency, especially in bibliographic information retrieval systems. We can estimate the number of actual scientific journals points to around 40</span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">,</span></span></span><span><span><span style="font-family:""><span style="font-family:Verdana;">000 with about four million articles published each year. Machine learning and deep learning applied to recommender systems had become unavoidable whether in industry or in research. In this current, we propose an optimized interface for bibliographic information retrieval as a </span><span style="font-family:Verdana;">running example, which allows different kind of researchers to find their</span><span style="font-family:Verdana;"> needs following some relevant criteria through natural language understanding. Papers indexed in Web of Science and Scopus are in high demand. Natural language including text and linguistic-based techniques, such as tokenization, named entity recognition, syntactic and semantic analysis, are used to express natural language queries. Our Interface uses association rules to find more related papers for recommendation. Spanning trees are challenged to optimize the search process of the system.
文摘Personalized social matching systems can be seen as recommender systems that recommend people to others in the social networks, with desirable skills/characteristics. In this work, an algorithm based on Ant Colony is proposed to solve the optimization problem of clustering/matching people in a social network specifically designed for this purpose;during this process, their personal characteristics and preferences (and the degree of importance thereof) are taken into account. The numerical results indicate that the proposed algorithm can successfully perform clustering with a variable number of individuals.
文摘A blockchain is a digitized, decentralized, public ledger of all cryptocurrency transactions. The blockchain is transforming industries by enabling innovative business practices. Its revolutionary power has permeated areas such as bank-ing, financing, trading, manufacturing, supply chain management, healthcare, and government. Blockchain and the Internet of Things (BIOT) apply the us-age of blockchain in the inter-IOT communication system, therefore, security and privacy factors are achievable. The integration of blockchain technology and IoT creates modern decentralized systems. The BIOT models can be ap-plied by various industries including e-commerce to promote decentralization, scalability, and security. This research calls for innovative and advanced re-search on Blockchain and recommendation systems. We aim at building a se-cure and trust-based system using the advantages of blockchain-supported secure multiparty computation by adding smart contracts with the main blockchain protocol. Combining the recommendation systems and blockchain technology allows online activities to be more secure and private. A system is constructed for enterprises to collaboratively create a secure database and host a steadily updated model using smart contract systems. Learning case studies include a model to recommend movies to users. The accuracy of models is evaluated by an incentive mechanism that offers a fully trust-based recom-mendation system with acceptable performance.
文摘In this era of digital domination,it is fit to say that individuals are more inclined towards viewership on online platforms due to the wide variety and the scope of individual preferences it provides.In the past few years,there has been a massive growth in the popularity of Over-The-Top platforms,with an increasing number of consumers adapting to them.The Covid-19 pandemic has also caused the proliferation of these services as people are restricted to their homes.Consumers are often in a dilemma about which subscription plan to choose,and this iswhere a recommendation systemmakes their task easy.The Subscription recommendation system allows potential users to pick the most suitable and convenient plan for their daily consumption from diverse OTT platforms.The economic equilibrium behind allocating these resources follows a unique voting and bidding system propped by us in this paper.The systemis dependent on two types of individuals,type 1 seeking the recommendation plan,and type 2 suggesting it.In our study,the system collaborates with the latterwho participate in voting and invest/bid in the available options,keeping in mind the user preferences.This architecture runs on an interface where the candidates can login to participate at their convenience.As a result,selective participants are awarded monetary gains considering the rules of the suggested mechanism,and the most voted subscription plan gets recommended to the user.
基金Project supported by the National Natural Science Foundation of China(Grant No.T2293771)the New Cornerstone Science Foundation through the XPLORER PRIZE.
文摘With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.
文摘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.
文摘Gamification in education enables for the holistic optimization of the learning process,empowering learners to ameliorate their digital,cognitive,emotional and social skills,via their active experimentation with game design elements,accompanying pertinent pedagogical objectives of interest.This paper focuses on a cross-platform,innovative,gamified,educational learning system product,funded by the Hellenic Republic Ministry of Development and Investments:howlearn.By applying gamification techniques,in 3D virtual environments,within which,learners fulfil STEAM(Science,Technology,Engineering,Arts and Mathematics)-related Experiments(Simulations,Virtual Labs,Interactive Storytelling Scenarios,Decision Making Case Studies),howlearn covers learners’subject material,while,simultaneously,functioning,as an Authoring Gamification Tool and as a Game Metrics Repository;users’metrics are being,dynamically,analyzed,through Machine Learning Algorithms.Consequently,the System learns from the data and learners receive Personalized Feedback Report Dashboards of their overall performance,weaknesses,interests and general class competency.A Custom Recommendation System(Collaborative Filtering,Content-Based Filtering)then supplies suggestions,representing the best matches between Experiments and learners,while also focusing on the reinforcement of the learning weaknesses of the latter.Ultimately,by optimizing the Accuracy,Performance and Predictive capability of the Personalized Feedback Report,we provide learners with scientifically valid performance assessments and educational recommendations,thence intensifying sustainable,learner-centered education.
