Search

Cervical cancer (CC) is affecting women predominantly, and early diagnosis could cure this cancer. This study aims to design and develop an effective deep learning-based classification model to detect early CC stages using clinical data. The proposed method is a combination of an unsupervised deep learning and a supervised neural network, i.e. sparse stacked autoencoder (SSAE) and fuzzy adaptive resonance theory MAP (FAM), respectively, and is denoted as SSAE-FAM. Specifically, SSAE is applied to tackle the data sparsity problem. It extracts the representative features from a data set through feature transformation. The transformed features are then classified by FAM. In this study, a CC data set obtained from the University of California Irvine (UCI) machine learning repository is utilised for evaluation. Owing to missing data in the original CC data set, two data sets are generated from the original CC data samples using two data preprocessing techniques. Both generated CC data sets with four target classes (i.e. Schiller, Cytology, Biopsy, and Hinselmann) are evaluated as four independent binary-class problems. We improve the classification performance of FAM by mitigating the data sparsity problem. Based on a series of experimental studies, SSAE-FAM outperforms other state-of-art methods by achieving 99.47%, 99.34%, 99.48%, and 99.81% mean accuracy rates, respectively, with the first CC data set, and 99.74%, 99.86%, 99.77%, and 99.80% mean accuracy rates, respectively, with the second CC data set. The results positively indicate the usefulness of SSAE-FAM for early CC diagnosis. [ABSTRACT FROM AUTHOR]

Knowledge graph-based recommender systems integrate user–item interactions with knowledge graph information through Graph Neural Networks (GNNs), demonstrating their effectiveness in addressing data sparsity and cold start issues. However, existing knowledge graph has more invalid connections; these noise connections are amplified during message aggregation in GNNs. To alleviate this problem, this paper proposes a contrastive learning filtering method based on multi-view generation. Traditional denoising methods mainly use edge perturbation or graph diffusion to randomly add or remove data, which are highly uncertain and often destroy the semantic information of the original data. We proposed the multi-view generation-based contrastive learning method can perform multiple different samples on the original data to create contrasting views. This ensures the semantic completeness of the original data while also providing rich semantic samples for contrastive learning. Specifically, the method first performs multiple rounds of data sampling from the user–item interaction graph and the knowledge graph to generate multiple views of items. Subsequently, knowledge embedding techniques are used to vectorize entities and relationships within these views. Finally, a contrastive task uses a designed loss to share semantic info among items, controlling node connections with item similarity. Through this method, the information of neighboring nodes (entities or relationships) can be propagated, the importance of neighboring nodes can be distinguished, and the recommendation result can be more precise. Extensive experiments on three benchmark datasets demonstrate that our proposed multi-view contrastive learning filtering approach significantly enhances performance in knowledge graph-based recommendation tasks. [ABSTRACT FROM AUTHOR]

Fault diagnosis plays an important role in intelligent manufacturing. Knowledge modelling is often used for intelligent fault diagnosis purposes, and link prediction is performed in knowledge graphs to locate and trace system faults. However, due to the sparsity of data during the training process, meta-learning methods have been introduced, but they can lead to the overgeneralization of the training parameters and affect the accuracy of link prediction. To address this issue, this paper proposes an entity clustering-based meta-learning model for link prediction in evolutionary fault diagnosis event graphs. The model consists of three parts: triple clustering based on graph convolutional networks, meta-learning for divide-and-conquer data, and meta-learning model reinforcement based on scene information. Through data preprocessing and additional model fitting steps, the weaknesses of the existing meta-learning approaches regarding dissimilated data learning are overcome. The experimental results show that compared with traditional embedding-based models and the existing meta-learning-based link prediction methods, the proposed method can not only improve the link prediction accuracy achieved on public datasets but also have attain performance on datasets with fault diagnosis background information. [ABSTRACT FROM AUTHOR]

The prevalence of Recommender Systems (RS) has surged due to the widespread growth of the Internet and its related technologies. The efficiency of the RS is dependent on the quality of the underlying datasets used for training. Sparse datasets present a challenge for training such systems and negatively impacts their efficiency. This research paper presents novel synergistic approaches that combine Fuzzy C-Means (FCM), Restricted Boltzmann Machines (RBM), and Extreme Learning Machines (ELM), to enhance Collaborative Filtering (CF) in RS. The study introduces two clustering-based approaches, FCM-ELM and FCM-RBM-ELM, to address the issue of non-optimal hidden biases and input weights in ELM caused by random assignment in order to overcome the data sparsity effect in RS. The efficiency of proposed approaches against different clustering methods has been evaluated using two benchmark datasets and four metrics. The empirical results indicate that the proposed methods can generate better recommendation results compared to other traditional techniques. [ABSTRACT FROM AUTHOR]

Well logging is a significant method of geological formation description and resource assessment in the exploration and development of oil, natural gas, minerals, groundwater, and sub-surface thermal energy, as well as geotechnical engineering and environmental research. However, the challenging problem of estimating well logging data always exists because well logs can only be measured through a drilling process involving costly and time-consuming field trials. This study provides a brief overview of Deep Learning (DL) models and examines the well-logging issues in estimating missing well-log data. In addition, it discusses a literature review focusing on the application of DL models for well-log estimation. The outcome of this exploratory work necessitates suitable requirements for the design and implementation. [ABSTRACT FROM AUTHOR]

To solve the recommendation accuracy degradation problem encountered in sequential recommendation cases caused by data sparsity—such as short historical user behaviour sequences and limited information—this paper proposes a sequential recommendation model based on multipair contrastive learning with informative augmentation (IA-MPCL). The model aims to better learn user preference representations. Initially, a self-attention network is utilized to maintain the intrinsic relevance of the original sequences and introduce virtual interaction items for short sequences to achieve informative enhancement. Subsequently, multiple positive samples are generated by data augmentation methods to form multiple pairs of positive and negative samples. A multipair contrastive loss is constructed to eliminate the negative impact of fake positive and negative samples on the training process of the self-attention network. Finally, an adaptive loss weighting mechanism is proposed to dynamically regulate the role of the contrastive loss during multitask training. Through comparison experiments involving baseline methods and experiments conducted on datasets with different sparsity levels, the results show that IA-MPCL achieves significant improvements in terms of both recommendation accuracy and data sparsity resistance. [ABSTRACT FROM AUTHOR]

Point-of-interest (POI) recommendation has attracted great attention in the field of recommender systems over the past decade. Various techniques, such as those based on matrix factorization and deep neural networks, have demonstrated outstanding performance. However, these methods are susceptible to the impact of data sparsity. Data sparsity is a significant characteristic of POI recommendation, where some POIs have limited interaction records and, in extreme cases, become cold-start POIs with no interaction history. To alleviate the influence of data sparsity on model performance, this paper introduced FAGRec, a POI-recommendation model based on the feature-aware graph. The key idea was to construct an interaction graph between POIs and their initial features. This allows the transformation of POI features into a weighted aggregation of initial features. Different POIs can share the learned representations of initial features, thereby mitigating the issue of data sparsity. Furthermore, we proposed attention-based graph neural networks and a user preference estimation method based on delayed time factors for learning representations of POIs and users, contributing to the generation of recommendations. Experimental results on two real-world datasets demonstrate the effectiveness of FAGRec in the task of POI recommendation.

Abstract Given the challenges of inter-domain information fusion and data sparsity in collaborative filtering algorithms, this paper proposes a cross-domain information fusion matrix decomposition algorithm to enhance the accuracy of personalized recommendations in artificial intelligence recommendation systems. The study begins by collecting Douban movie rating data and social network information. To ensure data integrity, Levenshtein distance detection is employed to remove duplicate scores, while natural language processing technology is utilized to extract keywords and topic information from social texts. Additionally, graph convolutional networks are utilized to convert user relationships into feature vectors, and a unique thermal coding method is used to convert discrete user and movie information into binary matrices. To prevent overfitting, the Ridge regularization method is introduced to gradually optimize potential feature vectors. Weighted average and feature connection techniques are then applied to integrate features from different fields. Moreover, the paper combines the item-based collaborative filtering algorithm with merged user characteristics to generate personalized recommendation lists.In the experimental stage, the paper conducts cross-domain information fusion optimization on four mainstream mathematical matrix decomposition algorithms: alternating least squares method, non-negative matrix decomposition, singular value decomposition, and latent factor model (LFM). It compares these algorithms with the non-fused approach. The results indicate a significant improvement in score accuracy, with mean absolute error and root mean squared error reduced by 12.8% and 13.2% respectively across the four algorithms. Additionally, when k = 10, the average F1 score reaches 0.97, and the ranking accuracy coverage of the LFM algorithm increases by 54.2%. Overall, the mathematical matrix decomposition algorithm combined with cross-domain information fusion demonstrates clear advantages in accuracy, prediction performance, recommendation diversity, and ranking quality, and improves the accuracy and diversity of the recommendation system. By effectively addressing collaborative filtering challenges through the integration of diverse techniques, it significantly surpasses traditional models in recommendation accuracy and variety.

Point-of-interest (POI) recommendation has attracted great attention in the field of recommender systems over the past decade. Various techniques, such as those based on matrix factorization and deep neural networks, have demonstrated outstanding performance. However, these methods are susceptible to the impact of data sparsity. Data sparsity is a significant characteristic of POI recommendation, where some POIs have limited interaction records and, in extreme cases, become cold-start POIs with no interaction history. To alleviate the influence of data sparsity on model performance, this paper introduced FAGRec, a POI-recommendation model based on the feature-aware graph. The key idea was to construct an interaction graph between POIs and their initial features. This allows the transformation of POI features into a weighted aggregation of initial features. Different POIs can share the learned representations of initial features, thereby mitigating the issue of data sparsity. Furthermore, we proposed attention-based graph neural networks and a user preference estimation method based on delayed time factors for learning representations of POIs and users, contributing to the generation of recommendations. Experimental results on two real-world datasets demonstrate the effectiveness of FAGRec in the task of POI recommendation. [ABSTRACT FROM AUTHOR]

Defect density is an essential software testing and maintenance aspect that determines the quality of software products. It is used as a management factor to distribute limited human resources successfully. The availability of public defect datasets facilitates building defect density prediction models using established static code metrics. Since the data gathered for software modules are often subject to uncertainty, it becomes difficult to deliver accurate and reliable predictions. To alleviate this issue, we propose a new prediction model that integrates gray system theory and fuzzy logic to handle the imprecision in software measurement. We propose a new similarity measure that combines the benefits of fuzzy logic and gray relational analysis. The proposed model was validated against defect density prediction models using public defect datasets. The defect density variable is frequently sparse because of the vast number of none‐defected modules in the datasets. Therefore, we also check our proposed model's performance against the sparsity level. The findings reveal that the developed model surpasses other defect density prediction models over the datasets with high and very high sparsity ratios. The ensemble learning techniques are competitive choices to the proposed model when the sparsity ratio is relatively small. On the other hand, the statistical regression models were the most inadequate methods for such problems and datasets. Finally, the proposed model was evaluated against different degrees of uncertainty using a sensitivity analysis procedure. The results showed that our model behaves stably under different degrees of uncertainty. [ABSTRACT FROM AUTHOR]

Recommender system always suffers from various recommendation biases, seriously hindering its development. In this light, a series of debias methods have been proposed in the recommender system, especially for two most common biases, i.e., popularity bias and amplified subjective bias. However, existing debias methods usually concentrate on correcting a single bias. Such single-functionality debiases neglect the bias-coupling issue in which the recommended items are collectively attributed to multiple biases. Besides, previous work cannot tackle the lacking supervised signals brought by sparse data, yet which has become a commonplace in the recommender system. In this work, we introduce a disentangled debias variational auto-encoder framework (DB-VAE) to address the single-functionality issue as well as a counterfactual data enhancement method to mitigate the adverse effect due to the data sparsity. In specific, DB-VAE first extracts two types of extreme items only affected by a single bias based on the collier theory, which are, respectively, employed to learn the latent representation of corresponding biases, thereby realizing the bias decoupling. In this way, the exact unbiased user representation can be learned by these decoupled bias representations. Furthermore, the data generation module employs Pearl's framework to produce massive counterfactual data to help fully train the model, making up the lacking supervised signals due to the sparse data. Extensive experiments on three real-world data sets demonstrate the effectiveness of our proposed model. Specifically, our model outperforms the best baseline by 19.5% in terms of Recall@20 and 9.5% in terms of NDCG@100 in the best scenario. Besides, the counterfactual data can further improve DB-VAE, especially on the data set with low sparsity. [ABSTRACT FROM AUTHOR]

In recent times, recommender systems have acquired significant popularity as a solution to the issue of information overload. These systems offer personalised recommendations to users. The superiority of multi-criteria recommender systems over their single-criterion counterparts has been demonstrated, as the former are able to provide more precise recommendations by taking into account multiple dimensions of user preferences when rating items. The prevalent recommendation technique, matrix factorization of collaborative filtering, is hindered by the data sparsity problem of the user-item matrix. On the other hand, it is noteworthy that deep learning techniques have demonstrated significant potential in various research domains, including but not limited to image processing, pattern recognition, computer vision, and natural language processing. In recent times, there has been a surge in the utilisation of deep learning techniques in recommender systems, yielding promising outcomes. This study presents a novel approach to multi-criteria recommender systems through the utilisation of deep learning algorithms to mitigate the data sparsity issue. Specifically, deep autoencoders are utilised to uncover complex, non-linear, and latent relationships between users' multi-criteria preferences followed by matrix factorization technique, ultimately leading to more precise recommendations. The proposed model is evaluated by conducting the experiments on the multi-criteria dataset of Yahoo! Movies. According to the outcomes, the proposed approach outperforms the state of the art recommendation methods by generating more accurate and personalized recommendations. Also, it reduces the data sparsity up to 11% from the multi-criteria dataset. [ABSTRACT FROM AUTHOR]

Copyright of Journal of South-Central Minzu University (Natural Science Edition) is the property of Journal of South-Central Minzu University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Recommender systems are essential tools that provide personalized user experiences across various domains such as e-commerce, entertainment, social media, education and content streaming. The integration of auxiliary information, including user demographics, item attributes, and contextual data has shown significant promise in enhancing the performance of recommender systems. This systematic review investigates the impact of incorporating auxiliary information into various types of recommender systems, examining recent advancements, methodologies, datasets, evaluation metrics, and to equally examine its significance on generative artificial intelligence. Similarly, five (5) reputable online databases were used to identify the relevant studies for answering our research questions. To obtain effective results of our findings, we focus more on the recent studies published between (2019 - June 2024) to ensure that of our findings up-to-date. After filtering the selected primary papers that solely focused on auxiliary information recommender systems a total of 37 papers were identified and analyzed. Our analysis shows the most utilized datasets, metrics, models, addressed issues and future works. Research limitations and future scope are also highlighted to assist researchers and practitioners for their future studies.

In the realm of urban development, the precise classification and identification of land types are crucial for improving land use efficiency. This article proposes a land recognition and classification method based on data sparsity and improved Soft Hirschfeld-Gebelein-Rényi (Soft-HGR) under multimodal conditions. First, a sparse information processing module is designed to enhance information accuracy and quickly obtain data sample features. Then, to solve the problem of information independence in single mode and lack of fusion in multimodal mode, an improved SoftHGR module is developed. This module incorporates covariance and trace constraints, enhances machine learning efficiency by stabilizing output and addressing dimensionality and variance issues in HGR, and speeds up land classification by cross-fusing multimodal features to deepen the understanding of diverse information interconnections. Based on this, a multimodal MI-SoftHGR fusion network is constructed, which can achieve cross-correlation sharing and collaborative extraction of feature information, thereby realizing accurate remote sensing image recognition and classification under multimodal conditions. Finally, empirical evaluations were conducted on Berlin, Augsburg, and MUUFL datasets, and the proposed method was compared with state-of-the-art algorithms. The results fully validate the efficacy and significant superiority of the proposed method.

Recommender systems are crucial in today’s digital world, by enhancing user engagement experience in digital ecosystems. Internet of things (IoT) have huge potential to generate dynamic and real time data. The data generated through IoT are being utilized to extract dynamic context of the user. Integrating recommender systems with context-aware (IoT data) and cross-domain (Knowledge Transfer) capabilities have the capacity to further enhance the accuracy and relevance of recommendation systems. However, recommender systems struggle with the cold start problem, where non-availability of data hinders to make effective recommendations for new users. Therefore, IoT-enabled Context-Aware Cross-Domain Recommender Systems may employ latent user profiling to provide personalized and exceedingly relevant recommendations across domains. The proposed system, named Knowledge Transfer Cross-Domain User Latent Factors (KT-CDULF), creates a user profile that spans multiple data domains, capturing a wide range of user behavior on all domains. The KT-CDULF captures the combined knowledge across domains to make recommendations even with limited user data, i.e. cold start problem. Domain-independent factors, and context can be used across domains to make relevant recommendations. The effectiveness of a recommender system depends on the density of the ratings in the data. To address this, KT-CDULF used two benchmark datasets to create user profiles and an item-rating matrix with additional context extracted from IoT generated dataset. KT-CDULF is evaluated and compared it with state-of-the-art models for recommender systems and achieves an accuracy of 98%, demonstrating the benefits of transferring knowledge containing context across data domains in recommender systems.

Abstract Recommender system always suffers from various recommendation biases, seriously hindering its development. In this light, a series of debias methods have been proposed in the recommender system, especially for two most common biases, i.e., popularity bias and amplified subjective bias. However, existing debias methods usually concentrate on correcting a single bias. Such single-functionality debiases neglect the bias-coupling issue in which the recommended items are collectively attributed to multiple biases. Besides, previous work cannot tackle the lacking supervised signals brought by sparse data, yet which has become a commonplace in the recommender system. In this work, we introduce a disentangled debias variational auto-encoder framework (DB-VAE) to address the single-functionality issue as well as a counterfactual data enhancement method to mitigate the adverse effect due to the data sparsity. In specific, DB-VAE first extracts two types of extreme items only affected by a single bias based on the collier theory, which are, respectively, employed to learn the latent representation of corresponding biases, thereby realizing the bias decoupling. In this way, the exact unbiased user representation can be learned by these decoupled bias representations. Furthermore, the data generation module employs Pearl’s framework to produce massive counterfactual data to help fully train the model, making up the lacking supervised signals due to the sparse data. Extensive experiments on three real-world data sets demonstrate the effectiveness of our proposed model. Specifically, our model outperforms the best baseline by 19.5% in terms of Recall@20 and 9.5% in terms of NDCG@100 in the best scenario. Besides, the counterfactual data can further improve DB-VAE, especially on the data set with low sparsity.

One of the methods most frequently used to recommend films is collaborative filtering. We examine the potential of collaborative filtering in our paper’s discussion of product suggestions. In addition to utilizing collaborative filtering in a new application, the proposed system will present a better technique that focuses especially on resolving the cold start issue. The suggested system will compute similarity using the Pearson Correlation Coefficient (PCC). Collaborative filtering that uses PCC suffers from the cold start problem or a lack of information on new users to generate useful recommendations. The proposed system solves the issue of cold start by gauging each new user by certain arbitrary parameters and recommending based on the choices of other users in that demographic. The proposed system also solves the issue of users’ reluctance to provide ratings by implementing a keyword-based perception system that will aid users in finding the right product for them.

This research paper introduces a novel personalized music recommendation system that leverages collaborative filtering and semantic analysis techniques. The system aims to generate customized music recommendations tailored to individual users' preferences and listening histories. By employing collaborative filtering, the system identifies users with similar music tastes and suggests music they enjoy. Additionally, semantic analysis is utilized to analyze the current sentiment of a user, enabling the system to recommend songs suitable for the user's mood for initial recommendations. A dataset containing user listening histories and music metadata is utilized to evaluate the system's performance. The results demonstrate that the proposed system surpasses traditional collaborative filtering approaches in identifying the coldstart issue for new users. This capability enhances the music listening experience by providing more relevant and personalized recommendations while facilitating the discovery of new and captivating music. The system's unique approach of combining collaborative filtering and semantic analysis provides a fresh perspective on personalized music recommendations, contributing to the advancement of music recommendation systems. The evaluation outcomes signify the promising nature of the proposed method. Future research can focus on further optimizing the system's performance through additional refinements and evaluations. [ABSTRACT FROM AUTHOR]

Recommender system (RS) aims to predict user preferences based on automatic data acquisition, and those collected data assist in achieving the final decision. However, RS suffers from data sparsity issues over the newly launched system, and the lack of time to deal with the massive data is also a challenging factor. To acquire proper outcomes, cross-domain RS intends to transfer knowledge from the specific domain with quality enriched data to help recommendations to the target domains. The entities may or may not be overlapped, and it is common for the entities of two domains to be overlapped. These overlapping entities may show variations in their target domain, and avoiding these issues leads to distorted prediction outcomes over the cross-domain RS. To address these issues, this research concentrates on modeling and efficient cross-domain RS using the generative and discriminative adversarial network (CRS-GDAN) model for kernel-based transfer modeling. Domain specific is considered to handle the feature space of overlapped entities, and transfer computation is adopted to handle the overlapping and non-overlapping entity correlation among the domains. Based on the anticipated concept, knowledge transfer is achieved rigorously even in the case of overlapping entities, thus diminishing the data sparsity issues. The experimentation is performed using an available online dataset, and the model attains a 20% better outcome than other approaches. The outcomes specify that the knowledge transfer from source to destination target is advantageous even in overlapping issues. [ABSTRACT FROM AUTHOR]

Mapping-based cross-domain recommendation (CDR) can effectively tackle the cold-start problem in traditional recommender systems. However, existing mapping-based CDR methods ignore data-sparse users in the source domain, which may impact the transfer efficiency of their preferences. To this end, this paper proposes a novel method named Neighbor Interaction-based Personalized Transfer for Cross-Domain Recommendation (NIPT-CDR). This proposed method mainly contains two modules: (i) an intra-domain item supplementing module and (ii) a personalised feature transfer module. The first module introduces neighbour interactions to supplement the potential missing preferences for each source domain user, particularly for those with limited observed interactions. This approach comprehensively captures the preferences of all users. The second module develops an attention mechanism to guide the knowledge transfer process selectively. Moreover, a meta-network based on users' transferable features is trained to construct personalised mapping functions for each user. The experimental results on two real-world datasets show that the proposed NIPT-CDR method achieves significant performance improvements compared to seven baseline models. The proposed model can provide more accurate and personalised recommendation services for cold-start users. [ABSTRACT FROM AUTHOR]

Sequential recommendation systems are vital for enhancing user experience and efficiency in e-commerce and online platforms by providing personalized suggestions. However, these systems often encounter challenges such as data sparsity and inaccuracy in identifying user preferences, leading to suboptimal recommendation quality. Existing solutions, like data augmentation and causal inference, have attempted to tackle these issues but have frequently neglected the crucial aspect of user feedback, which could potentially misrepresent user interests. In this paper, a new approach is introduced that incorporates a counterfactual classifier, textual information, and user feedback to enhance user-item interactions and the effectiveness of sequential recommendation systems. Our proposal is EUICC-SRec, a new methodology that incorporates a counterfactual classifier, a text module with bidirectional GRU channels, and a cross-attention mechanism. This method is designed to address data sparsity and enhance the precision of sequential recommendations by improving accuracy and relevance. The proposed approach has been evaluated through extensive experiments, demonstrating its superiority in mitigating data sparsity issues and accurately capturing user preferences compared to existing methods.

Collaborative filtering is a widely used technique for providing personalized recommendations to users. However, traditional collaborative filtering methods fail to consider the social connections between users. The current study proposes a collaborative filtering recommendation framework that employs social networks to generate more precise and pertinent recommendations. The framework is based on a modified version of the user-based collaborative filtering algorithm, which computes user similarity based on their ratings and social connections. The similarity measure is determined by a weighted combination of these two factors, with the weights learned through an optimization process. The framework is evaluated using a dataset of movie ratings and social connections between users. The findings reveal that the proposed approach outperforms traditional collaborative filtering methods regarding recommendation accuracy and relevance. Moreover, the framework can offer more diverse recommendations compared to traditional methods. In summary, the proposed framework integrates social networks to enhance the accuracy and relevance of collaborative filtering recommendations. The approach has various applications, including e-commerce, music, and movie recommendation, and can potentially address the issues of cold-start and sparsity in collaborative filtering.

Movie recommendation systems are efficient tools to help users find their relevant movies by investigating the previous interests of users. These systems are established on considering the ratings of users provided for movies in the past and using them to predict their interests in the future. However, users mainly provide insufficient ratings leading to make a problem called data sparsity. This problem makes reducing the effectiveness of movie recommendation systems. On the other hand, other available data such as genres of movies and demographic information of users play a vital role in assisting recommenders in order to better produce recommendations. This paper proposes a movie recommendation method utilizing the movies' genres and users' demographic information. In particular, we propose an effective model to evaluate the user's rating profile and determine the minimum number of ratings required to produce an accurate prediction. Then, appropriate virtual ratings are incorporated into the profiles with insufficient ratings to expand them. These virtual ratings are calculated using similarity values between users obtained by genres of movies and demographic information of users. Furthermore, an effective measure is introduced to determine how much an item is reliable. This measure guarantees the virtual ratings' reliability. Finally, unknown ratings for target user are predicted based on the expanded rating profiles. Experiments performed on two well-known movie recommendation datasets demonstrate that the proposed approach is more efficient than other compared recommenders. [ABSTRACT FROM AUTHOR]

Latent factor-based methods have been extensively employed in recommender systems to project users and items to the same feature space and use the dot product for predicting unknown ratings. Nevertheless, the dot product method cannot describe the various influences of latent features. Also, it only captures the linear relations between users and items leading to a negative impact on the efficiency of recommender systems. Deep learning models are known as state-of-the-art techniques to deal with the non-linear relation between user and item. In this paper, we develop a new deep hybrid recommender system called DHSIRS using multilayer perceptron neural network to combine side information and interaction matrix for item recommendation. Specifically, two feature learning components are developed to extract side information-based and interaction-based latent features. Therefore, two paralleled deep neural networks are utilized in the side information-based feature learning part to obtain the feature vector for users and items from side information. Moreover, the interaction-based feature learning part obtains the latent features from the user-item matrix. Finally, we introduce a deep learning model instead of the dot product method to predict unknown ratings by integrating the side information-based and interaction-based latent features. Unlike other methods that use the dot product, our method is able to efficiently learn the high-order non-linear relations between users and items. Extensive experiments on three publicly available datasets demonstrate that DHSIRS averagely improves the recommendation performance by around 4.18% in comparison to the second-best model over different evaluation metrics. [ABSTRACT FROM AUTHOR]

The key to sequential recommendation modeling is to capture dynamic users' interests. Existing sequential recommendation methods (e.g., self-attention mechanism) have achieved extraordinary success in modeling users' interests. However, these models ignore that users have different levels of preferences for different aspects of items, failing to capture users' most concerning aspects. In addition, they are highly dependent on the quality of training data, which may lead to overfitting of the model when the training data is insufficient. To address the above issues, we propose a novel sequence-aware model (Multi-Aspect Features of Items for Time-Ordered Sequential Recommendation, MFITSRec), which combines the features of items with user behavior sequences to learn more complex item-item and item-attribute relationships. Moreover, the model uses a self-attention network based on an absolute time relationship, which can better represent the changes in users' interests and capture users' preferences for particular aspects of items. Extensive experiments on five datasets demonstrate that our model outperforms various baseline models. In particular, the model's prediction accuracy has been significantly improved on sparse datasets. [ABSTRACT FROM AUTHOR]

Data sparsity limits the performance of point-of-interest (POI) recommendation models, and the existing works ignore the higher-order collaborative influence of users and POIs and lack in-depth mining of user social influence, resulting in unsatisfactory recommendation results. To address the above issues, this paper proposes a personalized POI recommendation using an improved graph convolutional network (PPR_IGCN) model, which integrates collaborative influence and social influence into POI recommendations. On the one hand, a user-POI interaction graph, a POI-POI graph, and a user–user graph are constructed based on check-in data and social data in a location-based social network (LBSN). The improved graph convolutional network (GCN) is used to mine the higher-order collaborative influence of users and POIs in the three types of relationship graphs and to deeply extract the potential features of users and POIs. On the other hand, the social influence of the user's higher-order social friends and community neighbors on the user is obtained according to the user's higher-order social embedding vector learned in the user–user graph. Finally, the captured user and POI's higher-order collaborative influence and social influence are used to predict user preferences. The experimental results on Foursquare and Yelp datasets indicate that the proposed model PPR_IGCN outperforms other models in terms of precision, recall, and normalized discounted cumulative gain (NDCG), which proves the effectiveness of the model. [ABSTRACT FROM AUTHOR]

MicroRNAs (miRNAs) are a family of non-coding RNA molecules with vital roles in regulating gene expression. Although researchers have recognized the importance of miRNAs in the development of human diseases, it is very resource-consuming to use experimental methods for identifying which dysregulated miRNA is associated with a specific disease. To reduce the cost of human effort, a growing body of studies has leveraged computational methods for predicting the potential miRNA–disease associations. However, the extant computational methods usually ignore the crucial mediating role of genes and suffer from the data sparsity problem. To address this limitation, we introduce the multi-task learning technique and develop a new model called MTLMDA (M ulti- T ask L earning model for predicting potential M icroRNA- D isease A ssociations). Different from existing models that only learn from the miRNA–disease network, our MTLMDA model exploits both miRNA–disease and gene–disease networks for improving the identification of miRNA–disease associations. To evaluate model performance, we compare our model with competitive baselines on a real-world dataset of experimentally supported miRNA–disease associations. Empirical results show that our model performs best using various performance metrics. We also examine the effectiveness of model components via ablation study and further showcase the predictive power of our model for six types of common cancers. The data and source code are available from https://github.com/qwslle/MTLMDA. [ABSTRACT FROM AUTHOR]

Aiming at the problems of traditional point of interest (POI), such as sparse data, lack of negative feedback, and dynamic and periodic changes of user preferences, a POI recommendation method using deep learning in location-based social networks (LBSN) considering privacy protection is proposed. First, the idea of Embedding is used to quantify the user information, friend relationship, POI information, and so on, so as to obtain the internal relationship of the location. Then, based on the user's history and current POI check-in sequence set, the long- and short-term attention mechanism (LSA) is constructed, and the quantified information is used as the input of LSA to better capture the user's long-term and short-term preferences. Finally, the social network information and semantic information are fitted in different input layers, and the time and geographical location information of user's historical behavior are used to recommend the next POI for users. Gowalla and Brightkite datasets are used to demonstrate the proposed method. The results show that the performance of the proposed method is better than other comparison methods under different sparsity, location sequence length, and embedding length. When the number of iterations is 500, the recommended method tends to be stable, and the accuracy is 0.27. Moreover, the recommendation time of the proposed method is less than 130 ms, which is better than other comparative deep learning methods. [ABSTRACT FROM AUTHOR]

Point‐of‐interest (POI) recommendation has always faced serious data sparsity problem. Most of the existing POI recommendation methods do not consider the bidirectional relationship between the user‐preference for locations and the location‐ attractiveness to users in the original dataset when solving the sparsity. For this problem, a point‐of‐interest recommendation method based on bidirectional matrix and deep belief network (POI_DBNBM) is proposed in this paper. Specially, from the perspectives of users and locations, we first construct two different matrices with bidirectional relationship by mapping the original dataset, and we use deep belief network (DBN) with strong learning ability to predict the two matrices. Then, a local–global weight optimization method is developed to weight and fuse the two result matrices obtained by DBN, so as to achieve the more precise user's rating prediction matrix for locations. The abundant experimental studies and evaluations are conducted on FourSquare dataset. Results are encouraging and better than those previously reported on the dataset. © 2023 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Recommender systems search the underlying preferences of users according to their historical ratings and recommend a list of items that may be of interest to them. Rating information plays an important role in revealing the true tastes of users. However, previous research indicates that natural noises may exist in the historical ratings and mislead the recommendation results. To deal with natural noises, different methods have been proposed, such as directly removing noises, correcting noise by re-predicting, or using additional information. However, these methods introduce some new problems, such as data sparsity and introducing new sources of noise. To address the problems, we present a new approach to managing natural noises in recommendation systems. Firstly, we provide the detection criteria for natural noises based on the classifications of users and items. After the noises are detected, we correct them with threshold values weighted by probabilities. Experimental results show that the proposed method can effectively correct natural noise and greatly improve the quality of recommendations. [ABSTRACT FROM AUTHOR]

Short text classification is an important task in Natural Language Processing (NLP). The classification result for Chinese short text is always not ideal due to the sparsity problem of them. Most of the previous classification models for Chinese short text are based on word or character, considering that Chinese radical can also represent the meaning individually, so word, character and radical are all used to build a Chinese short text classification model in this paper, which solves the data sparsity problem of short text. In addition, in the process of segmenting sentences into words, considering that jieba will cause the loss of key information and ngram will generate noise words, both jieba and ngram are used to construct a six-granularity (i.e. word-jieba, word-jieba-radical, word-ngram, word-ngram-radical, character and character-radical) based Chinese short text classification (SGCSTC) model. Additionally, different weights are assigned to the six granularities and are automatically updated in the process of back-propagation using cross-entropy loss due to the different influence of them on the classification results. The classification Accuracy, Precision, Recall and F1 of SGCSTC in THUCNews-S dataset are 93.36%, 94.47%, 94.15% and 94.31% respectively, and that in CNT dataset are 92.67%, 92.38%, 93.15% and 92.76% respectively, and multiple comparative experiment results on THUCNews-S and CNT datasets show that SGCSTC outperforms the state-of-the-art text classification models.