Search

As the volume of data continues to grow, the significance of text classification is on the rise. This vast amount of data majorly exists in the form of texts. Effective data preparation is essential to extract sentiment data from this vast amount of text, as irrelevant and redundant information can impede valuable insights. Feature selection is an important step in the data preparation phase as it eliminates irrelevant and insignificant features from the huge features set. There exist a large body of work related to feature selection for image processing but limited research is done for text data. While some studies recognize the significance of feature selection in text classification, but there is still need for more efficient sentiment analysis models that optimize feature selection and reduce computational. This manuscript aims to bridge these gaps by introducing a hybrid multi-objective evolutionary algorithm as a feature selection mechanism, combining the power of multiple objectives and evolutionary processes. The approach combines two feature selection techniques within a binary classification model: a filter method, Information Gain (IG), and an evolutionary wrapper method, Binary Multi-Objective Grey Wolf Optimizer (BMOGWO). Experimental evaluations are conducted across six diverse datasets. It achieves a reduction of over 90 percent in feature size while improving accuracy by nearly nine percent. These results showcase the model's efficiency in terms of computational time and its efficacy in terms of higher classification accuracy which improves sentiment analysis performance. This improvement can be beneficial for various applications, including recommendation systems, reviews analysis, and public opinion observation. However, it's crucial to acknowledge certain limitations of this study. These encompass the need for broader classifier evaluation, and scalability considerations with larger datasets. These identified limitations serve as directions for future research and the enhancement of the proposed approach. [ABSTRACT FROM AUTHOR]

Conversational recommender systems use natural language conversations to elicit user preferences and recommend items proactively. Existing methods based on graph neural networks have been proven to be effective in exploiting knowledge graphs. However, node positions are often treated as constants, which leads to the neglect of graph connectivity due to fuzzy processing. In addition, although the transformer has significant advantages in understanding the text, its secondary computational complexity may be incapable when dealing with long texts. In order to solve these problems, we propose an additive positional conversational recommender model called APCR. This model converts the pair product of transformer into a linear operation, and uses the Laplacian eigenvector to build a location graph. The extended graph neural network captures the topology structure of the location knowledge graph. Specifically, we design an encoder based on additive attention to break through the bottleneck of long text. Furthermore, we develop a recommendation model based on a positional graph neural network to match items with dialogue context, thereby capturing the graph topology. Extensive experiments on the REDIAL dataset show significant improvements in our proposed model over the state-of-the-art methods in recommendation and dialogue generation evaluations. [ABSTRACT FROM AUTHOR]

In existing sequential recommendation systems, user behavior data are directly used as training data for the model to complete the training process and address recommendation tasks. However, user-generated behavioral data inevitably contains noise, and the use of the Transformer's recommendation model may lead to overfitting on such noisy data. To address this issue, we introduce a sequence recommendation algorithm model named FAT-Rec, which incorporates fusion filters and converters through joint training. By employing joint training methods, we establish both a transformer prediction layer and a CTR prediction layer. Toward the end of the model, we assign weights and sum up the losses from the Transformer and CTR prediction layers to derive the final loss function. Experimental results on two widely used datasets, MovieLens and Goodbooks, demonstrate a significant enhancement in the performance of the proposed FAT-Rec recommendation algorithm compared with seven comparative models. This validates the efficacy of the fusion filter and transformer within the context of sequence recommendation tasks under the joint training mechanism. [ABSTRACT FROM AUTHOR]

A recommendation system serves as a distributed information filter, predicting customer preferences in reviews, ratings, and comments. Analysing customer behaviour aids in understanding needs and predicting intentions. E-commerce tracks product usage and sentiment to provide a personalized network based on consumer preference modelling. The challenge lies in optimizing item selection for suitable consumers to enhance performance. To address this, an imperative is the item recommendation approach for modelling future consumer behaviour. However, traditional machine learning methods often overlook dynamic product recommendations due to evolving user interests and changes in preferences reflected in customer ratings, causing cold-start issues. To overcome these challenges, a comprehensive deep learning approach is introduced. This approach incorporates a deep neural network for consumer preference prediction, utilizing a multi-task learning paradigm to accommodate variations in consumer ratings. The research contribution lies in applying this network to predict consumer preference scores based on latent multimodal information and item characteristics. Initially, the architecture manages changing consumer aspects and preferences by extracting features and latent factors from customer review rating data. These latent factors include customer demographic information and other concealed features that signify preferences based on experiences and behaviours. Extracted latent features are processed using a sentiment analysis model to generate embedding latent features. A finely-tuned deep neural network with hyper-parameter adjustments serves as a prediction network, forming a customer performance-oriented recommendation system. It processes embedded latent features along with associated sentiments to achieve high prediction accuracy, reliability, and latency. The deep learning architecture, enriched with consumer-specific discriminative information, generates an objective function for item recommendations with minimal error, significantly enhancing predictive performance. Empirical experiments on Amazon review datasets validate the proposed model's performance, showcasing its enhanced effectiveness and scalability in handling substantial data volumes. [ABSTRACT FROM AUTHOR]

In view of the technical defects of the existing grey relational projection method, a new grey compromise relational bidirectional projection method is proposed. By incorporating the information expression advantage of picture hesitant fuzzy number, the distance formula of picture hesitant fuzzy statistics is constructed based on the centralized trend measurement and discrete trend measurement in descriptive statistics. On this basis, a multi-attribute recommendation method of picture hesitant fuzzy grey compromise relational bidirectional projection is proposed by combining compromise idea and bidirectional projection technology. The validity and advantage of this method are verified by numerical analysis, which also suggested the rationality of the picture hesitant fuzzy statistical distance and the grey compromise relational bidirectional projection method. [ABSTRACT FROM AUTHOR]

The considerable fluctuation of the stock market caused by COVID-19 tends to have a tremendous and long-lasting adverse impact on the economy. In this work, we propose a novel methodology to investigate this impact on the Chinese medical stock market. We examine changes in the stock network structure using the Triangulated Maximally Filtered Graph (TMFG), which is computationally faster and more adaptable to enormous datasets. Additionally, we develop the LoGo model, which combines a local-global approach in its construction, to predict the stock prices of the Chinese medical stock market. In addition to traditional predictors, we incorporate daily new infected numbers as an additional predictor to reflect the impact of COVID-19. We select data from the 2019-2020 period and divide it into two datasets: one for the period during COVID-19 and another for the period before COVID-19. Firstly, we compute the grey correlation coefficients between stocks instead of standard correlation coefficients. We use these coefficients to build the TMFG, enabling us to identify which stocks played the leading roles. Subsequently, we choose six stocks to build the price prediction models. Compared with the LSTM and SVR models, the LoGo models demonstrates higher accuracy, achieving an average accuracy of 71.67 percent. Furthermore, the execution time of the Logo models is 200 times faster than that of the SVR models and 50 times faster than that of the LSTM models. [ABSTRACT FROM AUTHOR]

The increased usage of the internet and social networks generates a large volume of information. Exploring through the large collection is time-consuming and hard to find the required one, so there is a serious need for a recommendation system. Based on this context several movie recommendation (MR) systems have been recently established. In addition, they have poor data analytics capability and cannot handle changing user preferences. As a result, there are many movies listed on the recommendation page, which provides for a poor user experience is the major issue. Therefore, in this work, a novel Taymon Optimized Deep Learning network (TODL net) for recommending top best movies based on their past choices, behaviour and movie contents. The deep neural network is a combination of Dilated CNN with Bi-directional LSTM. The DiCNN-BiLSTM model eliminates the functionality pooling operations and uses a dilated convolution layer to address the issue of information loss. The DiCNN is employed to learn the movie contents by mining user behavioral pattern attributes. The BiLSTM is applied to recommend the best movies on basis of the extracted features of the movie rating sequences of users in other social mediums. Moreover, for providing better results the DiCNN-BiLSTM is optimized with Taymon optimization algorithm to recommend best movies for the users. The proposed TODL net obtains the overall accuracy of 97.24% for best movies recommendation by using TMDB and MovieLens datasets. [ABSTRACT FROM AUTHOR]

With the explosive increase of information, recommendation system is applied in a variety of areas. However, the performance of recommendation system is limited due to issues such as data sparsity, cold starts and poor semantic understanding. In order to make full use of external information to assist recommendation, deeply mine the semantic information of review text and further improve the performance of recommendation system, a deep recommendation system based on knowledge graph and review text (Drs-kgrt) is proposed in this paper. In Drs-kgrt, knowledge graph, review text and the social records between users are used as auxiliary information to improve recommendation performance. Firstly, the review text is divided into user review text and item review text. BERT (Bidirectional Encoder Representation from Transformers) is used to accurately understand semantic information in user review text and the social records between users. The trust relationship between users and user preferences are fully mined to form user feature vectors. Secondly, BERT and knowledge graph entity recognition link technology are combined to extract item attribute feature entities and their associated entities. The fine-grained features of the items are analyzed to form item feature vectors. Thirdly, based on the scoring matrix, latent vectors of users and items are obtained by matrix decomposition. The deep features of users and items are generated based on user feature vectors, item feature vectors, latent vectors of users and items, the deep recommendation system is established to predict user scores for items. Finally, experiments are conducted on the Douban dataset and Amazon Movie Review dataset, the results show that the proposed algorithm can achieve better performance compared with other benchmark recommendation algorithms. [ABSTRACT FROM AUTHOR]

Deep convolutional neural networks (DCNNs) have shown remarkable performance in image classification tasks in recent years. In the network structure of DPRN, as the network depth increases, the number of convolutional kernels also increases linearly or nonlinearly. On the one hand, in the DPRN block, the size of the receptive field is only 3 × 3, which results in insufficient network ability to extract feature map information of different filter sizes. On the other hand, the number of convolution kernels in the second 1x1 convolution will be multiplied by a coefficient relative to the first convolution, which can cause overfitting to some extent. In order to overcome these weaknesses, we introduce the inception-like structure on the basis of the DPRN network which is called by pyramid inceptional residual networks (PIRN). In addition, we also discuss the performance of PIRN network with squeeze and excitation (SE) mechanism and regularization term. Furthermore, some results in network performance are discussed when adding a stochastic depth networkto the PIRN model. Compared to DPRN, PIRN achieved better results on the CIFAR10, CIFAR100, and Mini-ImageNet datasets. In the case of using zero-padding, the multiplicative PIRN with SE mechanism achieves the best result of 95.01% on the CIFAR10 dataset. Meanwhile, on the CIFAR100 and Mini-ImageNet datasets, the additive PIRN network with a network depth of 92 achieves the best results of 76.06% and 65.86%, respectively. According to the experimental results, our method has achieved better accuray than that of DPRN with same network settings which demonstrate its effectiveness in generalization ability. [ABSTRACT FROM AUTHOR]

In recent generations of the digital world medical data in Recommender Systems. Health Care Recommender System (HCRS) analyses the medical data and then predicts the user's or patient's illness. Nowadays, healthcare data is used by various users or patients in recommendation systems which are useful for everyone. Analysing and predicting medical data provides awareness to users and these data predictions may be enriched using various techniques of RS. Machine learning techniques are used to make sure that health data is reliable and of high quality. In every RS the issues are targeted such as scalability, sparsity and cold start problems. In many social networking applications, these issues are resolved using ML algorithms. However, there is a significant gap between IT systems and medical diagnosis. The fuzzy genetic method is used in HCRS in order to bridge the gap between IT and healthcare applications. Through the use of the mutation and crossover operators, a real-value genetic method is used in this to compute similarity. With the user's extra personalized information, fuzzy rules are later generated for the database. The Hybrid fuzzy-genetic method, also known as this situation, combines both techniques to improve recommendation quality. Utilizing this method will improve the quality of the recommendation process by discovering the most precise similarity measures among different users. Six factors are subjected to fuzzification, including age, gender, employment, height, weight, and region. Genre-interesting measure weights are then used, including Very Light, Light, Average, Heavy, and Very Heavy. Finally, the evaluation metrics used MAE and RMSE to evaluate the recommendation accuracy which showed the best results in comparison with baseline approaches such as Convolutional Neural Networks and Restricted Boltzman Machine. [ABSTRACT FROM AUTHOR]

Traditional collaborative filtering algorithms use user history rating information to predict movie ratings Other information, such as plot and director, which could provide potential connections are not fully mined. To address this issue, a collaborative filtering recommendation algorithm named a movie recommendation method based on knowledge graph and time series is proposed, in which the knowledge graph and time series features are effectively integrated. Firstly, the knowledge graph gains a deep relationship between users and movies. Secondly, the time series could extract user features and then calculates user similarity. Finally, collaborative filtering of ratings can calculate the user similarity and predicts ratings more precisely by utilizing the first two phases' outcomes. The experiment results show that the A Movie Recommendation Method Fusing Knowledge Graph and Time Series can reduce the MAE and RMSE of user-based collaborative filtering and Item-based collaborative filtering by 0.06,0.1 and 0.07,0.09 respectively, and also enhance the interpretability of the model. [ABSTRACT FROM AUTHOR]

Online shopping is a form of electronic commerce that enables customers to purchase products directly from the seller over the internet using a web browser or a mobile application. With the growing number of research papers on Deep Learning (DL)-based recommendations, DL models have proven to be effective in Recommender systems. Hence in this paper, relevant product accessories recommendation is proposed using deep learning and histogram features. The proposed recommendation describes the novel way of content-based filtering which divides the work into two phases. In phase 1, the implemented approach determines the color and category of the product. In phase 2, the recommendation system retrieves the matching accessories for the chosen product. For phase 1, Decision Tree, Linear Regression, Logistic Regression, Naïve Bayes, Long Short-Term Memory (LSTM), and a novel method of Stack dense Recurrent Neural Network (RNN) along with the color histogram is applied to identify the category and color of the product. It is justified that the proposed technique of stack dense RNN achieves 98% accuracy. In phase 2, from the Machine Learning (ML) perspective, Random Forest (RF) is employed for the recommendation. The RF model finds the matching accessories for the chosen product and retrieves the top relevant items. [ABSTRACT FROM AUTHOR]

Web service recommender systems have a fundamental role in the selection, composition and substitution of services. Indeed, they are used in several application areas such as Web APIs and Cloud Computing. Likewise, Deep Learning techniques have brought undeniable advantages and solutions to the challenges faced by recommendations in all areas. Unfortunately, the field of Web services has not yet benefited well from these deep methods, moreover, the works using these methods for Web services domain are very recent compared to the works of other fields. Thus, the objective of this paper is to study and analyze state-of-the-art work on Web services recommender systems based on Deep Learning techniques. This analysis will help readers wishing to work in this field, and allows us to direct our future work concerning the Web services recommendation by exploiting the advantages of Deep Learning techniques. [ABSTRACT FROM AUTHOR]

Recommender systems based on sentiment analysis become challenging due to the presence of enormous data available over the internet. With the lack of proper data cleaning and analysis methods, existing machine learning (ML) techniques fail to generate accurate recommendations. To overcome this issue, this paper proposes a Light Deep Learning (LightDL)-based recommender system that uses Twitter-based reviews. First, the data is collected from Twitter and cleaned by subsequent data cleaning processes. Then, this pre-processed data is fed into the LightDL model, which learns the important features like hashtags, unigrams, multigrams, etc. from each piece of data. Here, we have learned about four groups of features, including semantic features, syntactic features, symbolic features, and tweet-based features. Finally, the data is classified into positive, negative, and neutral categories according to the learned features. On the basis of classified sentiment, the review is generated to the users. Finally, the model is evaluated in terms of accuracy, precision, recall, f-measure, and error rate through extensive experiments in Matlab. The proposed LightDL model outperforms in all performance measures; specifically, it achieves 95% accuracy for the Twitter dataset. [ABSTRACT FROM AUTHOR]

A recommendation System (RS) is an emerging technology to figure out the user's interests and intentions. As the amount of data increases exponentially, it is hard to analyze the user intentions and trigger the recommendation accordingly. In this research work, a novel recommendation system called the Deep Knowledge Graph based Attribute Preserving Recommendation (DKG-APR) is presented to analyze massive data and provide personalized recommendations to users. The Deep Knowledge Graph for Recommendation System (DKG-RS) uses Deep Convolutional Neural Network (DCNN) and attention mechanism to explicitly model high-order connections in knowledge graphs. According to empirical findings, Knowledge Graph Attention Network (KGAT) performs better than other state-of-the-art recommendation techniques like RippleNet and Neural FM. Additional research demonstrates the effectiveness of embedding propagation for high-order relation modeling and the advantages of the attention mechanism for interpretability.The results also show that user information is crucial in the recommendation system, as seen from the optimal node-drop-out ratio of 0.2, which led to the best recall value of 0.2 for all datasets. [ABSTRACT FROM AUTHOR]

Point-of-interest (POI) recommendation has become one of the research highlights in the field of recommender systems due to the prosperity of location-based social networks in recent years. Various techniques have been proposed to improve the performance of the personalized recommendation service. Embedding-based methods have shown promising effect and attracted great attention for their flexibility and efficiency. Bayesian Personalized Ranking (BPR), as a famous optimization algorithm, has been widely used to learning the parameters of Embedding-based models in the recommendation scenario. However, existing Bayesian Personalized Ranking and its follow-up methods ignore the unique user preference when constructing the positive and negative samples, leading a suboptimal performance. To overcome this limitation, we propose a novel method named preference-aware Bayesian Personalized Ranking (PABPR) according to empirical analyses on real-world datasets. The empirical analyses show that a user tend to visit a POI with categories which have been visited before. Thus, the key idea of PABPR is to introduce such user behaviors into the sample constructing process. PABPR is a general method which could be used for training various Embedding methods. Extensive experiments show that PABPR can lead a superior model performance compare to BPR and its variant methods. [ABSTRACT FROM AUTHOR]

The e-learning is necessary in this fast internet world, especially during this pandemic situation, to continue education without any interruption and it is used reduce the educational cost significantly when reduces the energy loss. Generally, machine learning and deep learning algorithms are used to identify patterns that facilitate learning and help learners understand concepts easily. Many content recommendation systems are available for assisting learners as e-learning applications by providing the required study materials. Despite the fact that existing recommendation systems struggle to provide precise content to e-learners due to the availability of a massive volume of data on the internet and other repositories. For this purpose, we propose a new content recommendation system for recommending suitable content to learners according to their interests and learning capabilities. The proposed content recommendation system employs a newly proposed semantic-aware hybrid feature optimizer that incorporates new optimization algorithms such as the Enhanced Personalized Best Cuckoo Search Algorithm (EpBestCSA) and the Enhanced Harris Hawks Optimization Algorithm (EHHOA) for selecting suitable features that aid in improving prediction accuracy, as well as a newly proposed Deep Semantic Structure Model (DSSM) that incorporates Artificial Neural Network (ANN) and Convolutional Neural Network (CNN). According to the experimental results, the proposed model outperforms other recommendation systems in terms of precision, recall, f-measure, and prediction accuracy. The ten-fold cross validation is done to test the performance of the proposed methodology. [ABSTRACT FROM AUTHOR]

Recent technological advancements have enabled users to conduct more sophisticated business transactions via Wi-Fi enabled networks. Typically, a compromised access point (CAP) can handle all traffic between a user and an Internet server, thus becoming a serious security hazard. In addition, an attacker can easily control the entire network using the CAP remotely and compromise as many victims as possible to form a botnet. This paper presents a hybrid recommendation prediction model for forecasting CAP attacks based on network traffic in a private network. This model combines various prediction techniques likethe time-series model, the kNN model and cross association algorithm for attack prediction. This hybrid blacklisting recommendation system effectively improves the prediction rate significantly as well as the robustness against poisoning attacks. [ABSTRACT FROM AUTHOR]

The internet and social networks produce an increasing amount of data. There is a serious necessity for a recommendation system because exploring through the huge collection is time-consuming and difficult. In this study, a multi-modal classifier is introduced which makes use of the output from dual deep neural networks: GRU for text analysis and Faster R-CNN for image analysis. These two networks reduce overall complexity with minimal computational time while retaining accuracy. More precisely, the GRU network is utilized to process movie reviews and the Faster RCNN is used to recognize each frames of the movie trailers. Gated Recurrent Unit (GRU) is a well-known variety of RNN that computes sequential data across recurrent structures. Faster RCNN is an enhanced version of Fast RCNN, it combines with the rectangular region proposals and with the features is extract by the ResNet-101. Initially, the trailer of the movie is manually splitted into frames and these frames are pre-processed using fuzzy elliptical filter for image analysis and the movie reviews are also tokenized for text analysis. The pre-processed text is taken as an input for GRU to classify offensive and non-offensive movies and the pre-processed images are taken as an input for Faster R-CNN to classify violence and non- violence movies based on the extracted features from the movie trailer. Afterwards, the four classified outputs are given as input for fuzzy decision-making unit for recommending best movies based on the Mamdani fuzzy inference system with gauss membership functions. The performance of the dual deep neural networks was evaluated using the specific parameters like specificity, precision, recall, accuracy and F1 score measures. The proposed GRU yields accuracy range of 97.73% for reviews and FRCNN yields the accuracy range of 98.42% for movie trailer. [ABSTRACT FROM AUTHOR]

Nowadays, the model compression method of knowledge distillation has drawn great attentions in Recommender systems (RS). The strategy of bidirectional distillation performs the bidirectional learning for both the teacher and the student models such that these two models can collaboratively improve with each other. However, this strategy cannot effectively exploit representation capabilities of each item and lack of the interpretability for the importance of items. Thus, how to develop an effective sampling scheme is still valuable for us to further study and explore. In this paper, we propose an improved rank discrepancy-aware item sampling strategy to enhance the performance of bidirectional distillation learning. Specifically, by employing the distillation loss, we train the teacher and student models to reflect the fact that a user has partiality for the unobserved items. Then, we propose the improved rank discrepancy-aware sampling strategy based on feedback learning mechanism to transfer just the useful information which can effectively enhance each other. The key part of the multiple distillation training aims to select valuable items which can be re-distilled in the network for training. The proposed technique can effectively solve the problem of high ambiguity in nature for recommender system. Experimental results on several real-world recommender system datasets well demonstrate that the improved bidirectional distillation strategy shows better performance. [ABSTRACT FROM AUTHOR]

Motivated by Hema Freshs new-retail case, we noticed that an effective recommender system is a common way to attract the consumers' purchasing behaviors and thus enlarge the profit of platform as well as retailers. With the aim of increasing the benefits of all parties in the platform, this paper focusing on not only increasing the effectiveness of the recommender platform but also the evaluation system of measuring the interests of consumer, retailers and platform. In this paper, the interests of the third-party platform are added into the evaluation system, the profit of the third-party platform as an evaluation index is taken and a 0–1 integer programming model is established which sets the profit of the platform as the objective function. The result of the proposed model and algorithm indicate that: (1) The relevance of products has a significant impact on platform recommendation when the consumers are selecting products. When the correlations of the products are high, the algorithms of selecting the products will have a lower capacity of 1% compared with the algorithm without products correlations. (2) The evaluation of the target products from the target consumers is quite different from the heterogeneity assumptions. When the consumer presentation is taken into consideration, it is hard to evaluate the consumer presence because of the strictly requirement of data for the platform recommendation system. (3) The proposed two-stage solution for the platform recommendation system is optimized in time and space complexity. Total optimization of the proposed method is 30% higher than the greedy algorithms. The two stages are combined together to obtain the approximate solution, and finally provide a reasonable and feasible recommendation for the third-party platform. [ABSTRACT FROM AUTHOR]

Counterfeit drugs are without a doubt becoming a greater hazard to consumers and the pharmaceutical sector. As a result, real-time visibility of drug manufacturing and management is required. The proposed system uses Ethereum blockchain as the main technology. The primary advantage of blockchain technology is that the transactions are maintained in immutable digital ledger format and it may be read easily without jeopardizing the users' security and privacy. In our proposed system, the admin validates and adds the manufacturers. The manufacturer after registering and logging in can perform tasks like adding the drug and seller list. The seller can place order to the manufacturer which the manufacturer can accept or reject. The seller can update status of order of accepted orders to delivered. The customer can view the order details by entering the serial number on the drug package. Any transaction or exchange that occurs in the network is recorded in the chain. It functions similarly to other networks, but blockchain technology is distinguished by the fact that no data can be removed or altered by anyone in the network. No changes to the network can be made unless it has been validated by all of the network's authorized users. All the information stored can be read by anybody so to incorporate more security, AES has been used to store data in the blockchain. The use of AES encryption technique distinguishes this system from all the existing implementations. Thus, this makes it easy to trace to the exact point in the supply chain and detect any counterfeit drugs in movement. As an extension to the drug counterfeit prevention system a Drug Recommendation System is also performed using the ensemble model with a combination of Random Forest and Logistic Regression for sentiment analysis training. Furthermore, when compared to the existing Linear SVM model, which has an accuracy of 90.39%, the suggested model has the best accuracy of 93.31%. Using the obtained sentiment for each drug, the drug is predicted accurately for the specified medical condition. [ABSTRACT FROM AUTHOR]

Adding noise to user history data helps to protect user privacy in recommendation systems but affects the recommendation performance. To solve this problem, a matrix factorization tourism point of interest recommendation model based on interest offset and differential privacy is proposed in this paper. The recommendation performance of the model is improved by analyzing user interest preferences. Specifically, user interest offsets are extracted from user tags and user ratings under time-series factors to calculate user interest drift. Then, similar neighbors are found to train user feature preferences which are integrated into the matrix model in the form of regular terms. Meanwhile, based on the differential privacy theory, a privacy neighbor selection algorithm combining the K-Medoides clustering algorithm and index mechanism is designed to effectively protect the identity of neighbors and prevent KNN attacks. Besides, the Laplace mechanism is used to implement differential privacy protection for the model's gradient descent process. Finally, the feasibility of the proposed recommendation model is verified through experiments, and the experimental results indicate that this model has advantages in recommendation accuracy and privacy protection. [ABSTRACT FROM AUTHOR]

Knowledge graphs have been introduced into recommender systems due to the rich connectivity information. Many knowledge-aware recommendation methods use graph neural networks (GNNs) to capture the high-order structural and semantic information of knowledge graphs. However, previous GNN-based methods have the following limitations: (1) they fail to make full use of the neighborhood information of entities and (2) they ignore the importance of user interaction sequences on reflecting user preferences. As such, these models are insufficient for generating accurate representations of users and items. In this study, we propose a Knowledge-aware Hierarchical Attention Network (KHAN) to provide better recommendation. Specifically, the proposed model mainly consists of an item encoder and a user encoder. The item encoder is equipped with a hierarchical attention network, which is used to generate entity (item) representations by carefully aggregating neighborhood information of entities. The user encoder is also designed to learn more informative user representations from user interaction sequences using multi-head self-attention. The learned user representations are then combined with user representations introduced in the item encoder through a gating mechanism to generate the final user representations. Extensive experiments on two real-world datasets about movie and restaurant recommendation demonstrate the effectiveness of our model. [ABSTRACT FROM AUTHOR]

Semantic alignment is a key component in Cross-Language Text Matching (CLTM) to facilitate matching (e.g., query-document matching) between two languages. The current solutions for semantic alignment mainly perform word-level translation directly, without considering the contextual information for the whole query and documents. To this end, we propose a Dual-Level Collaborative Rough-to-Fine Filter Alignment Network (DLCCFA) to achieve better cross-language semantic alignment and document matching. DLCCFA is devised with both a coarse-grained filter in word-level and a fine-grained filter in sentence-level. Concretely, for the query in word-level, we firstly extract top-k translation candidates for each token in the query through a probabilistic bilingual lexicon. Then, a Translation Probability Attention (TPA) mechanism is proposed to obtain coarse-grained word alignment, which generates the corresponding query auxiliary sentence. Afterwards, we further propose a Bilingual Cross Attention and utilize Self-Attention to achieve fine-grained sentence-level filtering, resulting in the cross-language representation of the query. The idea is that each token in the query works as an anchor to filter the semantic noise in the query auxiliary sentence and accurately align semantics of different languages. Extensive experiments on four real-world datasets of six languages demostrate that our method can outperform the mainstream alternatives of CLTM. [ABSTRACT FROM AUTHOR]

In the era of big data, recommender systems (RSs) have become growing essential tools. They represent important machine learning solutions that mainly contribute to keeping users engaged with personalized content in e-platforms. Several RSs have been proposed in the literature, and most of them have focused on English content. However, for content in other languages like Arabic, very restricted works have been done to develop RSs. In recent times, the Arabic content on the Web has increased significantly because of the growing number of Arabic web users. This highlights the need for building RSs for Arabic content. To better handle this challenge, we decided to provide the research community with a novel deep learning (DL)-based RS devoted to Arabic content. The main goal of the proposed RS is to predict user preferences from textual reviews written in the Arabic language. This is achieved by combining two independent DL techniques into one system: a convolutional neural network (CNN)-text processor for representing users and items; and a neural network, in particular, a multi-layer perceptron (MLP) to estimate interactions between user-item pairs. Extensive experiments on four large-scale Arabic datasets demonstrate that our proposed system can achieve better prediction accuracy than other state-of-the-art alternatives. Notably, it improves the MSE between 0.84% and 16.96%, and the MAE between 0.14% and 13.71%. This work is the first attempt designed to deal with a large volume of data in the Arabic context, opening up new research possibilities for future developments of Arabic RSs. [ABSTRACT FROM AUTHOR]

With the rapid growth of data scale, the problems of collaborative filtering recommendation algorithm are more and more obvious, such as data sparsity, cold start, scalability, and the change of user interest over time. About the existing problems, we introduce the fuzzy clustering and propose a collaborative filtering algorithm based on fuzzy C-means clustering. The algorithm performs fuzzy clustering on the item attribute information to make items belonging to different categories in different membership degree, increases the data density, effectively reduces the data sparsity, and solves the issue that the inaccuracy of similarity leads to the low recommendation accuracy. Meanwhile, the algorithm introduces the time weight function. Different evaluation times give different time weight values, and recently evaluated items are more representative of the user current interest, so we give a higher weight value, and early evaluated items have less effect on the user current interest, thus the weight value are relatively lower. The experimental results show that our algorithm can effectively alleviate the data sparsity problem and time migration of users preferences, thus achieve better performance. [ABSTRACT FROM AUTHOR]

The major challenge of recommendation system (RS) based on implict feedback is to accurately model users' preferences from their historical feedback. Nowadays, researchers has tried to apply adversarial technique in RS, which had presented successful results in various domains. To a certain extent, the use of adversarial technique improves the modeling of users' preferences. Nonetheless, there are still many problems to be solved, such as insufficient representation and low-level interaction. In this paper, we propose a recommendation algorithm NCGAN which combines neural collaborative filtering and generative adversarial network (GAN). We use the neural networks to extract users' non-linear characteristics. At the same time, we integrate the GAN framework to guide the recommendation model training. Among them, the generator aims to make user recommendations and the discriminator is equivalent to a measurement tool which could measure the distance between the generated distribution and users' ground distribution. Through comparison with other existing recommendation algorithms, our algorithm show better experimental performance in all indicators. [ABSTRACT FROM AUTHOR]

The purpose of aspect-level sentiment analysis is to identify the contextual sentence expressions given by sentiment for some aspects. For previous works, many scholars have proved the importance of the interaction between aspects and contexts. However, most existing methods ignore or do not specifically capture the position information of the aspect targets in the sentence. Thus, we propose an aspect-level sentiment analysis based on joint aspect and position hierarchy attention mechanism network. At the same time, the model adopts a joint approach to make the model of the aspect features and the position features. On the one hand, this method clearly captures the interaction between aspect words and context when inputting word vector information. On the other hand, this method can enhance the importance of position information in the sentence and boost the information retrieval ability of the model. Additionally, the model utilizes a hierarchical attention mechanism to extract feature information and to differentiate sentiment towards, which is similar to filtering useless information again. Experiment on the SemEval 2014 dataset represent that our model achieves better performance on aspect-level sentiment classification. [ABSTRACT FROM AUTHOR]

Tensors have been explored to share latent user-item relations and have been shown to be effective for recommendation. Tensors suffer from sparsity and cold start problems in real recommendation scenarios; therefore, researchers and engineers usually use matrix factorization to address these issues and improve the performance of recommender systems. In this paper, we propose matrix factorization completed multicontext data for tensor-enhanced algorithm a using matrix factorization combined with a multicontext data method for tensor-enhanced recommendation. To take advantage of existing user-item data, we add the context time and trust to enrich the interactive data via matrix factorization. In addition, Our approach is a high-dimensional tensor framework that further mines the latent relations from the user-item-trust-time tensor to improve recommendation performance. Through extensive experiments on real-world datasets, we demonstrated the superiority of our approach in predicting user preferences. This method is also shown to be able to maintain satisfactory performance even if user-item interactions are sparse. [ABSTRACT FROM AUTHOR]

Recently, the e-learners are drastically increased from the last two decades. Everything is learnt through internet without help of the tutor as well. For this purpose, the e-learners are required more e-learning applications that are able to supply optimal and satisfied data based on their capability. No content recommendation system is available for recommending suitable contents to the learners. For this purpose, this paper proposes a new semantic and fuzzy aware content recommendation system for retrieving the suitable content for the users. In this content recommendation system, we propose two content pre-processing algorithms namely Target Keyword based Data Pre-processing Algorithm (TKDPA) and Intelligent Anova-T Residual Algorithm (IAATRA) for selecting the more relevant features from the document. Moreover, a new Fuzzy rule based Similarity Matching algorithm (FRSMA) is proposed and used in this system for finding the similarity between the two terms and also rank them by using the newly proposed Similarity and Temporal aware Weighted Document Ranking Algorithm (STWDRA). In addition, a content clustering process is also incorporated for gathering relevant content. Finally, a new Fuzzy, Target Keyword and Similarity Score based Content Recommendation Algorithm (FTKSCRA) is also proposed for recommending the more relevant content to the learners accurately. The experiments have been conducted for evaluating the proposed content recommendation system and proved as better than the existing recommendation systems in terms of precision, recall, f-measure and prediction accuracy. [ABSTRACT FROM AUTHOR]

Legal practitioners analyze relevant previous judgments to prepare favorable and advantageous arguments for an ongoing case. In Legal domain, recommender systems (RS) effectively identify and recommend referentially and/or semantically relevant judgments. Due to the availability of enormous amounts of judgments, RS needs to compute pairwise similarity scores for all unique judgment pairs in advance, aiming to minimize the recommendation response time. This practice introduces the scalability issue as the number of pairs to be computed increases quadratically with the number of judgments i.e., O (n2). However, there is a limited number of pairs consisting of strong relevance among the judgments. Therefore, it is insignificant to compute similarities for pairs consisting of trivial relevance between judgments. To address the scalability issue, this research proposes a graph clustering based novel Legal Document Recommendation System (LDRS) that forms clusters of referentially similar judgments and within those clusters find semantically relevant judgments. Hence, pairwise similarity scores are computed for each cluster to restrict search space within-cluster only instead of the entire corpus. Thus, the proposed LDRS severely reduces the number of similarity computations that enable large numbers of judgments to be handled. It exploits a highly scalable Louvain approach to cluster judgment citation network, and Doc2Vec to capture the semantic relevance among judgments within a cluster. The efficacy and efficiency of the proposed LDRS are evaluated and analyzed using the large real-life judgments of the Supreme Court of India. The experimental results demonstrate the encouraging performance of proposed LDRS in terms of Accuracy, F1-Scores, MCC Scores, and computational complexity, which validates the applicability for scalable recommender systems. [ABSTRACT FROM AUTHOR]

Recommender System (RS) is an information filtering approach that helps the overburdened user with information in his decision making process and suggests items which might be interesting to him. While presenting recommendation to the user, accuracy of the presented list is always a concern for the researchers. However, in recent years, the focus has now shifted to include the unexpectedness and novel items in the list along with accuracy of the recommended items. To increase the user acceptance, it is important to provide potentially interesting items which are not so obvious and different from the items that the end user has rated. In this work, we have proposed a model that generates serendipitous item recommendation and also takes care of accuracy as well as the sparsity issues. Literature suggests that there are various components that help to achieve the objective of serendipitous recommendations. In this paper, fuzzy inference based approach is used for the serendipity computation because the definitions of the components overlap. Moreover, to improve the accuracy and sparsity issues in the recommendation process, cross domain and trust based approaches are incorporated. A prototype of the system is developed for the tourism domain and the performance is measured using mean absolute error (MAE), root mean square error (RMSE), unexpectedness, precision, recall and F-measure. [ABSTRACT FROM AUTHOR]

Identifying potential social media influencers (SMIs) accurately can achieve a long-time and effective concept marketing at a lower cost, and then promote the development of the corporate brand in online communities. However, potential SMIs discrimination often faces the problem of insufficient available information of the long-term evolution of the network, and the existing discriminant methods based on link analysis fail to obtain more accurate results. To fill this gap, a consensus smart discriminant algorithm (CSDA) is proposed to identify the potential SMIs with the aid of attention concentration (AC) between users in a closed triadic structure. CSDA enriches and expands the users' AC information by fusing multiple attention concentration indexes (ACIs) as well as filters the noise information caused by multi-index fusion through consensus among the indexes. Specifically, to begin with, to enrich the available long-term network evolution information, the unidirectional attention concentration indexes (UACIs) and the bidirectional attention concentration indexes (BACIs) are defined; next, the consensus attention concentration index (CACI) is selected according to the principle of minimum upper and lower bounds of link prediction bias to filter noise information; the potential SMI is determined by adaptively calculating CACI among the user to be identified, unconnected user group and their common neighbor. The validity and reliability of the proposed method are verified by the actual data of Twitter. [ABSTRACT FROM AUTHOR]

Context-Aware Recommender System (CARS) suggests more relevant services by adapting them to the user's specific context situation. Nevertheless, the use of many contextual factors can increase data sparsity while few context parameters fail to introduce the contextual effects in recommendations. Moreover, several CARSs are based on similarity algorithms, such as cosine and Pearson correlation coefficients. These methods are not very effective in the sparse datasets. This paper presents a context-aware model to integrate contextual factors into prediction process when there are insufficient co-rated items. The proposed algorithm uses Latent Dirichlet Allocation (LDA) to learn the latent interests of users from the textual descriptions of items. Then, it integrates both the explicit contextual factors and their degree of importance in the prediction process by introducing a weighting function. Indeed, the PSO algorithm is employed to learn and optimize weights of these features. The results on the Movielens 1 M dataset show that the proposed model can achieve an F-measure of 45.51% with precision as 68.64%. Furthermore, the enhancement in MAE and RMSE can respectively reach 41.63% and 39.69% compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

The existing recommender system provides personalized recommendation service for users in online shopping, entertainment, and other activities. In order to improve the probability of users accepting the system's recommendation service, compared with the traditional recommender system, the interpretable recommender system will give the recommendation reasons and results at the same time. In this paper, an interpretable recommendation model based on XGBoost tree is proposed to obtain comprehensible and effective cross features from side information. The results are input into the embedded model based on attention mechanism to capture the invisible interaction among user IDs, item IDs and cross features. The captured interactions are used to predict the match score between the user and the recommended item. Cross-feature attention score is used to generate different recommendation reasons for different user-items.Experimental results show that the proposed algorithm can guarantee the quality of recommendation. The transparency and readability of the recommendation process has been improved by providing reference reasons. This method can help users better understand the recommendation behavior of the system and has certain enlightenment to help the recommender system become more personalized and intelligent. [ABSTRACT FROM AUTHOR]

The sustainable economic learning course recommendation can quickly find the knowledge information that the user really needs from the massive information space and realize the personalized recommendation to the user. However, the occurrence of trust attacks seriously affects the normal recommendation function of the recommendation system, resulting in its failure to provide users with reliable and reliable recommendation results. In order to solve the vulnerability of the recommendation system to the support attack, based on text vector model and support vector machine, this paper makes a comprehensive analysis of the current research status of the robust recommendation technology. Moreover, based on the idea of suspicious user metrics, this paper has conducts in-depth research on how to design highly robust recommendation algorithms, and constructs a highly reliable sustainable economic learning course recommendation model. In addition to this, this research tests the performance of the system from two perspectives of course recommendation satisfaction and system retrieval accuracy. The experiment proves that the model constructed in this paper performs well in the recommendation of sustainable economic learning courses. [ABSTRACT FROM AUTHOR]

User rating information on multiple predefined aspects gathered by hotel recommendation systems generally shows a deviation between the overall rating and detailed criteria ratings. In this study, to address this deviation, we proposed a novel hotel recommendation method that clusters users with different preferences into different groups using the K-means algorithm. Moreover, we allocated weights to different criteria and obtained a comprehensive score. A case study on actual data from Tripadvisor.com showed that compared with three other models, our proposed model demonstrated a more impressive performance. This research can offer advantages to hotel service providers and customers in terms of decision making. [ABSTRACT FROM AUTHOR]

Recommender systems can recommend products by analyzing the interests and habits of users. To make more efficient recommendation, the contextual information should be collected in recommendation algorithms. In the restaurant recommendation, the location and the current time of customers should also be considered to facilitate restaurants to find potential customers and give accurate and timely recommendations. However, the existing recommendation approaches often lack the consideration of the influence of time and location. Besides, the data sparsity is an inherent problem in the collaborative filtering algorithm. To address these problems, this paper proposes a recommendation approach which combines the contextual information including time, price and location. Instead of constructing the user-restaurant scoring matrix, the proposed approach clusters price tags and generates the user-price scoring matrix to alleviate the sparsity of data. The experiment on Foursquare dataset shows that the proposed approach has a better performance than traditional ones. [ABSTRACT FROM AUTHOR]

Recommender systems have recently become a significant part of e-commerce applications. Through the different types of recommender systems, collaborative filtering is the most popular and successful recommender system for providing recommendations. Recent studies have shown that using multi-criteria ratings helps the system to know the customers better. However, bringing multi aspects to collaborative filtering causes new challenges such as scalability and sparsity. Additionally, revealing the relation between criteria is yet another optimization problem. Hence, increasing the accuracy in prediction is a challenge. In this paper, an aggregation-function based multi-criteria collaborative filtering system using Rough Sets Theory is proposed as a novel approach. Rough Sets Theory is used to uncover the relationship between the overall criterion and the individual criteria. Experimental results show that the proposed model (RoughMCCF) successfully improves the predictive accuracy without compromising on online performance. [ABSTRACT FROM AUTHOR]

Customer-based practices enable benefits to organizations in a contentious business. Offering individualized proposals increase customer loyalty to be able to afloat. Understanding customers is a vital difficulty to perform personalized recommendations. As a demographic feature, gender information essentially cannot be captured by human tracking technologies. Hence, several procedures are improved to predict undiscovered gender information. In the research, the followed indoor paths in a shopping mall are used to predict customer genders using fuzzy c-medoids, one of the soft clustering techniques. A Levenshtein-based fuzzy classification methodology is proposed the followed paths as string data. Although some studies focused on gender prediction, no research has centered on path-oriented. The novelty of the investigation is to analyze customer path data for the gender classes. [ABSTRACT FROM AUTHOR]

A recommender system (RS) delivers personalized suggestions on products based on the interest of a particular user. Content-based filtering (CBF) and collaborative filtering (CF) schemes have been previously used for this task. However, the main challenge in RS is cold start problem (CSP). This originates once a new user joins the system which makes the recommendation task tedious due to the shortage of information (clickstream, dwell time, rating, etc.) regarding the user's interest. Therefore, CBF and CF are combined together by developing a knowledge-based preference learning (KBPL) system. This system considers the demographic data that includes gender, occupation, and age for the recommendation task. Initially, the dataset is clustered using the self-organizing map (SOM) technique, then the high dimensional data is decomposed by higher-order singular value decomposition (HOSVD) and finally, Adaptive neuro-fuzzy inference system (ANFIS) predicts the output. For the big dataset, SOM is a robust clustering method and the similarities among the users can be easily observed by grid clustering. The HOSVD extracts the required information from the available data set to find the user similarity by decomposing the dataset in lower dimensions. ANFIS uses IF-THEN rules to recommend similar product to the new users. The proposed KBPL system is evaluated with the Black Friday dataset and the obtained error value is compared with the existing CF and CBF techniques. The proposed KBPL system has obtained root mean squared error (RMSE) of 0.71%, mean absolute error (MAE) of 0.54%, and mean absolute percentage error (MAPE) of 37%. Overall, the outcome of the comparative analysis shows minimum error and better performance in terms of precision, recall, and f-measure for the proposed KBPL system compared to the existing techniques and therefore more suitable for accurately recommending the products for the new users. [ABSTRACT FROM AUTHOR]

In the current era of big data, the recommender system aspires to provide users with a tailored set of personalized items from a pool of a large population. The most popular collaborative filtering system performs this information filtering process by computing similarity among users or items. This paper proposes a similarity metric that comprises of weights and values. Values are calculated by considering the matching set of users for which similarity is to be computed. The optimal values of weights are decided using an upgraded form of the Crow Search Algorithm (CSA). The exploration and exploitation stability of CSA is improvised by making use of Levy flight diffusion, adaptive operator adjustment, and event factor. The performance of the implemented metaheuristic approach is validated on Jester, MovieLens 100K, and MovieLens 1M dataset. Comparative analysis of proposed model against several other traditional metaheuristic based personalization systems reveal that our model is less delicate to the dimension of datasets and it also presents exceptional refinement in terms of prediction complexity and accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a new content recommendation system which combines the newly proposed embedded feature selection method and the new Fuzzy Temporal Logic based Decision Tree incorporated Convolutional Neural Network classifier. The newly proposed embedded feature selection called Fuzzy Decision Tree and Weighted Gini-Index based Feature Selection Algorithm (FDTWGI-FSA) that contains the existing incorporated the Fuzzy Decision Tree (FDT) and the Weighted Gini-index based Feature Selection Algorithm (WGIFSA) for getting optimized feature subset. Moreover, an enhanced CNN and Fuzzy Temporal Decision Tree for performing the deep learning process which is able to identify the exact e-content from the huge volume of data with the help of the recommended features by the proposed embedded feature selection method. The exact e-content can be identified after performing the five-layer network structure for extracting the relevant features and it also can be classified by applying the Fuzzy Temporal Decision Tree for the e-learners. Finally, the proposed content recommendation system provides exact content to the e-learners according to their level of understanding and it also satisfies them by providing the exact high level contents. The experiments have been conducted for evaluating the proposed content recommendation system and compared with the existing classifier including the standard CNN. [ABSTRACT FROM AUTHOR]

If the online education platform simply presents offline course content and teaching resources, it will result in poor interaction between teachers and students and poor student learning efficiency because of the time and space barriers in distance education. At the same time, it has a one-way teaching for all students without any difference, so its personalization is poor. In order to improve the efficiency of network education knowledge recommendation, based on the traditional neural network, this study combines the actual needs of network education to construct an improved neural network-path sorting algorithm. Moreover, this study builds a network education knowledge recommendation system based on the algorithm and explores the functions of each module of the system to realize all system functions. In addition, this study performs system function tests on a complete system. The results show that the proposed algorithm is higher than the traditional recommendation algorithm in recommendation effect and recommendation efficiency, and has certain practical effects, and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

Group recommender system provides suggestions for a group of users by exploring the choices of individual users of the group. Popularity of group recommender systems is increasing because many activities such as listening to music, watching movies, traveling, etc. are normally performed in groups rather individually. Group recommender systems like personal recommender systems also suffer from cold start and sparsity issues. The cold start and sparsity issues result into inaccurate recommendation computation which degrades the recommendation quality. To handle the cold start and sparsity issues in a Group Recommender System (GRS), this paper proposes to use cross domain approach and introduces Cross Domain Group Recommender System (CDGRS). The recommendations provided by trustworthy and reputed users in the group enhance the acceptance towards the presented recommendations as compared to the other individuals in the group. We have combined the social factors e.g. trust and reputation to get influential user in the group recommendation. A prototype of the system is developed for tourism domain that incorporates four sub-domains i.e. restaurants, hotels, tourist places and shopping places. The performance of CDGRS is compared with GRS. Spearman's Correlation Coefficient, MAE, RMSE, Precision, Recall and F-measure are used to find the accuracy of the generated recommendations. [ABSTRACT FROM AUTHOR]

Recommender Systems (RS) are expected to suggest the accurate goods to the consumers. Cold start is the most important challenge for RSs. Recent hybrid RSs combine ConF and ColF. We introduce an ontological hybrid RS where the ontology has been employed in its ConF part while improving the ontology structure by its ColF part. In this paper, a new hybrid approach is proposed based on the combination of demographic similarity and cosine similarity between users in order to solve the cold start problem of new user type. Also, a new approach is proposed based on the combination of ontological similarity and cosine similarity between items in order to solve the cold start problem of new item type. The main idea of the proposed method is to expand user/item profiles based on different strategies to build higher-performing profiles for users/items. The proposed method has been evaluated on a real dataset and the experimentations indicate the proposed method has the better performance comparing with the state of the art RS methods, especially in the case of the cold start. [ABSTRACT FROM AUTHOR]

With the popularity of networks and the increasing number of online users, recommender systems have suffered from the privacy leakage of sensitive information. While people enjoy recommender services, their information is exposed to the networks. To protect the privacy of users when using the recommender services, we propose a multi-level combined privacy-preserving model that maintains high accuracy of recommendation with privacy protection and alleviates the data sparsity problem. Our scheme contains two steps of recommendation. First, a multi-level combined random perturbation (MCRP) model is proposed on the client side. Our model dynamically divides multiple disturbance levels and adds noise of different ranges to the rating matrix according to Gaussian and uniform mixed disturbances. Second, on the server side, we propose a pseudo rating prediction filling (PRPF) algorithm based on the matrix factorization model. Combining the PRPF algorithm with the MCRP method significantly improves the recommender accuracy and effectively increases privacy security. Sensitive analysis and comparison experiments show that the proposed privacy method has certain advantages in security and recommender accuracy by using three publicly available datasets. [ABSTRACT FROM AUTHOR]

A fuzzy system is a system that defines input, output, and state variables on a fuzzy set and is a generalization of a deterministic system. The fuzzy system begins at the macro level and covers the fuzzy features of human brain thinking. It has advantages in describing advanced knowledge. Fuzzy sets can mimic the comprehensive conclusions of people solving fuzzy information problems, which are difficult to solve by conventional mathematical methods, so computer applications can be extended to humanities, social sciences and complex systems. In this way, it can better solve nonlinear problems and is widely used in automatic control, decision analysis, time series signal processing, economic information systems, medical diagnostic systems, and earthquake prediction systems. This paper aims to study the data mining algorithm of fuzzy systems based on fuzzy sets. By using the powerful fuzzy data modeling function of fuzzy theory, it combines with other intelligent processing methods, and makes practical use in industrial life. By comparing the application of fuzzy set data mining and algorithm, it is found that in the application state, the economic benefits of the factory are improved by 36% and the production efficiency is improved by 25% under the application of data mining and algorithm. The research data shows that the data mining and recommendation algorithms of fuzzy sets are beneficial to the development and operation of the factory. The research results show that compared with the conventional production and processing plan, the technology uses fuzzy set theory to transform the fuzzy attributes, which is more advantageous in scientific and technical systems and algorithms with its scientificity, accuracy, innovation and extensiveness. [ABSTRACT FROM AUTHOR]

Recommender systems are widely used to provide users with items they may be interested in without explicitly searching. However, they suffer from low accuracy and scalability problems. Although existing clustering techniques have been incorporated to solve these inherent problems, most of them fail to achieve further improvement in recommendation accuracy because of ignoring the correlations between items and the different effects of item attributes on recommendation results. In this article, we propose a novel recommendation algorithm to alleviate these issues to a large extent. First of all, users and items are clustered into multiple cluster subsets based on user-item rating matrix and item attribute deriving from domain experts, respectively. Then we use a selection method relying on item attribute to mine candidate items and only their predictions will be calculated in the next step, which can save the computation time greatly. Furthermore, by weighting the predictions with TF-IDF (Term Frequency-Inverse Document Frequency) weights, the top-N recommendations are generated to the target user for return. Finally, comparative experiments on two real datasets demonstrate that this algorithm provides superior recommendation accuracy in terms of MAE (Mean Absolute Error) and RMSE (Root Mean Square Error). [ABSTRACT FROM AUTHOR]