Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (12)

Search Parameters:
Keywords = user personality and item attributes

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 6759 KiB  
Article
An Enhanced Latent Factor Recommendation Approach for Sparse Datasets of E-Commerce Platforms
by Wenbin Wu, Zhanyong Qi, Jiawei Tian, Bixi Wang, Minyi Tang and Xuan Liu
Systems 2025, 13(5), 372; https://doi.org/10.3390/systems13050372 - 13 May 2025
Viewed by 390
Abstract
In certain newly established or niche e-commerce platforms, user–item interactions are often exceedingly sparse due to limited user bases or specialized product lines, posing significant obstacles to accurate personalized recommendations. To address these challenges, this paper proposes an enhanced recommendation approach based on [...] Read more.
In certain newly established or niche e-commerce platforms, user–item interactions are often exceedingly sparse due to limited user bases or specialized product lines, posing significant obstacles to accurate personalized recommendations. To address these challenges, this paper proposes an enhanced recommendation approach based on a latent factor model. By leveraging factorization to uncover the hidden features of users and items and incorporating both user behavioral data and item attribute information, a multi-dimensional latent semantic space is constructed to more effectively capture the underlying relationships between user preferences and item properties. The method involves data preprocessing, model construction, user and item vectorization, and semantic-similarity-based recommendation generation. For empirical validation, we employ a real-world dataset gathered from an e-commerce platform, comprising 4645 ratings from 3445 users across 277 items in nine distinct categories. Experimental results demonstrate that, compared with conventional collaborative filtering methods, this approach achieves superior precision and recall even in highly sparse settings, showing stronger resilience under low-density conditions. These findings offer objective and feasible insights for advancing personalized recommendation techniques in newly established or niche e-commerce platforms. Full article
(This article belongs to the Special Issue Data-Driven Methods in Business Process Management)
Show Figures

Figure 1

18 pages, 17934 KiB  
Article
NRDPA: Review-Aware Neural Recommendation with Dynamic Personalized Attention
by Qinghao Sun, Ziyang Li, Jiong Yu, Xue Li and Xin Wang
Electronics 2025, 14(1), 33; https://doi.org/10.3390/electronics14010033 - 25 Dec 2024
Viewed by 851
Abstract
Review-based recommendation can utilize user and item features extracted from review text to alleviate the problems of data sparsity and poor interpretability. However, most existing methods focus on static modeling of user personality and item attributes while ignoring the dynamic changes of user [...] Read more.
Review-based recommendation can utilize user and item features extracted from review text to alleviate the problems of data sparsity and poor interpretability. However, most existing methods focus on static modeling of user personality and item attributes while ignoring the dynamic changes of user and item features. Therefore, this paper proposes a neural recommendation method with dynamic personalized attention (NRDPA). First, this method captures the changes in user behavior at the word level and review level and models the personalized features of users and items by dynamically highlighting key words and important reviews. Second, the method considers information interaction in the process of user and item modeling and adjusts the feature representations of the interacting parties according to the user’s preferences for different items. Finally, experiments on five public datasets from Amazon demonstrate that the proposed NRDPA model has superior performance, with improvements of up to 10% in MSE and 6.3% in MAE compared to state-of-the-art models. Full article
Show Figures

Figure 1

28 pages, 2017 KiB  
Article
Integrating Symmetry in Attribute-Based Sentiment Modeling with Enhanced Hesitant Fuzzy Scoring for Personalized Online Product Recommendations
by Qi Wang, Yuan Zhao, Zi Xu, Wen Zhang and Mingsi Zhang
Symmetry 2024, 16(12), 1652; https://doi.org/10.3390/sym16121652 - 13 Dec 2024
Viewed by 1221
Abstract
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, [...] Read more.
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
(This article belongs to the Section Computer)
Show Figures

Figure 1

11 pages, 844 KiB  
Article
Clarifying the Actual Situation of Old-Old Adults with Unknown Health Conditions and Those Indifferent to Health Using the National Health Insurance Database (KDB) System
by Mio Kitamura, Takaharu Goto, Tetsuo Ichikawa and Yasuhiko Shirayama
Geriatrics 2024, 9(6), 156; https://doi.org/10.3390/geriatrics9060156 - 6 Dec 2024
Viewed by 1378
Abstract
Background/Objectives: This study aimed to investigate the actual situation of individuals with unknown health conditions (UHCs) and those indifferent to health (IH) among old-old adults (OOAs) aged 75 years and above using the National Health Insurance Database (KDB) system. Methods: A [...] Read more.
Background/Objectives: This study aimed to investigate the actual situation of individuals with unknown health conditions (UHCs) and those indifferent to health (IH) among old-old adults (OOAs) aged 75 years and above using the National Health Insurance Database (KDB) system. Methods: A total of 102 individuals with no history of medical examinations were selected from the KDB system in a city in Japan. Data were collected through home visit interviews and blood pressure monitors distributed by public health nurses (PHNs) from Community Comprehensive Support Centers (CCSCs). The collected data included personal attributes, health concern levels, and responses to a 15-item OOA questionnaire. Semi-structured interviews were conducted with seven PHNs. The control group consisted of 76 users of the “Kayoinoba” service (Kayoinoba users: KUs). Results: Of the 83 individuals who could be interviewed, 50 (49.0%) were classified as UHCs and 11 (10.8%) were classified as IH, including 5 from the low health concern group and 6 who refused to participate. In the word cloud generated from the PHNs’ interviews, the words and phrases “community welfare commissioner”, “community development”, “blood pressure monitor”, “troublesome”, “suspicious”, and “young” were highlighted. In the comparison of health assessments between UHCs and KUs, “body weight loss” and “cognitive function” were more prevalent among KUs, and “smoking” and “social participation” were more prevalent among UHCs. Conclusions: The home visit activities of CCSCs utilizing the KDB system may contribute to an understanding of the actual situation of UHCs, including IHs, among OOAs. UHCs (including patients with IH status) had a higher proportion of risk factors related to smoking and lower social participation than KUs. Full article
Show Figures

Figure 1

21 pages, 2560 KiB  
Article
Deep Reinforcement Learning Recommendation System Algorithm Based on Multi-Level Attention Mechanisms
by Gaopeng Wang, Jingyi Ding and Fanlin Hu
Electronics 2024, 13(23), 4625; https://doi.org/10.3390/electronics13234625 - 23 Nov 2024
Viewed by 2142
Abstract
Traditional recommendation systems, which rely on static user profiles and historical interaction data, frequently face difficulties in adapting to the rapid changes in user preferences that are typical of dynamic environments. In contrast, recommendation algorithms based on deep reinforcement learning are capable of [...] Read more.
Traditional recommendation systems, which rely on static user profiles and historical interaction data, frequently face difficulties in adapting to the rapid changes in user preferences that are typical of dynamic environments. In contrast, recommendation algorithms based on deep reinforcement learning are capable of dynamically adjusting their strategies to accommodate real-time fluctuations in user preferences. However, current deep reinforcement learning recommendation algorithms encounter several challenges, including the oversight of item features associated with high long-term rewards that reflect users’ enduring interests, as well as a lack of significant relevance between user attributes and item characteristics. This leads to an inadequate extraction of personalized information. To address these issues, this study presents a novel recommendation system known as the Multi-Level Hierarchical Attention Mechanism Deep Reinforcement Recommendation (MHDRR), which is fundamentally grounded in a multi-layer attention mechanism. This mechanism consists of a local attention layer, a global attention layer, and a Transformer layer, allowing for a detailed analysis of individual attributes and interactions within short-term preferred items, while also exploring users’ long-term interests. This methodology promotes a comprehensive understanding of users’ immediate and enduring preferences, thereby improving the overall effectiveness of the system over time. Experimental results obtained from three publicly available datasets validate the effectiveness of the proposed model. Full article
(This article belongs to the Special Issue Emerging Distributed/Parallel Computing Systems)
Show Figures

Figure 1

17 pages, 3187 KiB  
Article
A Multimodal User-Adaptive Recommender System
by Nicolás Torres
Electronics 2023, 12(17), 3709; https://doi.org/10.3390/electronics12173709 - 2 Sep 2023
Cited by 7 | Viewed by 3350
Abstract
Traditional recommendation systems have predominantly relied on user-provided ratings as explicit input. Concurrently, visually aware recommender systems harness inherent visual cues within data to decode item characteristics and deduce user preferences. However, the untapped potential of incorporating item images into the recommendation process [...] Read more.
Traditional recommendation systems have predominantly relied on user-provided ratings as explicit input. Concurrently, visually aware recommender systems harness inherent visual cues within data to decode item characteristics and deduce user preferences. However, the untapped potential of incorporating item images into the recommendation process warrants investigation. This paper introduces an original convolutional neural network (CNN) architecture that leverages multimodal information, connecting user ratings with product images to enhance item recommendations. A central innovation of the proposed model is the User-Adaptive Filtering Module, a dynamic component that utilizes user profiles to generate personalized filters. Through meticulous visual influence analysis, the effectiveness of these filters is demonstrated. Furthermore, experimental results underscore the competitive performance of the approach compared to traditional collaborative filtering methods, thereby offering a promising avenue for personalized recommendations. This approach capitalizes on user adaptation patterns, enhancing the understanding of user preferences and visual attributes. Full article
(This article belongs to the Special Issue Recommender Systems and Data Mining)
Show Figures

Figure 1

32 pages, 837 KiB  
Article
A Generic Approach towards Enhancing Utility and Privacy in Person-Specific Data Publishing Based on Attribute Usefulness and Uncertainty
by Abdul Majeed and Seong Oun Hwang
Electronics 2023, 12(9), 1978; https://doi.org/10.3390/electronics12091978 - 24 Apr 2023
Cited by 2 | Viewed by 2129
Abstract
This paper proposes a generic anonymization approach for person-specific data, which retains more information for data mining and analytical purposes while providing considerable privacy. The proposed approach takes into account the usefulness and uncertainty of attributes while anonymizing the data to significantly enhance [...] Read more.
This paper proposes a generic anonymization approach for person-specific data, which retains more information for data mining and analytical purposes while providing considerable privacy. The proposed approach takes into account the usefulness and uncertainty of attributes while anonymizing the data to significantly enhance data utility. We devised a method for determining the usefulness weight for each attribute item in a dataset, rather than manually deciding (or assuming based on domain knowledge) that a certain attribute might be more useful than another. We employed an information theory concept for measuring the uncertainty regarding sensitive attribute’s value in equivalence classes to prevent unnecessary generalization of data. A flexible generalization scheme that simultaneously considers both attribute usefulness and uncertainty is suggested to anonymize person-specific data. The proposed methodology involves six steps: primitive analysis of the dataset, such as analyzing attribute availability in the data, arranging the attributes into relevant categories, and sophisticated pre-processing, computing usefulness weights of attributes, ranking users based on similarities, computing uncertainty in sensitive attributes (SAs), and flexible data generalization. Our methodology offers the advantage of retaining higher truthfulness in data without losing guarantees of privacy. Experimental analysis on two real-life benchmark datasets with varying scales, and comparisons with prior state-of-the-art methods, demonstrate the potency of our anonymization approach. Specifically, our approach yielded better performance on three metrics, namely accuracy, information loss, and disclosure risk. The accuracy and information loss were improved by restraining heavier anonymization of data, and disclosure risk was improved by preserving higher uncertainty in the SA column. Lastly, our approach is generic and can be applied to any real-world person-specific tabular datasets encompassing both demographics and SAs of individuals. Full article
(This article belongs to the Special Issue Security and Privacy Issues and Challenges in Big Data Era)
Show Figures

Figure 1

14 pages, 1635 KiB  
Article
News Recommendation Based on User Topic and Entity Preferences in Historical Behavior
by Haojie Zhang and Zhidong Shen
Information 2023, 14(2), 60; https://doi.org/10.3390/info14020060 - 18 Jan 2023
Cited by 6 | Viewed by 4638
Abstract
A news-recommendation system is designed to deal with massive amounts of news and provide personalized recommendations for users. Accurately modeling of news and users is the key to news recommendation. Researchers usually use auxiliary information such as social networks or item attributes to [...] Read more.
A news-recommendation system is designed to deal with massive amounts of news and provide personalized recommendations for users. Accurately modeling of news and users is the key to news recommendation. Researchers usually use auxiliary information such as social networks or item attributes to learn about news and user representation. However, existing recommendation systems neglect to explore the rich topics in the news. This paper considered the knowledge graph as the source of side information. Meanwhile, we used user topic preferences to improve recommendation performance. We proposed a new framework called NRTEH that was based on topic and entity preferences in user historical behavior. The core of our approach was the news encoder and the user encoder. Two encoders in NRTEH handled news titles from two perspectives to obtain news and user representation embedding: (1) extracting explicit and latent topic features from news and mining user preferences for them; and (2) extracting entities and propagating users’ potential preferences in the knowledge graph. Experiments on a real-world dataset validated the effectiveness and efficiency of our approach. Full article
(This article belongs to the Collection Knowledge Graphs for Search and Recommendation)
Show Figures

Figure 1

18 pages, 2739 KiB  
Article
Multi-Level Knowledge-Aware Contrastive Learning Network for Personalized Recipe Recommendation
by Zijian Bai, Yinfeng Huang, Suzhi Zhang, Pu Li, Yuanyuan Chang and Xiang Lin
Appl. Sci. 2022, 12(24), 12863; https://doi.org/10.3390/app122412863 - 14 Dec 2022
Cited by 1 | Viewed by 2651
Abstract
Personalized recipe recommendation is attracting more and more attention, which can help people make choices from the exploding growth of online food information. Unlike other recommendation tasks, the target of recipe recommendation is a non-atomic item, so attribute information is especially important for [...] Read more.
Personalized recipe recommendation is attracting more and more attention, which can help people make choices from the exploding growth of online food information. Unlike other recommendation tasks, the target of recipe recommendation is a non-atomic item, so attribute information is especially important for the representation of recipes. However, traditional collaborative filtering or content-based recipe recommendation methods tend to focus more on user–recipe interaction information and ignore higher-order semantic and structural information. Recently, graph neural networks (GNNs)-based recommendation methods provided new ideas for recipe recommendation, but there was a problem of sparsity of supervised signals caused by the long-tailed distribution of heterogeneous graph entities. How to construct high-quality representations of users and recipes becomes a new challenge for personalized recipe recommendation. In this paper, we propose a new method, a multi-level knowledge-aware contrastive learning network (MKCLN) for personalized recipe recommendation. Compared with traditional comparative learning, we design a multi-level view to satisfy the requirement of fine-grained representation of users and recipes, and use multiple knowledge-aware aggregation methods for node fusion to finally make recommendations. Specifically, the local-level includes two views, interaction view and semantic view, which mine collaborative information and semantic information for high-quality representation of nodes. The global-level learns node embedding by capturing higher-order structural information and semantic information through a network structure view. Then, a kind of self-supervised cross-view contrastive learning is invoked to make the information of multiple views collaboratively supervise each other to learn fine-grained node embeddings. Finally, the recipes that satisfy personalized preferences are recommended to users by joint training and model prediction functions. In this study, we conduct experiments on two real recipe datasets, and the experimental results demonstrate the effectiveness and advancement of MKCLN. Full article
(This article belongs to the Special Issue Recommender Systems and Their Advanced Application)
Show Figures

Figure 1

20 pages, 877 KiB  
Article
Enhanced Graph Learning for Recommendation via Causal Inference
by Suhua Wang, Hongjie Ji, Minghao Yin, Yuling Wang, Mengzhu Lu and Hui Sun
Mathematics 2022, 10(11), 1881; https://doi.org/10.3390/math10111881 - 31 May 2022
Viewed by 2571
Abstract
The goal of the recommender system is to learn the user’s preferences from the entity (user–item) historical interaction data, so as to predict the user’s ratings on new items or recommend new item sequences to users. There are two major challenges: (1) Datasets [...] Read more.
The goal of the recommender system is to learn the user’s preferences from the entity (user–item) historical interaction data, so as to predict the user’s ratings on new items or recommend new item sequences to users. There are two major challenges: (1) Datasets are usually sparse. The item side is often accompanied by some auxiliary information, such as attributes or context; it can help to slightly improve its representation. However, the user side is usually presented in the form of ID due to personal privacy. (2) Due to the influences of confounding factors, such as the popularity of items, users’ ratings on items often have bias that cannot be recognized by the traditional recommendation methods. In order to solve these two problems, in this paper, (1) we explore the use of a graph model to fuse the interactions between users and common rating items, that is, incorporating the “neighbor” information into the target user to enrich user representations; (2) the do() operator is used to deduce the causality after removing the influences of confounding factors, rather than the correlation of the data surface fitted by traditional machine learning. We propose the EGCI model, i.e., enhanced graph learning for recommendation via causal inference. The model embeds user relationships and item attributes into the latent semantic space to obtain high-quality user and item representations. In addition, the mixed bias implied in the rating process is calibrated by considering the popularity of items. Experimental results on three real-world datasets show that EGCI is significantly better than the baselines. Full article
(This article belongs to the Special Issue State-of-the-Art Mathematical Applications in Asia-Pacific Area)
Show Figures

Figure 1

17 pages, 1289 KiB  
Article
Addressing Complete New Item Cold-Start Recommendation: A Niche Item-Based Collaborative Filtering via Interrelationship Mining
by Zhi-Peng Zhang, Yasuo Kudo, Tetsuya Murai and Yong-Gong Ren
Appl. Sci. 2019, 9(9), 1894; https://doi.org/10.3390/app9091894 - 8 May 2019
Cited by 12 | Viewed by 2858
Abstract
Recommender system (RS) can be used to provide personalized recommendations based on the different tastes of users. Item-based collaborative filtering (IBCF) has been successfully applied to modern RSs because of its excellent performance, but it is susceptible to the new item cold-start problem, [...] Read more.
Recommender system (RS) can be used to provide personalized recommendations based on the different tastes of users. Item-based collaborative filtering (IBCF) has been successfully applied to modern RSs because of its excellent performance, but it is susceptible to the new item cold-start problem, especially when a new item has no rating records (complete new item cold-start). Motivated by this, we propose a niche approach which applies interrelationship mining into IBCF in this paper. The proposed approach utilizes interrelationship mining to extract new binary relations between each pair of item attributes, and constructs interrelated attributes to rich the available information on a new item. Further, similarity, computed using interrelated attributes, can reflect characteristics between new items and others more accurately. Some significant properties, as well as the usage of interrelated attributes, are provided in detail. Experimental results obtained suggest that the proposed approach can effectively solve the complete new item cold-start problem of IBCF and can be used to provide new item recommendations with satisfactory accuracy and diversity in modern RSs. Full article
(This article belongs to the Section Computing and Artificial Intelligence)
Show Figures

Figure 1

16 pages, 537 KiB  
Article
Artificial Neural Networks and Particle Swarm Optimization Algorithms for Preference Prediction in Multi-Criteria Recommender Systems
by Mohamed Hamada and Mohammed Hassan
Informatics 2018, 5(2), 25; https://doi.org/10.3390/informatics5020025 - 9 May 2018
Cited by 35 | Viewed by 10062
Abstract
Recommender systems are powerful online tools that help to overcome problems of information overload. They make personalized recommendations to online users using various data mining and filtering techniques. However, most of the existing recommender systems use a single rating to represent the preference [...] Read more.
Recommender systems are powerful online tools that help to overcome problems of information overload. They make personalized recommendations to online users using various data mining and filtering techniques. However, most of the existing recommender systems use a single rating to represent the preference of user on an item. These techniques have several limitations as the preference of the user towards items may depend on several attributes of the items. Multi-criteria recommender systems extend the single rating recommendation techniques to incorporate multiple criteria ratings for improving recommendation accuracy. However, modeling the criteria ratings in multi-criteria recommender systems to determine the overall preferences of users has been considered as one of the major challenges in multi-criteria recommender systems. In other words, how to additionally take the multi-criteria rating information into account during the recommendation process is one of the problems of multi-criteria recommender systems. This article presents a methodological framework that trains artificial neural networks with particle swarm optimization algorithms and uses the neural networks for integrating the multi-criteria rating information and determining the preferences of users. The proposed neural network-based multi-criteria recommender system is integrated with k-nearest neighborhood collaborative filtering for predicting unknown criteria ratings. The proposed approach has been tested with a multi-criteria dataset for recommending movies to users. The empirical results of the study show that the proposed model has a higher prediction accuracy than the corresponding traditional recommendation technique and other multi-criteria recommender systems. Full article
(This article belongs to the Special Issue Advances in Recommender Systems)
Show Figures

Figure 1

Back to TopTop