Search Results (131)

In the realm of recommender systems, the prediction of diverse customer preferences has emerged as a compelling research challenge, particularly for multi-state business organizations operating across various geographical regions. Collaborative filtering, a widely utilized recommendation technique, has demonstrated its efficacy in sectors such as e-commerce, tourism, hotel management, and entertainment-based customer services. In the item-based collaborative filtering approach, users’ evaluations of purchased items are considered uniformly, without assigning weight to the participatory data sources and users’ ratings. This approach results in the ‘relevance problem’ when assessing the generated recommendations. In such scenarios, filtering collaborative patterns based on regional and local characteristics, while emphasizing the significance of branches and user ratings, could enhance the accuracy of recommendations. This paper introduces a turnover-based weighting model utilizing a big data processing framework to mine multi-level collaborative filtering patterns. The proposed weighting model assigns weights to participatory data sources based on the turnover cost of the branches, where turnover refers to the revenue generated through total business transactions conducted by the branch. Furthermore, the proposed big data framework eliminates the forced integration of branch data into a centralized repository and avoids the complexities associated with data movement. To validate the proposed work, experimental studies were conducted using a benchmarking dataset, namely the ‘Movie Lens Dataset’. The proposed approach uncovers multi-level collaborative pattern bases, including global, sub-global, and local levels, with improved predicted ratings compared with results generated by traditional recommender systems. The findings of the proposed approach would be highly beneficial to the strategic management of an interstate business organization, enabling them to leverage regional implications from user preferences. Full article

Wallboard outsourcing is a critical task in cloud-based manufacturing, where demand enterprises seek suitable suppliers for machining services through online platforms. However, the recommendation process faces significant challenges, including sparse rating data, unstructured textual descriptions from suppliers, and complex, non-linear user preferences. To address these issues, this paper proposes AttVAE-PMF, a novel recommendation method based on dual-channel neural networks and probabilistic matrix factorization. Specifically, an attention-enhanced long short-term memory (LSTM) is employed to extract semantic features from free-text supplier descriptions, while a variational autoencoder (VAE) is used to model latent preferences from sparse demand-side ratings. These two types of latent representations are then fused via probabilistic matrix factorization (PMF) to complete the rating matrix and infer enterprise preferences. Experiments conducted on both the wallboard dataset and the MovieLens-100K dataset demonstrate that AttVAE-PMF outperforms baseline methods—including PMF, DLCRS, and SSAERec—in terms of convergence speed and robustness to data sparsity, validating its effectiveness in handling sparse and heterogeneous information in wallboard outsourcing recommendation scenarios. Full article

Post hoc explanations for black-box machine learning models have been criticized for potentially inaccurate surrogate models and computational burden at prediction time. We propose pre hoc and co hoc explainability frameworks that integrate interpretability directly into the training process through an inherently interpretable white-box model. Pre hoc uses the white-box model to regularize the black-box model, while co hoc jointly optimizes both models with a shared loss function. We extend these frameworks to generate instance-specific explanations using Jensen–Shannon divergence as a regularization term. Our two-phase approach first trains models for fidelity, then generates local explanations through neighborhood-based fine-tuning. Experiments on credit risk scoring and movie recommendation datasets demonstrate superior global and local fidelity compared to LIME, without compromising accuracy. The co hoc framework additionally enhances white-box model accuracy by up to 3%, making it valuable for regulated domains requiring interpretable models. Our approaches provide more faithful and consistent explanations at a lower computational cost than existing methods, offering a promising direction for making machine learning models more transparent and trustworthy while maintaining high prediction accuracy. Full article

Music, movies, books, pictures, and other media can change a user’s emotions, which are important factors in recommending appropriate items. As users’ emotions change over time, the content they select may vary accordingly. Existing emotion-based content recommendation methods primarily recommend content based on the user’s current emotional state. In this study, we propose a continuous music recommendation method that adapts to a user’s changing emotions. Based on Thayer’s emotion model, emotions were classified into four areas, and music and user emotion vectors were created by analyzing the relationships between valence, arousal, and each emotion using a multiple regression model. Based on the user’s emotional history data, a personalized mental model (PMM) was created using a Markov chain. The PMM was used to predict future emotions and generate user emotion vectors for each period. A recommendation list was created by calculating the similarity between music emotion vectors and user emotion vectors. To prove the effectiveness of the proposed method, the accuracy of the music emotion analysis, user emotion prediction, and music recommendation results were evaluated. To evaluate the experiments, the PMM and the modified mental model (MMM) were used to predict user emotions and generate recommendation lists. The accuracy of the content emotion analysis was 87.26%, and the accuracy of user emotion prediction was 86.72%, an improvement of 13.68% compared with the MMM. Additionally, the balanced accuracy of the content recommendation was 79.31%, an improvement of 26.88% compared with the MMM. The proposed method can recommend content that is suitable for users. Full article

Knowledge graph-enhanced recommendation has gained increasing attention for its ability to provide structured semantic context. However, most existing approaches struggle with two critical challenges: the sparsity of long-tail relations in knowledge graphs and the lack of adaptability to users’ dynamic preferences. In this paper, we propose GLARA, a novel recommendation framework that combines semantic abstraction and behavioral adaptation through a two-stage modeling process. First, a Virtual Relational Knowledge Graph (VRKG) is constructed by clustering semantically similar relations into higher-level virtual groups, which alleviates relation sparsity and enhances generalization. Then, a global Local Weighted Smoothing (LWS) module and a local Graph Attention Network (GAT) are integrated to jointly refine item and user representations: LWS propagates information within each virtual relation subgraph to improve semantic consistency, while GAT dynamically adjusts neighbor importance based on recent interaction signals. Extensive experiments on Last.FM and MovieLens-1M demonstrate that GLARA outperforms state-of-the-art methods, achieving up to 5.8% improvements in NDCG@20, especially in long-tail and cold-start scenarios. Additionally, case studies confirm the model’s interpretability by tracing recommendation paths through clustered semantic relations. This work offers a flexible and interpretable solution for robust recommendation under sparse and dynamic conditions. Full article

Recommendation systems (RSs) play a vital role in e-commerce and content platforms, yet balancing efficiency and recommendation quality remains challenging. Traditional deep models are computationally expensive, while heuristic methods like particle swarm optimization struggle with discrete optimization. To address these limitations, this paper proposes elite-evolution-based discrete particle swarm optimization (EEDPSO), a novel framework specifically designed to optimize high-dimensional combinatorial recommendation tasks. EEDPSO restructures the velocity and position update mechanisms to operate effectively in discrete spaces, integrating neighborhood search, elite evolution strategies, and roulette-wheel selection to balance exploration and exploitation. Experiments on the MovieLens and Amazon datasets show that EEDPSO outperforms five metaheuristic algorithms (GA, DE, SA, SCA, and PSO) in both recommendation quality and computational efficiency. For datasets below the million-level scale, EEDPSO also demonstrates superior performance compared to deep learning models like FairGo. The results establish EEDPSO as a robust optimization strategy for recommendation systems that effectively handles the cold-start problem. Full article

We propose a novel recommendation model for diversifying furniture recommendations and aligning them more closely with user preferences. Our model builds upon the Recommender Variational Autoencoder (RecVAE), known for its effectiveness and ability to overcome overfitting by linking user feedback with user representation. However, since RecVAE relies on implicit feedback data, it tends to exhibit bias towards popular items, potentially creating a recommendation filter bubble. While previous work has proposed user profiles learned from a user’s personal information and the textual data of an item, we propose user profiles generated from the image data on the item given the points of interest when selecting items in e-commerce and the ease of data acquisition. We hypothesize that to capture user preferences and provide tailored furniture recommendations accurately, it is essential to incorporate both reviewed text information and visual data on furniture pieces. To utilize user preferences well, we incorporate the Conditional Variational Autoencoder (CVAE) architecture, where both the encoder and decoder are conditioned on a user profile indicating the user’s preference information. Additionally, the user profile is trained to capture the user’s preference for a specific predefined style. We trained our models using MovieLens-20M and the Amazon Furniture Review Dataset, a new dataset dedicated to furniture recommendations. As a result, on both datasets, our model outperformed previous models, including RecVAE. These findings show the effectiveness of our user profile approach in diversifying and personalizing furniture recommendations. Full article

With the explosive growth of information on the internet, personalized recommendation technology has become an important tool for helping users efficiently acquire information. However, existing spreading-based recommendation algorithms only consider user choices and fail to fully leverage the potential relationships between users and items. Additionally, the incomplete utilization of user and item information limits their application potential and applicable scenarios, resulting in suboptimal recommendation performance in practical applications. To address this issue, we propose a Light Graph Convolutional Recommendation Algorithm Based on Hybrid Spreading (LGCNHS). This algorithm first optimizes the embeddings of users and items using their respective feature matrix, then learns the latent embedding representations of users and items through a lightweight graph convolutional network. Finally, the latent embedding representations are incorporated as key parameters into the hybrid spreading recommendation algorithm to generate recommendations. Comparative experiments on two publicly available datasets, MovieLens and Douban, demonstrate that LGCNHS achieves improved accuracy and diversity in recommendations compared to related methods. The algorithm code is available on github. Full article

Conversational recommender systems (CRSs) have garnered increasing attention for their ability to provide personalized recommendations through natural language interactions. Although large language models (LLMs) have shown potential in recommendation systems owing to their superior language understanding and reasoning capabilities, extracting and utilizing implicit user preferences from conversations remains a formidable challenge. This paper proposes a method that leverages LLMs to extract implicit preferences and explicitly incorporate them into the recommendation process. Initially, LLMs identify implicit user preferences from conversations, which are then refined into fine-grained numerical values using a BERT-based multi-label classifier to enhance recommendation precision. The proposed approach is validated through experiments on three comprehensive datasets: the Reddit Movie Dataset (8413 dialogues), Inspired (825 dialogues), and ReDial (2311 dialogues). Results show that our approach considerably outperforms traditional CRS methods, achieving a 23.3% improvement in Recall@20 on the ReDial dataset and a 7.2% average improvement in recommendation accuracy across all datasets with GPT-3.5-turbo and GPT-4. These findings highlight the potential of using LLMs to extract and utilize implicit conversational information, effectively enhancing the quality of recommendations in CRSs. Full article

Online product reviews provide valuable insights on user experiences and product qualities. However, issues such as information overload and the limited utilization of review features persist, particularly in personalized rankings for popular items like movies. To address these challenges—information overload in online reviews, limited review feature utilization, and personalized decision-making for high-demand products like movies—we introduce a personalized online decision-making framework that integrates a sentiment model for product attributes with an enhanced hesitant fuzzy scoring function. This framework incorporates the concept of symmetry in sentiment analysis. It employs feature words, sentiment terms, and modifiers to assess user sentiments within a hesitant fuzzy setting, utilizing symmetrical relationships between positive and negative sentiments. The improved fuzzy score function efficiently quantifies sentiment values for product features by considering the symmetrical balance of user opinions. Additionally, review quality assessment incorporates both content and reviewer characteristics, resulting in final attribute evaluations. An attribute weighting system, tailored to diverse product types, further captures product specifics and user inclinations, leveraging symmetry to balance varying user preferences. Validation through multi-genre movie sorting demonstrates the method’s capacity to handle review data across varied products and user tastes, offering a robust tool for enhancing online decision quality, especially for high-demand items. Full article

In recent years, recommender systems have become a crucial tool, assisting users in discovering and engaging with valuable information and services. Multi-criteria recommender systems have demonstrated significant value in assisting users to identify the most relevant items by considering various aspects of user experiences. Deep learning (DL) models demonstrated outstanding performance across different domains: computer vision, natural language processing, image analysis, pattern recognition, and recommender systems. In this study, we introduce a deep learning model using VAE to improve multi-criteria recommendation systems. Specifically, we propose a variational autoencoder-based model for multi-criteria recommendation systems (VAE-MCRS). The VAE-MCRS model is sequentially trained across multiple criteria to uncover patterns that allow for better representation of user–item interactions. The VAE-MCRS model utilizes the latent features generated by the VAE in conjunction with user–item interactions to enhance recommendation accuracy and predict ratings for unrated items. Experiments carried out using the Yahoo! Movies multi-criteria dataset demonstrate that the proposed model surpasses other state-of-the-art recommendation algorithms, achieving a Mean Absolute Error (MAE) of 0.6038 and a Root Mean Squared Error (RMSE) of 0.7085, demonstrating its superior performance in providing more precise recommendations for multi-criteria recommendation tasks. Full article

In today’s digital era, the abundance of online services presents users with a daunting array of choices, spanning from streaming platforms to e-commerce websites, leading to decision fatigue. Recommendation algorithms play a pivotal role in aiding users in navigating this plethora of options, among which collaborative filtering (CF) stands out as a prevalent technique. However, CF encounters several challenges, including scalability issues, privacy implications, and the well-known cold start problem. This study endeavors to mitigate the cold start problem by harnessing the capabilities of natural language processing (NLP) applied to user-generated reviews. A unique methodology is introduced, integrating both supervised and unsupervised NLP approaches facilitated by sci-kit learn, utilizing benchmark datasets across diverse domains. This study offers scientific contributions through its novel approach, ensuring rigor, precision, scalability, and real-world relevance. It tackles the cold start problem in recommendation systems by combining natural language processing (NLP) with machine learning and collaborative filtering techniques, addressing data sparsity effectively. This study emphasizes reproducibility and accuracy while proposing an advanced solution that improves personalization in recommendation models. The proposed NLP-based strategy enhances the quality of user-generated content, consequently refining the accuracy of Collaborative Filtering-Based Recommender Systems (CFBRSs). The authors conducted experiments to test the performance of the proposed approach on benchmark datasets like MovieLens, Jester, Book-Crossing, Last.fm, Amazon Product Reviews, Yelp, Netflix Prize, Goodreads, IMDb (Internet movie Database) Data, CiteULike, Epinions, and Etsy to measure global accuracy, global loss, F-1 Score, and AUC (area under curve) values. Assessment through various techniques such as random forest, Naïve Bayes, and Logistic Regression on heterogeneous benchmark datasets indicates that random forest is the most effective method, achieving an accuracy rate exceeding 90%. Further, the proposed approach received a global accuracy above 95%, a global loss of 1.50%, an F-1 Score of 0.78, and an AUC value of 92%. Furthermore, the experiments conducted on distributed and global differential privacy (GDP) further optimize the system’s efficacy. Full article

Acoustic management is very important for detecting possible events in the context of a smart environment (SE). In previous works, we proposed a reflective middleware for acoustic management (ReM-AM) and its autonomic cycles of data analysis tasks, along with its ontology-driven architecture. In this work, we aim to develop an emotion-recognition system for ReM-AM that uses sound events, rather than speech, as its main focus. The system is based on a sound pattern for emotion recognition and the autonomic cycle of intelligent sound analysis (ISA), defined by three tasks: variable extraction, sound data analysis, and emotion recommendation. We include a case study to test our emotion-recognition system in a simulation of a smart movie theater, with different situations taking place. The implementation and verification of the tasks show a promising performance in the case study, with 80% accuracy in sound recognition, and its general behavior shows that it can contribute to improving the well-being of the people present in the environment. Full article

In the face of complex user behavior patterns and massive data, improving the performance of recommender system models is an urgent challenge. Traditional methods often struggle to effectively handle feature interactions and complex user-item relationships. Combining the advantages of graph neural networks and the Deep Crossing network, this paper proposes a recommendation method based on hybrid neural networks with Deep Crossing (Deep Crossing with Graph Convolution and GRU, DCGCN-GRU). First, by constructing the graph structure of users and items, higher-order feature representations are extracted, and node features are updated using a multilayer graph convolution operation. Then, the higher-order features learned by the graph convolution network are spliced and weighted with the original features to form new feature inputs. Next, a Gated Recurrent Unit (GRU) is introduced to capture the inter-feature temporal dynamic relationships and sequence information. Finally, the Deep Crossing model is utilized to learn the interactions between the fused features at multiple levels and enhance the interactions between the features. Comparative experiments on three public datasets, MovieLens-ml-25m, Book-Crossings, and Amazon Reviews’23, show that the model achieves significant improvements in accuracy, mean square error (MSE), and mean absolute error (MAE). Full article