An Adaptive Program Recommendation System for Multi-User Sharing Environment

More and more accounts or devices are shared by multiple users in video applications,which makes it difficult to provide recommendation service.Existing recommendation schemes overlook multiuser sharing scenarios,and they cannot make effective use of the mixed information generated by multi-user when exploring users’potential interests.To solve these problems,this paper proposes an adaptive program recommendation system for multi-user sharing environment.Specifically,we first design an offline periodic identification module by building multi-user features and periodically predicting target user in future sessions,which can separate the profile of target user from mixed log records.Subsequently,an online recommendation module with adaptive timevarying exploration strategy is constructed by jointly using personal information and multi-user social information provided by identification module.On one hand,to learn the dynamic changes in user-interest,a time-varying linear upper confidence bound(LinUCB)based on personal information is designed.On the other hand,to reduce the risk of exploration,a timeinvariant LinUCB based on separated multi-user social information from one account/device is proposed to compute the quality scores of programs for each user,which is integrated into the time-varying LinUCB by cross-weighting strategy.Finally,experimental results validate the efficiency of the proposed scheme.

Urban Traffic Control Meets Decision Recommendation System:A Survey and Perspective

Urban traffic control is a multifaceted and demanding task that necessitates extensive decision-making to ensure the safety and efficiency of urban transportation systems.Traditional approaches require traffic signal professionals to manually intervene on traffic control devices at the intersection level,utilizing their knowledge and expertise.However,this process is cumbersome,labor-intensive,and cannot be applied on a large network scale.Recent studies have begun to explore the applicability of recommendation system for urban traffic control,which offer increased control efficiency and scalability.Such a decision recommendation system is complex,with various interdependent components,but a systematic literature review has not yet been conducted.In this work,we present an up-to-date survey that elucidates all the detailed components of a recommendation system for urban traffic control,demonstrates the utility and efficacy of such a system in the real world using data and knowledgedriven approaches,and discusses the current challenges and potential future directions of this field.

Combined CNN-LSTM Deep Learning Algorithms for Recognizing Human Physical Activities in Large and Distributed Manners:A Recommendation System

Recognizing human activity(HAR)from data in a smartphone sensor plays an important role in the field of health to prevent chronic diseases.Daily and weekly physical activities are recorded on the smartphone and tell the user whether he is moving well or not.Typically,smartphones and their associated sensing devices operate in distributed and unstable environments.Therefore,collecting their data and extracting useful information is a significant challenge.In this context,the aimof this paper is twofold:The first is to analyze human behavior based on the recognition of physical activities.Using the results of physical activity detection and classification,the second part aims to develop a health recommendation system to notify smartphone users about their healthy physical behavior related to their physical activities.This system is based on the calculation of calories burned by each user during physical activities.In this way,conclusions can be drawn about a person’s physical behavior by estimating the number of calories burned after evaluating data collected daily or even weekly following a series of physical workouts.To identify and classify human behavior our methodology is based on artificial intelligence models specifically deep learning techniques like Long Short-Term Memory(LSTM),stacked LSTM,and bidirectional LSTM.Since human activity data contains both spatial and temporal information,we proposed,in this paper,to use of an architecture allowing the extraction of the two types of information simultaneously.While Convolutional Neural Networks(CNN)has an architecture designed for spatial information,our idea is to combine CNN with LSTM to increase classification accuracy by taking into consideration the extraction of both spatial and temporal data.The results obtained achieved an accuracy of 96%.On the other side,the data learned by these algorithms is prone to error and uncertainty.To overcome this constraint and improve performance(96%),we proposed to use the fusion mechanisms.The last combines deep learning classifiers tomodel non-accurate and ambiguous data to obtain synthetic information to aid in decision-making.The Voting and Dempster-Shafer(DS)approaches are employed.The results showed that fused classifiers based on DS theory outperformed individual classifiers(96%)with the highest accuracy level of 98%.Also,the findings disclosed that participants engaging in physical activities are healthy,showcasing a disparity in the distribution of physical activities between men and women.

Joint Modeling of Citation Networks and User Preferences for Academic Tagging Recommender System

In the tag recommendation task on academic platforms,existing methods disregard users’customized preferences in favor of extracting tags based just on the content of the articles.Besides,it uses co-occurrence techniques and tries to combine nodes’textual content for modelling.They still do not,however,directly simulate many interactions in network learning.In order to address these issues,we present a novel system that more thoroughly integrates user preferences and citation networks into article labelling recommendations.Specifically,we first employ path similarity to quantify the degree of similarity between user labelling preferences and articles in the citation network.Then,the Commuting Matrix for massive node pair paths is used to improve computational performance.Finally,the two commonalities mentioned above are combined with the interaction paper labels based on the additivity of Poisson distribution.In addition,we also consider solving the model’s parameters by applying variational inference.Experimental results demonstrate that our suggested framework agrees and significantly outperforms the state-of-the-art baseline on two real datasets by efficiently merging the three relational data.Based on the Area Under Curve(AUC)and Mean Average Precision(MAP)analysis,the performance of the suggested task is evaluated,and it is demonstrated to have a greater solving efficiency than current techniques.

Recommendation System Based on Perceptron and Graph Convolution Network

The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction data.This paper presents a new approach to address such issues,utilizing the graph convolution network to extract association relations.The proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction layer.The embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation layer.The forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph convolution.Furthermore,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction layer.The score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,respectively.Finally,the prediction score of users to items is obtained.The recall rate and normalized discounted cumulative gain were used as evaluation indexes.The proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.

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.

Video Recommendation System Using Machine-Learning Techniques

In the realm of contemporary artificial intelligence,machine learning enables automation,allowing systems to naturally acquire and enhance their capabilities through learning.In this cycle,Video recommendation is finished by utilizing machine learning strategies.A suggestion framework is an interaction of data sifting framework,which is utilized to foresee the“rating”or“inclination”given by the different clients.The expectation depends on past evaluations,history,interest,IMDB rating,and so on.This can be carried out by utilizing collective and substance-based separating approaches which utilize the data given by the different clients,examine them,and afterward suggest the video that suits the client at that specific time.The required datasets for the video are taken from Grouplens.This recommender framework is executed by utilizing Python Programming Language.For building this video recommender framework,two calculations are utilized,for example,K-implies Clustering and KNN grouping.K-implies is one of the unaided AI calculations and the fundamental goal is to bunch comparable sort of information focuses together and discover the examples.For that K-implies searches for a steady‘k'of bunches in a dataset.A group is an assortment of information focuses collected due to specific similitudes.K-Nearest Neighbor is an administered learning calculation utilized for characterization,with the given information;KNN can group new information by examination of the‘k'number of the closest information focuses.The last qualities acquired are through bunching qualities and root mean squared mistake,by using this algorithm we can recommend videos more appropriately based on user previous records and ratings.

Hybrid scientific article recommendation system with COOT optimization

Today, recommendation systems are everywhere, making a variety of activities considerably more manageable. These systems help users by personalizing their suggestions to their interests and needs. They can propose various goods, including music, courses, articles, agricultural products, fertilizers, books, movies, and foods. In the case of research articles, recommendation algorithms play an essential role in minimizing the time required for researchers to find relevant articles. Despite multiple challenges, these systems must solve serious issues such as the cold-start problem, article privacy, and changing user interests. This research addresses these issues through the use of two techniques: hybrid recommendation systems and COOT optimization. To generate article recommendations, a hybrid recommendation system integrates features from content-based and graph-based recommendation systems. COOT optimization is used to optimize the results, inspired by the movement of water birds. The proposed method combines a graph-based recommendation system with COOT optimization to increase accuracy and reduce result inaccuracies. When compared to the baseline approaches described, the model provided in this study improves precision by 2.3%, recall by 1.6%, and mean reciprocal rank (MRR) by 5.7%.

Hybrid Scalable Researcher Recommendation System Using Azure Data Lake Analytics

This research paper has provided the methodology and design for implementing the hybrid author recommender system using Azure Data Lake Analytics and Power BI. It offers a recommendation for the top 1000 Authors of computer science in different fields of study. The technique used in this paper is handling the inadequate Information for citation;it removes the problem of cold start, which is encountered by very many other recommender systems. In this paper, abstracts, the titles, and the Microsoft academic graphs have been used in coming up with the recommendation list for every document, which is used to combine the content-based approaches and the co-citations. Prioritization and the blending of every technique have been allowed by the tuning system parameters, allowing for the authority in results of recommendation versus the paper novelty. In the end, we do observe that there is a direct correlation between the similarity rankings that have been produced by the system and the scores of the participant. The results coming from the associated scrips of analysis and the user survey have been made available through the recommendation system. Managers must gain the required expertise to fully utilize the benefits that come with business intelligence systems [1]. Data mining has become an important tool for managers that provides insights about their daily operations and leverage the information provided by decision support systems to improve customer relationships [2]. Additionally, managers require business intelligence systems that can rank the output in the order of priority. Ranking algorithm can replace the traditional data mining algorithms that will be discussed in-depth in the literature review [3].

A New Time-Aware Collaborative Filtering Intelligent Recommendation System

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.

An E-Commerce Recommender System Based on Click and Purchase Data to Items and Considered of Interest Shifting of Customers

A well-performed recommender system for an e-commerce web site can help customers easily find favorite items and then increase the turnover of merchants, hence it is important for both customers and merchants. In most of the existing recommender systems, only the purchase information is utilized data and the navigational and behavioral data are seldom concerned. In this paper, we design a novel recommender system for comprehensive online shopping sites. In the proposed recommender system, the navigational and behavioral data, such as access, click, read, and purchase information of a customer, are utilized to calculate the preference degree to each item; then items with larger preference degrees are recommended to the customer. The proposed method has several innovations and two of them are more remarkable: one is that nonexpendable items are distinguished from expendable ones and handled by a different way; another is that the interest shifting of customers are considered. Lastly, we structure an example to show the operation procedure and the performance of the proposed recommender system. The results show that the proposed recommender method with considering interest shifting is superior to Kim et al(2011) method and the method without considering interest shifting.

An E-Commerce Recommender System Based on Content-Based Filtering

Content-based filtering E-commerce recommender system was discussed fully in this paper. Users＇ unique features can be explored by means of vector space model firstly. Then based on the qualitative value of products informa tion, the recommender lists were obtained. Since the system can adapt to the users＇ feedback automatically, its performance were enhanced comprehensively. Finally the evaluation of the system and the experimental results were presented.

Recommending Friends Instantly in Location-based Mobile Social Networks

Differently from the general online social network(OSN),locationbased mobile social network(LMSN),which seamlessly integrates mobile computing and social computing technologies,has unique characteristics of temporal,spatial and social correlation.Recommending friends instantly based on current location of users in the real world has become increasingly popular in LMSN.However,the existing friend recommendation methods based on topological structures of a social network or non-topological information such as similar user profiles cannot well address the instant making friends in the real world.In this article,we analyze users' check-in behavior in a real LMSN site named Gowalla.According to this analysis,we present an approach of recommending friends instantly for LMSN users by considering the real-time physical location proximity,offline behavior similarity and friendship network information in the virtual community simultaneously.This approach effectively bridges the gap between the offline behavior of users in the real world and online friendship network information in the virtual community.Finally,we use the real user check-in dataset of Gowalla to verify the effectiveness of our approach.

Adversarial Attacks on Content-Based Filtering Journal Recommender Systems

Recommender systems are very useful for people to explore what they really need.Academic papers are important achievements for researchers and they often have a great deal of choice to submit their papers.In order to improve the efficiency of selecting the most suitable journals for publishing their works,journal recommender systems(JRS)can automatically provide a small number of candidate journals based on key information such as the title and the abstract.However,users or journal owners may attack the system for their own purposes.In this paper,we discuss about the adversarial attacks against content-based filtering JRS.We propose both targeted attack method that makes some target journals appear more often in the system and non-targeted attack method that makes the system provide incorrect recommendations.We also conduct extensive experiments to validate the proposed methods.We hope this paper could help improve JRS by realizing the existence of such adversarial attacks.

A Probabilistic Rating Prediction and Explanation Inference Model for Recommender Systems

Collaborative Filtering(CF) is a leading approach to build recommender systems which has gained considerable development and popularity. A predominant approach to CF is rating prediction recommender algorithm, aiming to predict a user's rating for those items which were not rated yet by the user. However, with the increasing number of items and users, thedata is sparse.It is difficult to detectlatent closely relation among the items or users for predicting the user behaviors. In this paper,we enhance the rating prediction approach leading to substantial improvement of prediction accuracy by categorizing according to the genres of movies. Then the probabilities that users are interested in the genres are computed to integrate the prediction of each genre cluster. A novel probabilistic approach based on the sentiment analysis of the user reviews is also proposed to give intuitional explanations of why an item is recommended.To test the novel recommendation approach, a new corpus of user reviews on movies obtained from the Internet Movies Database(IMDB) has been generated. Experimental results show that the proposed framework is effective and achieves a better prediction performance.

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.

Applying memetic algorithm-based clustering to recommender system with high sparsity problem

A new recommendation method was presented based on memetic algorithm-based clustering. The proposed method was tested on four highly sparse real-world datasets. Its recommendation performance is evaluated and compared with that of the frequency-based, user-based, item-based, k-means clustering-based, and genetic algorithm-based methods in terms of precision, recall, and F1 score. The results show that the proposed method yields better performance under the new user cold-start problem when each of new active users selects only one or two items into the basket. The average F1 scores on all four datasets are improved by 225.0%, 61.6%, 54.6%, 49.3%, 28.8%, and 6.3% over the frequency-based, user-based, item-based, k-means clustering-based, and two genetic algorithm-based methods, respectively.

Fusion Recommendation System Based on Collaborative Filtering and Knowledge Graph

The recommendation algorithm based on collaborative filtering is currently the most successful recommendation method. It recommends items to theuser based on the known historical interaction data of the target user. Furthermore,the combination of the recommended algorithm based on collaborative filtrationand other auxiliary knowledge base is an effective way to improve the performance of the recommended system, of which the Co-Factorization Model(CoFM) is one representative research. CoFM, a fusion recommendation modelcombining the collaborative filtering model FM and the graph embeddingmodel TransE, introduces the information of many entities and their relationsin the knowledge graph into the recommendation system as effective auxiliaryinformation. It can effectively improve the accuracy of recommendations andalleviate the problem of sparse user historical interaction data. Unfortunately,the graph-embedded model TransE used in the CoFM model cannot solve the1-N, N-1, and N-N problems well. To tackle this problem, a novel fusion recommendation model Joint Factorization Machines and TransH Model (JFMH) isproposed, which improves CoFM by replacing the TransE model with TransHmodel. A large number of experiments on two widely used benchmark data setsshow that compared with CoFM, JFMH has improved performance in terms ofitem recommendation and knowledge graph completion, and is more competitivethan multiple baseline methods.

Chinese medicine formulas for nonalcoholic fatty liver disease: Overview of systematic reviews

BACKGROUND Nonalcoholic fatty liver disease(NAFLD)affects more than one-quarter of the global population.Due to the lack of approved chemical agents,many patients seek treatment from traditional Chinese medicine(TCM)formulas.A variety of systematic reviews have been published regarding the effectiveness and safety of TCM formulas for NAFLD.AIM To critically appraise available systematic reviews and sort out the high-quality evidence on TCM formulas for the management of NAFLD.METHODS Seven databases were systematically searched from their inception to 28 February 2020.The search terms included“non-alcoholic fatty liver disease,”“Chinese medicines,”“systematic review,”and their synonyms.Systematic reviews involving TCM formulas alone or in combination with conventional medications were included.The methodological quality and risk of bias of eligible systematic reviews were evaluated by using A Measure Tool to Assess Systematic Reviews 2(AMSTAR 2)and Risk of Bias in Systematic Review(ROBIS).The quality of outcomes was assessed by the Grading of Recommendations Assessment,Development and Evaluation(GRADE)system.RESULTS Seven systematic reviews were ultimately included.All systematic reviews were conducted based on randomized controlled trials and published in the last decade.According to the AMSTAR 2 tool,one systematic review was judged as having a moderate confidence level,whereas the other studies were rated as having a low or extremely low level of confidence.The ROBIS tool showed that the included systematic reviews all had a high risk of bias due to insufficient consideration of identified concerns.According to the GRADE system,only two outcomes were determined as high quality;namely,TCM formulas with the HuoXueHuaYu principle were better than conventional medications in ultrasound improvement,and TCM formulas were superior to antioxidants in alanine aminotransferase normalization.Other outcomes were downgraded to lower levels,mainly because of heterogeneity among studies,not meeting optimal information sample size,and inclusion of excessive numbers of small sample studies.Nevertheless,the evidence quality of extracted outcomes should be further downgraded when applying to clinical practice due to indirectness.CONCLUSION The quality of available systematic reviews was not satisfactory.Researchers should avoid repeatedly conducting systematic reviews in this area and focus on designing rigorous randomized controlled trials to support TCM formula applications.

Recommending Authors and Papers Based on ACTTM Community and Bilayer Citation Network

Citation network is often used for academic recommendation. However, it is difficult to achieve high recommendation accuracy and low time complexity because it is often very large and sparse and different citations have different purposes. What's more, some citations include unreasonable information, such as in case of intentional self-citation. To improve the accuracy of citation network-based academic recommendation and reduce the time complexity, we propose an academic recommendation method for recommending authors and papers. In which, an author-paper bilayer citation network is built, then an enhanced topic model, Author Community Topic Time Model(ACTTM) is proposed to detect high quality author communities in the author layer, and a set of attributes are proposed to comprehensively depict the author/paper nodes in the bilayer citation network. Experimental results prove that the proposed ACTTM can detect high quality author communities and facilitate low time complexity, and the proposed academic recommendation method can effectively improve the recommendation accuracy.