Weighted Forwarding in Graph Convolution Networks for Recommendation Information Systems

Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.

Collaborative Filtering Algorithms Based on Kendall Correlation in Recommender Systems

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.

Trust-Based Collaborative Filtering Recommendation Systems on the Blockchain

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.

Alleviating the Cold Start Problem in Recommender Systems Based on Modularity Maximization Community Detection Algorithm

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.

A Deep Learning Based Approach for Context-Aware Multi-Criteria Recommender Systems

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.

Gamified Learning Systems’Personalized Feedback Report Dashboards via Custom Machine Learning Algorithms and Recommendation Systems

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.

An Approach for Personalized Social Matching Systems by Using Ant Colony

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 multilayer network diffusion-based model for reviewer recommendation

With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.

Enhancing Multicriteria-Based Recommendations by Alleviating Scalability and Sparsity Issues Using Collaborative Denoising Autoencoder

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.

Clustering approach based on hierarchical expansion for community detection of scientific collaboration network

This study presents a clustering algorithm based on hierarchical expansion to solve the problem of community detection in scientific collaboration network. The characteristics of achievements information related to scientific and technological domains are analyzed,and then an ontology that represents their latent collaborative relations is built to detect clusters from the collaboration network. A case study is conducted to collect a data set of research achievements in the electric vehicle field and better clustering results are obtained. A hierarchical recommendation framework that enriches the domain ontologies and retrieves more relevant information resources is proposed in the last part of this paper. This work also lays out a novel insight into the exploitation of scientific collaboration network to better classify achievements information.

On Cost Minimization for Cache-Enabled D2D Networks with Recommendation

To accommodate the tremendous increase of mobile data traffic,cache-enabled device-to-device(D2D)communication has been taken as a promising technique to release the heavy burden of cellular networks since popular contents can be pre-fetched at user devices and shared among subscribers.As a result,cellular traffic can be offloaded and an enhanced system performance can be attainable.However,due to the limited cache capacity of mobile devices and the heterogeneous preferences among different users,the requested contents are most likely not be proactively cached,inducing lower cache hit ratio.Recommendation system,on the other hand,is able to reshape users’request schema,mitigating the heterogeneity to some extent,and hence it can boost the gain of edge caching.In this paper,the cost minimization problem for the social-aware cache-enabled D2D networks with recommendation consideration is investigated,taking into account the constraints on the cache capacity budget and the total number of recommended files per user,in which the contents are sharing between the users that trust each other.The minimization problem is an integer non-convex and non-linear programming,which is in general NP-hard.Therewith,we propose a timeefficient joint recommendation and caching decision scheme.Extensive simulation results show that the proposed scheme converges quickly and significantly reduces the average cost when compared with various benchmark strategies.

A Novel Shilling Attack Detection Model Based on Particle Filter and Gravitation

With the rapid development of e-commerce, the security issues of collaborative filtering recommender systems have been widely investigated. Malicious users can benefit from injecting a great quantities of fake profiles into recommender systems to manipulate recommendation results. As one of the most important attack methods in recommender systems, the shilling attack has been paid considerable attention, especially to its model and the way to detect it. Among them, the loose version of Group Shilling Attack Generation Algorithm (GSAGenl) has outstanding performance. It can be immune to some PCC (Pearson Correlation Coefficient)-based detectors due to the nature of anti-Pearson correlation. In order to overcome the vulnerabilities caused by GSAGenl, a gravitation-based detection model (GBDM) is presented, integrated with a sophisticated gravitational detector and a decider. And meanwhile two new basic attributes and a particle filter algorithm are used for tracking prediction. And then, whether an attack occurs can be judged according to the law of universal gravitation in decision-making. The detection performances of GBDM, HHT-SVM, UnRAP, AP-UnRAP Semi-SAD,SVM-TIA and PCA-P are compared and evaluated. And simulation results show the effectiveness and availability of GBDM.

Improving Recommendation for Effective Personalization in Context-Aware Data Using Novel Neural Network

The digital technologies that run based on users’content provide a platform for users to help air their opinions on various aspects of a particular subject or product.The recommendation agents play a crucial role in personalizing the needs of individual users.Therefore,it is essential to improve the user experience.The recommender system focuses on recommending a set of items to a user to help the decision-making process and is prevalent across e-commerce and media websites.In Context-Aware Recommender Systems(CARS),several influential and contextual variables are identified to provide an effective recommendation.A substantial trade-off is applied in context to achieve the proper accuracy and coverage required for a collaborative recommendation.The CARS will generate more recommendations utilizing adapting them to a certain contextual situation of users.However,the key issue is how contextual information is used to create good and intelligent recommender systems.This paper proposes an Artificial Neural Network(ANN)to achieve contextual recommendations based on usergenerated reviews.The ability of ANNs to learn events and make decisions based on similar events makes it effective for personalized recommendations in CARS.Thus,the most appropriate contexts in which a user should choose an item or service are achieved.This work converts every label set into a Multi-Label Classification(MLC)problem to enhance recommendations.Experimental results show that the proposed ANN performs better in the Binary Relevance(BR)Instance-Based Classifier,the BR Decision Tree,and the Multi-label SVM for Trip Advisor and LDOS-CoMoDa Dataset.Furthermore,the accuracy of the proposed ANN achieves better results by 1.1%to 6.1%compared to other existing methods.

Context-Aware Practice Problem Recommendation Using Learners’ Skill Level Navigation Patterns

The use of programming online judges(POJs)has risen dramatically in recent years,owing to the fact that the auto-evaluation of codes during practice motivates students to learn programming.Since POJs have greater number of pro-gramming problems in their repository,learners experience information overload.Recommender systems are a common solution to information overload.Current recommender systems used in e-learning platforms are inadequate for POJ since recommendations should consider learners’current context,like learning goals and current skill level(topic knowledge and difficulty level).To overcome the issue,we propose a context-aware practice problem recommender system based on learners’skill level navigation patterns.Our system initially performs skill level navigation pattern mining to discover frequent skill level navigations in the POJ and tofind learners’learning goals.Collaborativefiltering(CF)and con-tent-basedfiltering approaches are employed to recommend problems in the cur-rent and next skill levels based on frequent skill level navigation patterns.The sequence similarity measure is used tofind the top k neighbors based on the sequence of problems solved by the learners.The experiment results based on the real-world POJ dataset show that our approach considering the learners’cur-rent skill level and learning goals outperforms the other approaches in practice problem recommender systems.

Effective Hybrid Content-Based Collaborative Filtering Approach for Requirements Engineering

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.

RecCac:Recommendation-Empowered Cooperative Edge Caching for Internet of Things

Edge caching is an emerging technology for supporting massive content access in mobile edge networks to address rapidly growing Internet of Things(IoT)services and content applications.However,the edge server is limited with the computation/storage capacity,which causes a low cache hit.Cooperative edge caching jointing neighbor edge servers is regarded as a promising technique to improve cache hit and reduce congestion of the networks.Further,recommender systems can provide personalized content services to meet user’s requirements in the entertainment-oriented mobile networks.Therefore,we investigate the issue of joint cooperative edge caching and recommender systems to achieve additional cache gains by the soft caching framework.To measure the cache profits,the optimization problem is formulated as a 0-1 Integer Linear Programming(ILP),which is NP-hard.Specifically,the method of processing content requests is defined as server actions,we determine the server actions to maximize the quality of experience(QoE).We propose a cachefriendly heuristic algorithm to solve it.Simulation results demonstrate that the proposed framework has superior performance in improving the QoE.

A Survey of Online Course Recommendation Techniques

With the development of information technology, online learning has gradually become an indispensable way of knowledge acquisition. However, with the increasing amount of data information, it is increasingly difficult for people to find appropriate learning materials from a large number of educational resources. The recommender system has been widely used in various Internet applications due to its high efficiency in filtering information, helping users to quickly find personalized resources from thousands of information, thereby alleviating the problem of information overload. In addition, due to its great use value, many new researches have been proposed in the field of recommender systems in recent years, but there are not many works on online course recommendation at present. Therefore, this paper aims to sort out the existing cutting-edge recommendation algorithms and the work related to online course recommendation, so as to provide a comprehensive overview of the online course recommender system. Specifically, we will first introduce the main technologies and representative work used in the online course recommender system, explain the advantages and disadvantages of various technologies, and finally discuss the future research direction of the online course recommender system.

Deep learning framework for multi‐round service bundle recommendation in iterative mashup development

Recent years have witnessed the rapid development of service‐oriented computing technologies.The boom of Web services increases software developers'selection burden in developing new service‐based systems such as mashups.Timely recommending appropriate component services for developers to build new mashups has become a fundamental problem in service‐oriented software engineering.Existing service recom-mendation approaches are mainly designed for mashup development in the single‐round scenario.It is hard for them to effectively update recommendation results according to developers'requirements and behaviours(e.g.instant service selection).To address this issue,the authors propose a service bundle recommendation framework based on deep learning,DLISR,which aims to capture the interactions among the target mashup to build,selected(component)services,and the following service to recommend.Moreover,an attention mechanism is employed in DLISR to weigh selected services when rec-ommending a candidate service.The authors also design two separate models for learning interactions from the perspectives of content and invocation history,respectively,and a hybrid model called HISR.Experiments on a real‐world dataset indicate that HISR can outperform several state‐of‐the‐art service recommendation methods to develop new mashups iteratively.

Hybrid Recommender System Using Systolic Tree for Pattern Mining

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.

An Auction-Based Recommender System for Over-The-Top Platform

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.