Search

Sequential Recommendation systems play a crucial role in predicting users' preferences based on their behavioral history. However, the existing methods ignore the extrapolation nature of sequences and do not make deep use of item provider information. This oversight limits the model's ability to fully utilize relevant external properties. To alleviate these limitations, we design a recommendation model that incorporates Position encoding and external reinforcement (Item -Provider), named DPSRec. Specifically, we design an Embed Encoding layer, in order to distinguish the Position Embedding of previous sequence models, we combine the time variability with the position encoding with extrapolation property, and encode the item and item provider sequences accordingly. Meanwhile, to avoid the noise that the initial item embeddings might cause with Position Encoding, we calculate the position Encoding separately from the item embedding. In addition, we design a Cross Propagation layer to capture implicit higher-order dependencies between item sequences. Extensive experiments on three real-world datasets demonstrate that the proposed model generally outperforms the baselines by about 1–12.5%. Our source code will be published after the paper is published. [ABSTRACT FROM AUTHOR]

Finding a suitable open access journal to publish academic work is a complex task: Researchers have to navigate a constantly growing number of journals, institutional agreements with publishers, funders' conditions and the risk of predatory publishers. To help with these challenges, we introduce a web-based journal recommendation system called B!SON. A systematic requirements analysis was conducted in the form of a survey. The developed tool suggests open access journals based on title, abstract and references provided by the user. The recommendations are built on open data, publisher-independent and work across domains and languages. Transparency is provided by its open source nature, an open application programming interface (API) and by specifying which matches the shown recommendations are based on. The recommendation quality has been evaluated using two different evaluation techniques, including several new recommendation methods. We were able to improve the results from our previous paper with a pre-trained transformer model. The beta version of the tool received positive feedback from the community and in several test sessions. We developed a recommendation system for open access journals to help researchers find a suitable journal. The open tool has been extensively tested, and we found possible improvements for our current recommendation technique. Development by two German academic libraries ensures the longevity and sustainability of the system. [ABSTRACT FROM AUTHOR]

Much discussion of the ethics of algorithms has focused on harms to autonomy—especially harms stemming from manipulation. Nonetheless, although manipulation can often be harmful, we suggest that in certain contexts it may not impair autonomy. To fully assess the impact of algorithm design on autonomy, we argue for a need to move beyond a focus on manipulation towards a multidimensional account of autonomy itself. Drawing on the autonomy literature and recent data ethics, we propose a novel account which takes autonomy to supervene on three distinct but related elements: agency, authenticity and individual control over decision-making. By distinguishing autonomy from control, the account can explain the variable effects of manipulation on user autonomy within algorithm-driven systems. In particular, it can explain why improving user control may improve autonomy in some contexts, while in other contexts—such as in some kinds of newsfeeds—certain algorithm designs that instead reduce user control may nevertheless improve autonomy. As a result, the account can accommodate the sometimes convoluted interplay between control, autonomy, manipulation, and commercial versus prosocial design goals. [ABSTRACT FROM AUTHOR]

The recommendation system has far-reaching significance and great practical value, which alleviates people's troubles about choosing from a huge amount of information. The existing recommendation system usually faces the selection bias problem due to the ignorance of samples with delayed feedback. To alleviate this problem, by modeling the recommendation as a batch contextual bandit problem, we propose a counterfactual reward estimation approach in this work. First, we formalize the counterfactual problem as "would the user be interested in the recommended item if the delayed time is before the collection time point?". The above counterfactual reward is estimated in a survival analysis framework, by fully exploring the causal generation process of user feedback on batch data. Second, based on the above estimated counterfactual rewards, the policy of batch contextual bandit is updated for online recommendation in the next episode. Third, new batch data are generated in the online recommendation for further counterfactual reward estimation. The above three steps are iteratively conducted until the optimal policy is learned. We also prove the sub-linear regret bound of the learned bandit policy theoretically. Our method achieved a 4 % improvement in average reward compared to the baseline methods in experiments conducted on synthetic and Criteo datasets, demonstrating the efficacy of our approach. [ABSTRACT FROM AUTHOR]

The Internet era is an era of information explosion. By 2022, the global Internet users have reached more than 4 billion, and the social media users have exceeded 3 billion. People face a lot of news content every day, and it is almost impossible to get interesting information by browsing all the news content. Under this background, personalized news recommendation technology has been widely used, but it still needs to be further optimized and improved. In order to better push the news content of interest to different readers, users' satisfaction with major news websites should be further improved. This study proposes a new recommendation algorithm based on deep learning and reinforcement learning. Firstly, the RL algorithm is introduced based on deep learning. Deep learning is excellent in processing large-scale data and complex pattern recognition, but it often faces the challenge of low sample efficiency when it comes to complex decision-making and sequential tasks. While reinforcement learning (RL) emphasizes learning optimization strategies through continuous trial and error through interactive learning with the environment. Compared with deep learning, RL is more suitable for scenes that need long-term decision-making and trial-and-error learning. By feeding back the reward signal of the action, the system can better adapt to the unknown environment and complex tasks, which makes up for the relative shortcomings of deep learning in these aspects. A scenario is applied to an action to solve the sequential decision problem in the news dissemination process. In order to enable the news recommendation system to consider the dynamic changes in users' interest in news content, the Deep Deterministic Policy Gradient algorithm is applied to the news recommendation scenario. Opposing learning complements and combines Deep Q-network with the strategic network. On the basis of fully summarizing and thinking, this paper puts forward the mode of intelligent news dissemination and push. The push process of news communication information based on edge computing technology is proposed. Finally, based on Area Under Curve a Q-Leaning Area Under Curve for RL models is proposed. This indicator can measure the strengths and weaknesses of RL models efficiently and facilitates comparing models and evaluating offline experiments. The results show that the DDPG algorithm improves the click-through rate by 2.586% compared with the conventional recommendation algorithm. It shows that the algorithm designed in this paper has more obvious advantages in accurate recommendation by users. This paper effectively improves the efficiency of news dissemination by optimizing the push mode of intelligent news dissemination. In addition, the paper also deeply studies the innovative application of intelligent edge technology in news communication, which brings new ideas and practices to promote the development of news communication methods. Optimizing the push mode of intelligent news dissemination not only improves the user experience, but also provides strong support for the application of intelligent edge technology in this field, which has important practical application prospects. [ABSTRACT FROM AUTHOR]

Recommender systems have been widely used for implementing personalised content on many mobile online services to reduce computational overload and preserve wireless data for users. The underlying mechanisms used for building recommender systems analyse data collected from users to make recommendations. This poses concerns over the privacy of data from users as both service providers and the cloud will have access. Privacy-preserving recommender systems protect user information by incorporating various cryptographic mechanisms to prevent accessing the data. However, existing works are not practical due to the use of heavy cryptography. In this paper, we propose an efficient privacy-preserving recommender system that takes advantage of clustering to improve efficiency. Using a secure clustering mechanism, user data are assigned to multiple clusters before being fed into the recommendation. Our proposed protocols are privacy-preserving and do not leak information that could be used to identify a data subject. The experiments show that our system is efficient and accurate. [ABSTRACT FROM AUTHOR]

Due to the superior performance of graph convolutional networks (GCNs) in feature extraction and representation, researchers have introduced GCNs to collaborative filtering (CF) to improve the accuracy of recommendations. However, existing GCN-based CF models still have three shortcomings: degrading the model performance due to symmetric normalization in neighborhood aggregation, underutilizing the node (user or item) representations at lower layers, and failing to alleviate the over-smoothing effect in graph convolution operations. We present a Residual Graph Convolution Collaborative Filtering model with Asymmetric neighborhood aggregation (ARGCCF) to tackle the above shortcomings. Firstly, ARGCCF utilizes asymmetric normalization in neighborhood aggregation, enabling better preservation of high-degree node information for more precisely learning node representations. Secondly, the propagation of ARGCCF embeddings proceeds in two steps. During the initial propagation, a residual connection is established between the node representation of the current layer and the previous layer to utilize the low-level layer's node representation fully. The embeddings generated after the initial propagation are propagated again in the same graph convolutional layer, which obtains more refined embedding representations to alleviate the over-smoothing problem. Finally, experimentations on five truthful datasets exhibit that ARGCCF has better-improved performance over several mainstream methods. [ABSTRACT FROM AUTHOR]

Most existing RGB-D salient object detection (SOD) methods tend to achieve higher performance by integrating additional modules, such as feature enhancement and edge generation. There is no doubt that these modules will inevitably produce feature redundancy and performance degradation. To this end, we exquisitely design a cross-modal fusion and progressive decoding network (termed CPNet) to achieve RGB-D SOD tasks. The designed network structure only includes three indispensable parts: feature encoding, feature fusion and feature decoding. Specifically, in the feature encoding part, we adopt a two-stream Swin Transformer encoder to extract multi-level and multi-scale features from RGB images and depth images respectively to model global information. In the feature fusion part, we design a cross-modal attention fusion module, which can leverage the attention mechanism to fuse multi-modality and multi-level features. In the feature decoding part, we design a progressive decoder to gradually fuse low-level features and filter noise information to accurately predict salient objects. Extensive experimental results on 6 benchmarks demonstrated that our network surpasses 12 state-of-the-art methods in terms of four metrics. In addition, it is also verified that for the RGB-D SOD task, the addition of the feature enhancement module and the edge generation module is not conducive to improving the detection performance under this framework, which provides new insights into the salient object detection task. Our codes are available at https://github.com/hu-xh/CPNet. [ABSTRACT FROM AUTHOR]

Graph Neural Networks (GNNs) have been successfully adopted in recommender systems by virtue of the message-passing that implicitly captures collaborative effect. However, in practical recommendation scenarios, user-item interaction data is often sparse and exhibits a skewed distribution. To address these issues, some contrastive learning methods based on data augmentation are applied to recommender systems to enhance the representation of users and items. Nevertheless, many data enhancements solely rely on graph topology, missing crucial structural information and potentially biasing the model. In this paper, we propose a contrastive learning recommendation framework called GDA-GCL based on a generative model data augmentation strategy. Specifically, we use the Conditional Variational Autoencoder(CVAE) generative model to learn the distribution of neighbor node features conditioned on the features of the central node. Due to the randomness of resampling, we design a mirror graph comparison strategy to generate different comparison views, which introduces additional high-quality training signals into the GNN paradigm. Experimental results on three real-world public datasets demonstrate that GDA-GCL achieves significant improvement in performance over various baseline methods. Extensive analysis, including ablation studies, has demonstrated the effectiveness and robustness of our proposed generative data-augmented contrastive recommendation framework in addressing the data sparsity issue in recommendation systems. [ABSTRACT FROM AUTHOR]

In the realm of e-commerce, personalized recommendations are a crucial component in enhancing user experience and optimizing sales efficiency. To address the inherent sparsity challenge prevalent in collaborative filtering algorithms within personalized recommendation systems, we propose a novel hybrid e-commerce recommendation algorithm based on the User-Nearest-Neighbor model. By integrating the user nearest neighbor model with other recommendation algorithms, this approach effectively mitigates data sparsity and facilitates a more nuanced understanding of the user-product relationship, consequently elevating recommendation quality and enhancing user experience. Taking into account considerations such as data scale and recommendation performance, we conducted experiments utilizing the Spark distributed platform. Empirical findings demonstrate the superiority of our hybrid algorithm over standalone collaborative filtering algorithms across various recommendation indicators. [ABSTRACT FROM AUTHOR]

Capturing dynamic preference features from user historical behavioral data is widely applied to improve the accuracy of recommendations in sequential recommendation tasks. However, existing deep neural network-based sequential recommendation methods often ignore the noise information in user behavioral data that influence recommendation effectiveness, making recommendation models sensitive to noisy data. Additionally, these deep learning-based recommendation models often require a large number of parameters to capture user behavior patterns, leading to higher time complexity and susceptibility to overfitting due to noise fluctuations. To address these issues, in this paper, we apply the moving average concept from the field of time-series analysis to sequential recommendation tasks. The approach smooths sequence data, removes noise, making the data more stable and reliable, increases the model's insensitivity to noise information, and better understands the evolution of user interests and behavioral patterns. Specifically, in our experiments, the moving average algorithm effectively denoises sequential data with low time complexity. Therefore, we propose a Sequential Recommendation with Exponential Moving Average with MLP architecture that makes the model more competitive in terms of time complexity. Experimental results conducted on two datasets demonstrate that EMARec outperforms state-of-the-art sequential recommendation methods across various common evaluation metrics. [ABSTRACT FROM AUTHOR]

Graph convolutional neural networks have been successfully applied to collaborative filtering to capture high-quality user-item representations. Despite their remarkable performance, there are still limitations that hinder further improvement of recommender systems. Most existing recommendation systems utilize implicit feedback data for model training, but such data inevitably contains adversarial interaction noise. The conventional graph-based collaborative filtering method fails to effectively filter out this noise, and instead amplifies its impact, resulting in degraded model performance. To address this issue, we propose a robustness-enhanced collaborative filtering graph neural network model that does not rely on explicit noise filtering. Our approach involves simulating user-item interactions that do not exist in practice as adversarial interaction noise using random noise. To mitigate the impact of this noise in hidden feedback, we replace them with randomly selected partial nodes based on the principle of mutual information maximization. Our model has been extensively experimented on three public datasets (MovieLens-1 M, Yelp, and Ta-feng) and achieves performance improvements of about 5%, 10%, and 14%, respectively, compared to the state-of-the-art baseline model. In particular, in model robustness experiments, our model achieves significant performance improvements of about 13% and 17% in Yelp and Ta-feng. A comprehensive experimental study shows that our proposed method is reasonably effective and interpretable. [ABSTRACT FROM AUTHOR]

Improving the accuracy of recommendation systems is a hot research topic, and existing methods have not considered the differences in various types of data. To address this issue, we propose a collaborative filtering recommendation method that combines evaluation relationships and emotional relationships. The emotional relationship is derived from implicit feedback data, and we can exploit the neural network to learn the emotional relationship between users and items. The evaluation relationship is derived from explicit feedback data; similarly, we can exploit the neural network to learn the evaluation relationship between users and items. To obtain emotional and evaluation relationships, we design vector representation and interaction functions based on explicit and implicit feedback data. Moreover, we propose that deep neural networks can be used to integrate evaluation and emotional relationships. To effectively integrate emotional and evaluation relationships, we design multiple data fusion strategies, loss functions, and training strategies. Experimental studies were conducted on five benchmark datasets, and the results show that the collaborative filtering recommendation method based on emotional evaluation relationships can further improve the accuracy of recommendation systems. [ABSTRACT FROM AUTHOR]

Recipe data and user interactions and preferences have been widely studied in food computing, especially for the recipe recommendation task. One part of these works seeks to introduce healthy patterns while considering user preferences, known as healthy-aware recommender systems. The major challenge here is to build systems capable of learning the complex structure of recipe data since they involve heterogeneous resources. Internet-sourced recipe collections may also have a representative amount of recipes that do not follow healthy guidelines, thus inhibiting the performance of health-aware recommender systems. We propose a new method for recipe recommendation based on a link prediction algorithm that considers recipes, their healthy features, and users. We train the model twice, once with the whole dataset and once with recipes following healthy guidelines. We follow three strategies for representing recipe data regarding healthy features. In general, training the model in recipe data that follows healthy guidelines achieves better results, especially when representing recipes with numeric nutrition recipe values. [ABSTRACT FROM AUTHOR]

The problem of recommender system is very popular with myriad available solutions. Recommender systems recommend items to users and help them in narrowing their search from huge amount of options available to the user. In this work, a novel approach for the recommendation problem is proposed by incorporating techniques from the link prediction problem in social networks. The proposed approach models the typical user-item information as a bipartite network, and predicts future links using link prediction measures, in which link prediction would actually mean recommending an item to a user. The standard recommender system methods suffer from the problems of sparsity and scalability. Since link prediction measures involve computations pertaining to local neighborhoods in the network, this approach would lead to a scalable solution to recommendation. In this work, we present top k links that are predicted by link prediction measures as recommendations to the users. Our work initially applies different existing link prediction measures to the recommendation problem by making suitable adaptations. The prime contribution of this work is to propose a recommendation framework routed from link prediction problem in social networks, that effectively utilizes probabilistic measures of link prediction and embed temporal data accessible on existing links. The proposed approach is evaluated on one movie-rating dataset of MovieLens, two product-rating datasets of Epinions & Amazon and one hotel-rating dataset of TripAdvisor. Results show that the link prediction measures based on temporal probabilistic information prove to be more effective in improving the quality of recommendation. Especially, Temporal cooccurrence probability measure improves the area under ROC curve (AUROC) by 10% for MovieLens, 23% for Epinions, 17% for TripAdvisor, 9% for Amazon over standard item-based collaborative filtering method. Similar improved performance is observed in terms of area under Precision-Recall curve (AUPR) as well as Normalized Rank-Score. [ABSTRACT FROM AUTHOR]

With the advancement of mobile technology, Point of Interest (POI) recommendation systems in Location-based Social Networks (LBSN) have brought numerous benefits to both users and companies. Many existing works employ Knowledge Graph (KG) to alleviate the data sparsity issue in LBSN. These approaches primarily focus on modeling the pair-wise relations in LBSN to enrich the semantics and thereby relieve the data sparsity issue. However, existing approaches seldom consider the hyper-relations in LBSN, such as the mobility relation (a 3-ary relation: user-POI-time). This makes the model hard to exploit the semantics accurately. In addition, prior works overlook the rich structural information inherent in KG, which consists of higher-order relations and can further alleviate the impact of data sparsity.To this end, we propose a Hyper-Relational Knowledge Graph Neural Network (HKGNN) model. In HKGNN, a Hyper-Relational Knowledge Graph (HKG) that models the LBSN data is constructed to maintain and exploit the rich semantics of hyper-relations. Then we proposed a Hypergraph Neural Network to utilize the structural information of HKG in a cohesive way. In addition, a self-attention network is used to leverage sequential information and make personalized recommendations. Furthermore, side information, essential in reducing data sparsity by providing background knowledge of POIs, is not fully utilized in current methods. In light of this, we extended the current dataset with available side information to further lessen the impact of data sparsity. Results of experiments on four real-world LBSN datasets demonstrate the effectiveness of our approach compared to existing state-of-the-art methods. Our implementation is available at . [ABSTRACT FROM AUTHOR]

The advent of large language models marks a revolutionary breakthrough in artificial intelligence. With the unprecedented scale of training and model parameters, the capability of large language models has been dramatically improved, leading to human-like performances in understanding, language synthesizing, common-sense reasoning, etc. Such a major leap forward in general AI capacity will fundamentally change the pattern of how personalization is conducted. For one thing, it will reform the way of interaction between humans and personalization systems. Instead of being a passive medium of information filtering, like conventional recommender systems and search engines, large language models present the foundation for active user engagement. On top of such a new foundation, users’ requests can be proactively explored, and users’ required information can be delivered in a natural, interactable, and explainable way. For another thing, it will also considerably expand the scope of personalization, making it grow from the sole function of collecting personalized information to the compound function of providing personalized services. By leveraging large language models as a general-purpose interface, the personalization systems may compile user’s requests into plans, calls the functions of external tools (e.g., search engines, calculators, service APIs, etc.) to execute the plans, and integrate the tools’ outputs to complete the end-to-end personalization tasks. Today, large language models are still being rapidly developed, whereas the application in personalization is largely unexplored. Therefore, we consider it to be right the time to review the challenges in personalization and the opportunities to address them with large language models. In particular, we dedicate this perspective paper to the discussion of the following aspects: the development and challenges for the existing personalization system, the newly emerged capabilities of large language models, and the potential ways of making use of large language models for personalization. [ABSTRACT FROM AUTHOR]

Like common recommender systems, group recommendation usually suffers from popularity bias where popular items are more likely to be suggested and exposed to users over long-tailed ones. The skewed data distribution caused discrimination against a great amount of unpopular items, which will be further intensified during the group decision-making process. Despite previous studies devoted to addressing popularity bias issue in recommendations, rarely have other works concentrated on such problem in group recommender systems. In this paper, we identify the negative impact of item popularity in a causality manner and propose a Popularity Reweighting Framework for Group Recommendation (PopGR). Specifically, a popularity-aware weighting function is adopted to mitigate the bias problem by incorporating the popularity level of items along with their intrinsic characteristics into group modeling. Experiments conducted on two real world benchmark datasets justify the effectiveness of our model to alleviate bias while maintaining reasonable ranking accuracy. [ABSTRACT FROM AUTHOR]

With the rapid development of cloud computing paradigm and mobile devices, the number of cloud services and user interest data are growing explosively. It becomes harder for users to find suitable cloud services within satisfying response time. Thus a suitable cloud service automatic recommendation system is needed to solve the above problem. In this work, we propose KG2Rec, a novel recommendation method based on Knowledge Graph to provide users with appropriate recommendations to meet their real-time needs. The property-specific knowledge graph model is designed to model user–item and item–item bipartite relations. Based on the property-specific knowledge graph model, property-specific user–item relation features can be mined from it. Then the user–item relation features will be integrated into an improved collaborative filtering algorithm based on the local sensitive hash technique for Top-N item recommendation. Finally, we evaluate the proposed method in terms of Top-N recommendation on the MovieLens dataset, and prove it outperforms numbers of state-of-the-art recommendation systems. In addition, we prove it has well performance in term of long tail recommendation and big data processing. [ABSTRACT FROM AUTHOR]

This paper addresses the increasing complexity of challenges in the field of continuous nonlinear optimization by proposing an innovative algorithm called information acquisition optimizer (IAO), which is inspired by human information acquisition behaviors and consists of three crucial strategies: information collection, information filtering and evaluation, and information analysis and organization to accommodate diverse optimization requirements. Firstly, comparative assessments of performance are conducted between the IAO and 15 widely recognized algorithms using the standard test function suites from CEC2014, CEC2017, CEC2020, and CEC2022. The results demonstrate that IAO is robustly competitive regarding convergence rate, solution accuracy, and stability. Additionally, the outcomes of the Wilcoxon signed rank test and Friedman mean ranking strongly validate the effectiveness and reliability of IAO. Moreover, the time comparison analysis experiments indicate its high efficiency. Finally, comparative tests on five real-world optimization difficulties affirm the remarkable applicability of IAO in handling complex issues with unknown search spaces. The code for the IAO algorithm is available at https://ww2.mathworks.cn/matlabcentral/fileexchange/169331-information-acquisition-optimizer. [ABSTRACT FROM AUTHOR]

In light of the remarkable capacity of graph convolutional network (GCN) in representation learning, researchers have incorporated it into collaborative filtering recommendation systems to capture high-order collaborative signals. However, existing GCN-based collaborative filtering models still exhibit three deficiencies: the failure to consider differences between users' activity and preferences for items' popularity, the low-order feature information of users and items has been inadequately employed, and neglecting the correlated relationships among isomorphic nodes. To address these shortcomings, this paper proposes a degree-aware embedding-based multi-correlated graph convolutional collaborative filtering (Da-MCGCF). Firstly, Da-MCGCF combines users' activity and preferences for items' popularity to perform neighborhood aggregation in the user-item bipartite graph, thereby generating more precise representations of users and items. Secondly, Da-MCGCF employs a low-order feature fusion strategy to integrate low-order features into the process of mining high-order features, which enhances feature representation capabilities, and enables the exploration of deeper relationships. Furthermore, we construct two isomorphic graphs by employing an adaptive approach to explore correlated relationships at the isomorphic level between users and items. Subsequently, we aggregate the features of isomorphic users and items separately to complement their representations. Finally, we conducted extensive experiments on four public datasets, thereby validating the effectiveness of our proposed model. [ABSTRACT FROM AUTHOR]

Existing segmentation-based text detection methods generally face the problems of insufficient receptive fields, insufficient text information filtering, and difficulty in balancing detection accuracy and speed, limiting their ability to detect arbitrary-shaped text in complex backgrounds. To address these problems, we propose a new text detection method fusing the pure ConvNet model InceptionNeXt and the multi-scale attention mechanism. Firstly, we propose a text information reinforcement module to fully extract effective text information from features of different scales while preserving spatial position information. Secondly, we construct the InceptionNeXt Block module to compensate for insufficient receptive fields without significantly reducing speed. Finally, the INA-DBNet network structure is designed to fuse local and global features and achieve the balance of accuracy and speed. Experimental results demonstrate the efficacy of our method. Particularly, on the MSRA-TD500 and Total-text datasets, INA-DBNet achieves 91.3% and 86.7% F-measure while maintaining real-time inference speed. Code is available at: https://github.com/yuyu678/INANET. [ABSTRACT FROM AUTHOR]

Social connections are frequently leveraged as supplementary data to enhance recommendation systems (RS). In real-world scenarios, the relationships between multiple users within social networks exhibit considerable complexity and diversity. However, prevalent recommendation approaches based on graphs tend to assume pairwise interactions to uncover user preferences. This approach overlooks the influence of intricate and multifaceted social relationships on user preferences, representing a neglect of the higher-order complexities inherent in user relations. It is also observed that most approaches neglect the fact that similar items have similar shared interests when grouped with users. This shows that there is an active connection among the attributes of items and users. Hence, this study works on the drawback of current Social RS: 1. Relations among the items are not explored well, 2. Social relations and homogeneity are not diverse. To address these issues, this study introduces a novel methodology based on clustering and heterogenous hypergraph, termed as HyperSegRec. HyperSegRec (Hypergraph Segmentation based RS) encompasses three parallel processes: User segmentation through Clustering, Item Similarity through extended graph using the cosine similarity matrix method, and a Weighted aggregation process, these processes models the user-item (where user-user as well as user-item relations is mined through clustering and hypergraph representation) and the item-item relations are mined through an extended graph matrix which is constructed with the cosine similarity method and hypergraph representation. These process in the proposed approach are trained individually over BPR (Bayesian Personalized Ranking) based loss function and evaluated against state-of-the-art models based on Recall and NDCG for top-K (K = 10, 20, 50) Recommendations. The proposed model is evaluated on two datasets: Movieslens 100 k and Amazon beauty products review. Compared to other state-of-the-art models, HyperSegRec achieves a 9.92% improvement on NDGC@50. Hence, HyperSegRec demonstrates superior performance in capturing user preferences and providing precise recommendations compared to existing state-of-the-art models, showcasing its potential to enhance recommendation systems for diverse datasets. [ABSTRACT FROM AUTHOR]

User–item bipartite graphs and knowledge graphs are frequently employed in recommender systems due to their ability to provide rich information for user and item modeling. However, existing recommender systems predominantly focus on modeling either the user or item individually, with few studies simultaneously considering both aspects. In this paper, we propose a novel double-ended recommendation model, DEKGCI, which aims to fully leverage the advantages of these two information sources. Specifically, DEKGCI harnesses the high-order connectivity information in the user–item bipartite graph to extract user representations, while utilizing the semantic information in the knowledge graph to enrich item representations. By doing so, DEKGCI concurrently learns both user and item representations, effectively capturing the intricate interaction information between users and items. The DEKGCI model was evaluated on three real-world datasets. Computational results demonstrate the high effectiveness of the proposed DEKGCI model compared to seven state-of-the-art reference methods from the literature. In particular, compared to the best-performing KFGAN model, DEKGCI achieved AUC gains of 0.335% in movie recommendations, and F1 gains of 0.023%, 2.203%, and 0.530% in movie, book, and music recommendations, respectively. The code and data are available at https://github.com/miaomiao924/DEKGCI. [ABSTRACT FROM AUTHOR]

Recommender systems are currently a suitable alternative for providing easy and appropriate access to information for users in today's digital information-overloaded world. However, an important drawback of these systems is the inconsistent behavior of users in providing item preferences. To address this issue, several natural noise management (NNM) approaches have been proposed, which positively influence recommendation accuracy. However, a major limitation of such previous works is the disregarding of the time-related information coupled to the rating data in RSs. Based on this motivation, this paper proposes two novel methods, named SeqNNM and SeqNNM-p for NNM focused on an incremental, time-aware recommender system scenario that has not yet been considered, by performing a classification-based NNM over specific preference sequences, driven by their associated timestamps. Such methods have been evaluated by simulating a real-time scenario and using metrics such as mean absolute error, root-mean-square error, precision, recall, NDCG, number of modified ratings, and running time. The obtained experimental results show that in the used settings, it is possible to achieve better recommendation accuracy with a low intrusion degree. Furthermore, the main innovation associated with the overall contribution is the screening of natural noise management approaches to be used on specific preferences subsets, and not over the whole dataset as discussed by previous authors. These proposed approaches allow the use of natural noise management in large datasets, in which it would be very difficult to correct the entire data. [ABSTRACT FROM AUTHOR]

Recommender Systems (RecSys) have been around since the early days of the Internet, helping users navigate the vast ocean of information and the increasingly available options that have been available for us ever since. The range of tasks for which one could use a RecSys is expanding as the technical capabilities grow, with the disruption of Machine Learning representing a tipping point in this domain, as in many others. However, the increase of the technical capabilities of AI-powered RecSys did not come with a thorough consideration of their ethical implications and, despite being a well-established technical domain, the potential impacts of RecSys on their users are still under-assessed. This paper aims at filling this gap in regards to one of the main impacts of RecSys: personal autonomy. We first describe how technology can affect human values and a suitable methodology to identify these effects and mitigate potential harms: Value Sensitive Design (VSD). We use VSD to carry out a conceptual investigation of personal autonomy in the context of a generic RecSys and draw on a nuanced account of procedural autonomy to focus on two components: competence and authenticity. We provide the results of our inquiry as a value hierarchy and apply it to the design of a speculative RecSys as an example. [ABSTRACT FROM AUTHOR]

Emergent digital technologies provide cultural heritage spaces with the opportunity to reassess their current user journey. An immersive user experience can be developed that is innovative, dynamic, and customised for each attendee. Museums have already begun to move towards interactive exhibitions utilising Artificial Intelligence (AI) and the Internet of Things (IOT), and more recently, the use of Virtual Reality (VR) and Augmented Reality (AR) has become more common in cultural heritage spaces to present items of historical significance. VR concentrates on the provision of full immersion within a digitised environment utilising a headset, whilst AR focuses on the inclusion of digitised content within the existing physical environment that can be accessed through a medium such as a mobile phone application. Machine learning techniques such as a recommender system can support an immersive user journey by issuing personalised recommendations regarding a user's preferred future content based on their previous activity. An ethical approach is necessary to take the precautions required to protect the welfare of human participants and eliminate any aspect of stereotyping or biased behaviour. This paper sets out a human-centred manifesto intended to provide guidance when inducing smart digital immersion in cultural heritage spaces. A review of existing digital cultural heritage projects was conducted to determine their adherence to the manifesto with the findings indicating that Education was a primary focus across all projects and that Personalisation, Respect and Empathy, and Support were also highly valued. Additionally, the findings indicated that there were areas with room for improvement such as Fairness to ensure that a well-balanced human-centred system is implemented. [ABSTRACT FROM AUTHOR]

Deep neural networks are vulnerable to attacks, posing significant security concerns across various applications, particularly in computer vision. Adversarial training has demonstrated effectiveness in improving the robustness of deep learning models by incorporating perturbations into the input space during training. Recently, adversarial training has been successfully applied to deep recommender systems. In these systems, user and item embeddings are perturbed through a minimax game, with constraints on perturbation directions, to enhance the model's robustness and generalization. However, they still fail to defend against iterative attacks, which have shown an over 60% increase in effectiveness in the computer vision domain. Deep recommender systems may therefore be more susceptible to iterative attacks, which might lead to generalization failures. In this paper, we adapt iterative examples for deep recommender systems. Specifically, we propose a Deep Recommender with Iteration Directional Adversarial Training (DRIDAT) that combines attention mechanism and directional adversarial training for recommendations. Firstly, we establish a consumer-product collaborative attention to convey consumers different preferences on their interested products and the distinct preferences of different consumers on the same product they like. Secondly, we train the DRIDAT objective function using adversarial learning to minimize the impact of iterative attack. In addition, the maximum direction attack could push the embedding vector of input attacks towards instances with distinct labels. We mitigate this problem by implementing suitable constraints on the direction of the attack. Finally, we perform a series of evaluations on two prominent datasets. The findings show that our methodology outperforms all other methods for all metrics. [ABSTRACT FROM AUTHOR]

Interrupt-driven programs are widely used in embedded systems with high security requirements. However, uncertain interleaving execution of tasks and interrupts may cause concurrency bugs, with data races being a significant factor in threatening security. Most of the previous research has focused on detecting data races in multi-threaded programs. And existing static analysis methods for interrupt-related data race detection often produce many false positives. This paper presents IntRace, an accurate and efficient static detection technique for interrupt data race. IntRace eliminates false data race by analyzing potential concurrency relationships and path reachability. It first identifies all race candidate pairs using access interleaving pattern matching. Then for each pair of operational accesses, IntRace analyzes potential concurrency relationships, including the special case of interrupt nesting, and uses this information to filter out access pairs that cannot concurrently access the same location. Finally, it checks the feasibility of events in the access pairs by constructing path constraints, which effectively eliminating infeasible paths in concurrent contexts. In addition, IntRace was evaluated on benchmark tests and 9 real embedded programs. The experimental results show that IntRace reduces the false positive rate by 73.2% compared to recent studies. [ABSTRACT FROM AUTHOR]

Most multimodal recommender systems utilize multimodal content of user-interacted items as supplemental information to capture user preferences based on historical interactions without considering user-uninteracted items. In contrast, multimodal recommender systems based on causal inference counterfactual learning utilize the causal difference between the multimodal content of user-interacted and user-uninteracted items to purify the content related to user preferences. However, existing methods adopt a unified multimodal channel, which treats each modality equally, resulting in the inability to distinguish users’ tastes for different modalities. Therefore, the differences in users’ attention and perception of different modalities' content cannot be reflected. To cope with the above issue, this paper proposes a novel recommender system based on multi-channel counterfactual learning (MCCL) networks to capture user fine-grained preferences on different modalities. First, two independent channels are established based on the corresponding features for the content of image and text modalities for modality-specific feature extraction. Then, leveraging the counterfactual theory of causal inference, features in each channel unrelated to user preferences are eliminated using the features of the user-uninteracted items. Features related to user preferences are enhanced and multimodal user preferences are modeled at the content level, which portrays the users' taste for the different modalities of items. Finally, semantic entities are extracted to model semantic-level multimodal user preferences, which are fused with historical user interaction information and content-level user preferences for recommendation. Extensive experiments on three different datasets show that our results improve up to 4.17% on NDCG compared to the optimal model. [ABSTRACT FROM AUTHOR]

A recommender system is a model that automatically recommends some meaningful cases (such as clips/films/goods/items) to the clients/people/consumers/users according to their (previous) interests. These systems are expected to recommend the items according to the users' interests. There are two traditional general recommender system models, i.e., Collaborative Filtering Recommender System (ColFRS) and Content-based Filtering Recommender System (ConFRS). Also, there is another model that is a hybrid of those two traditional recommender systems; it is called Hybrid Recommender System (HRS). An HRS usually outperforms simple traditional recommender systems. The problems such as scalability, cold start, and sparsity belong to the main problems that any recommender system should solve. The memory-based (modeless) recommender systems benefit from good accuracies. But they suffer from a lack of admissible scalability. The model-based recommender systems suffer from a lack of admissible accuracies. But they benefit from good scalability. In this paper, it is tried to propose a hybrid model based on an automatically improved ontology to solve the scalability, cold start, and sparsity problems. Our proposed HRS also uses an innovative approach of clustering as an augmented section. When there are enough ratings, it uses a collaborative filtering approach to predict the missing ratings. When there are not enough ratings, it uses a content-based filtering approach to predict the missing ratings. In the content-based filtering section of our proposed HRS, ontology concepts are used to improve the accuracy of ratings' prediction. If our target client is severely sparse, we cannot trust even the ratings predicted by the content-based filtering section of our proposed HRS. Therefore, our proposed HRS uses additive clustering to improve the prediction of the missing ratings if the target client is severely sparse. It is experimentally shown that our model outperforms many of the newly developed recommender systems. [ABSTRACT FROM AUTHOR]

As an essential part of big data, the recommendation system is widely used because of its practicability. Most of the traditional rating prediction algorithms mainly focus on explicit feedback, but this type of data is usually sparse in the real world. By contrast, the Bayesian Personalized Ranking (BPR) algorithm could directly optimize for ranking and provide personalized recommendation from implicit feedback. The BPR is a well-known pairwise method for one-class collaborative filtering, it proposed two assumptions: (1) it assumes all the unrated items are negative items for each user; and (2) it assumes user prefer rated items to unrated items. However, the assumptions in BPR may not always hold in reality. That is because for the unrated items, a user may have different view, such as potentially like or dislike. To mitigate the above-mentioned problems, we propose a novel approach to improving BPR for recommendation with the fusion of similarity, termed as FSBPR for brevity. We first fuse the predefined similarity and the learned similarity method to calculate the similarity between items, and then find the items that users may be interested in through the number of item occurrence. To this end, we divide the items into three sets for each user and provide the pairwise preference assumption. We also extend the idea of the CoFiSet model to our model and provide a series pairwise assumption. The model parameters are learned by the stochastic gradient descent. We conduct experiments on three real-world datasets to verify the accuracy of FSBPR, and compare FSBPR with the state-of-the-art methods. The experimental results indicate that our model significantly improves the accuracy of the recommendation. [ABSTRACT FROM AUTHOR]

With the massive amount of data available on the Internet, many users face problems when they need access to the information and goods they need. Adapting information to user needs has become a complex and time-consuming process. Recommender systems are powerful tools for guiding users in electronic settings to information, services, and goods of interest. With the ability to identify users and predict their preferences, recommender systems can extract information likely to be of interest to users from vast amounts of data and save time and energy by providing them with relevant recommendations. Therefore, in this paper, a framework for a recommender system is proposed, which consists of four main phases. In the first phase, the preprocessing operation is performed. The purpose of this phase is to create an ontology model for products based on the convolutional neural network method. Data collection operations are carried out in the second phase. The purpose of this phase is to receive and store user information based on behavior and different criteria. The third phase is related to creating an ontology. The purpose of this phase is to create an ontology model for user behavior using OWL libraries. Finally, in the last phase, finding similarities and presented a proposal. The purpose of this phase is the necessary calculations of the proposed framework in the similarity finding section using ontology models. Simulation results show that the proposed framework measures MAE (more than 10 and 15%), RMSE (more than 12 and 16%), precision (less than 10 and 13%), recall (more than 25 and 28%), F1-score (higher than 25 and 30%) and Score of User (higher than 15 and 17%) outperform two related approaches, namely CF and CF+ Ontology, respectively. [ABSTRACT FROM AUTHOR]

Can the media influence vote choice when the media and the party system are highly polarized, and vote shifts are infrequent? We argue affirmatively that media significantly influences vote choice even in such systems. First, we show that information filtered through the media has an independent effect on vote choice. Second, we link respondents' newspaper choices in the pre-election survey with the favorability of major political parties in their newspapers during the campaign period. Third, we provide rich empirical data from media content and voter surveys. Our analyses suggest that media content has a significant effect in influencing party support and vote switches during the campaign periods of four general elections between 2002 and 2015 in the increasingly polarized setting of Turkey. We further break down this effect to study how favorable coverage and visibility influence party support differently among partisan loyalists and switchers. [ABSTRACT FROM AUTHOR]

The ever-increasing number of cloud services has led to the service's identification problem. It has become difficult to provide users with cloud services that meet their functional and non-functional requirements, especially as many cloud services offer the same or similar functionality but with different execution constraints (cloud characteristics, QoS, price, and so on). Service recommendation systems can solve the service's identification problem by helping users to retrieve the right cloud services according to their desired needs. However, the majority of service recommendation systems rely on user feedback to locate the user's neighbors, predict missing ratings, and rank the recommended services. As a result, users' rating histories might cause three major problems: cold start, data sparsity, and malicious attack. In order to deal with these issues, we propose in this paper a hybrid recommendation approach, called "HRPCS", that provides a list of personalized cloud services to the active user. This approach is based on user and service clustering. In this approach, cloud services are recommended based on the user's needs (functional and non-functional) and QoS preferences. Then, the services are ranked according to their prices and credibility. Further, the proposed approach returns a list of diversified cloud services. The experimental results confirmed our expectations and proved the effectiveness of our approach. [ABSTRACT FROM AUTHOR]

A growing body of empirical evidence suggests the existence of a Paradox of Choice, whereby a larger choice set leads to a lower expected payoff to the decisionmaker. These empirical findings contradict traditional choice-theoretic results in microeconomics and even social psychology, suggesting profound yet unexplained aspects of choice settings/behavior. The Paradox remains largely as a theoretically-rootless empirical phenomenon. We neither understand the mechanisms and conditions that generate it, nor whether the Paradox stems from choice behavior, choice setting, or both. We present a general search model of consumer choice under incomplete information to examine the theoretical existence and conditions for the Paradox. The model departs from traditional microeconomic choice theory in assuming no "cognitive free lunches." Search and evaluative efforts require time, focus, and opportunity cost in the model, as in real life. The model shows that conditions for Paradox readily exist, diminishing returns to potential value of the choice in choice set size is a necessary condition for a Paradox outcome, that a Paradox outcome can occur with or without a "choice overload" response by the decisionmaker, and that avoidance of a Paradox outcome is an impossibility in some choice settings (primitive to setting regardless of choice behavior). Lastly, we develop a pareto-improving choice set reduction algorithm that eliminates weakly dominated choice set elements and presents the restricted choice set to the decisionmaker. As such, it is shown that the algorithm acts to treat or mitigate the Paradox of Choice, as well as to pareto-improve choice-supporting evaluation more generally. Like established AI recommender systems, the novel algorithm filters choices. In the present case, the filtering is based upon identification of weakly dominated choice set elements. [ABSTRACT FROM AUTHOR]

In e-commerce recommender systems, the sparsity of user-item rating data limits the quality of semantic embedding representation of users and items, which affects the accuracy of rating prediction. Previous studies have focused on learning attribute features or interaction features of nodes for recommendation and ignore the preference interest of rating tags in terms of attributes. In this paper, we propose a novel fusion representation method of multi-type node feature embedding for recommendation (MultiFEFR). The framework introduces rating preferences in terms of attributes and interactions and develops three kinds of feature presentations including rating-aware interaction feature embedding, rating-aware attribute feature embedding and heterogeneous attribute matched embedding. We design a multi-task joint learning strategy to optimize the accuracy of rating prediction. Experimental results show that the MultiFEFR outperforms the state-of-the-art models in MAE and RMSE metrics. Our findings are that the fusion of multi-type feature embedding can improve the accuracy of recommendation and the preference of attribute and interaction features are very explanatory for score grades. [ABSTRACT FROM AUTHOR]

Recently, there has been a surge in the popularity of online groups on event-based social networks (EBSNs) like Meetup and Douban Event. These groups cater to individuals who share common interests, provide comments, and engage in various activities. Our research focuses on online group recommendations, based on which users can conveniently join groups and participate in offline events organized by the groups. Traditional group recommendation methods do not work well in addressing this problem because they lack the ability to deal with the challenges posed by dynamic user interests, sparse supervision signals, and heterogeneous networks simultaneously. The self-attention model with contrastive learning for online group recommendation (SCL4GR) presented in this study exploits user-group sequential data, online and offline networks in a unified framework to predict user preferences for groups. First, a graph encoder is used to capture the high-order social interaction between users. Then, the pattern of dynamic interests is captured by sequence model Transformer. Furthermore, the contrastive learning is employed to derive self-supervision signals from both online and offline networks. We conduct experiments on three real-world datasets. Experimental results show that our SCL4GR consistently outperforms state-of-the-art methods for online group recommendation in EBSNs. [ABSTRACT FROM AUTHOR]

Fairness has become a critical value online, and the latest studies consider it in many problems. In recommender systems, fairness is important since the visibility of items is controlled by systems. Previous fairness-aware recommender systems assume that sufficient relationship data between users and items are available. However, it is common that new users and items are frequently introduced, and they have no relationship data yet. In this paper, we study recommendation methods to enhance fairness in a cold-start state. Fairness is more significant when the preference of a user or the popularity of an item is unknown. We propose a meta-learning-based cold-start recommendation framework called FaRM to alleviate the unfairness of recommendations. The proposed framework consists of three steps. We first propose a fairness-aware meta-path generation method to eliminate bias in sensitive attributes. In addition, we construct fairness-aware user representations through the meta-path aggregation approach. Then, we propose a novel fairness objective function and introduce a joint learning method to minimize the trade-off between relevancy and fairness. In extensive experiments with various cold-start scenarios, it is shown that FaRM is significantly superior in fairness performance while preserving relevance accuracy over previous work. [ABSTRACT FROM AUTHOR]

The online content, including live streaming and short videos, provides abundant visual and textual product information to users, which offers insights into users' multiple and changeable preferences toward product style, brand, color, etc. These dynamic preferences are helpful to the product recommender system to extract users' purchasing patterns. However, existing sequential recommendation fails to combine with items' multimodal characteristics and dynamic preferences. This paper proposes the Online Content-Based Sequence Recommendation method (named OCBSR), where dynamic preferences and multimodal representation such as visual images, textual descriptions, and item-ID of products are leveraged with convolutional autoencoder to map multimodal data into a unified latent space. We devise a multimodal transformer mechanism to aggregate the multimodal representation. A novel contrastive infomax loss is constructed through contrastive prototype representations and noise-contrastive sequences. The loss enhances the correlation between single-modality and multimodality preferences and learns the contrastive representation. Then, users' dynamic preferences are extracted from the contrastive representation in each time step using the gated recurrent unit with skip connections. Experiments are conducted on two real-life multimodal datasets, H&M and KuaiRec. The hit ratio (HR) and normalized discounted cumulative gain (NDCG) results indicate that our approach noticeably outperforms the current advanced recommenders. The HR increases by above 20% and 25% on H&M and KuaiRec datasets, respectively; the NDCG rises about 12% and 24% on H&M and KuaiRec datasets, respectively. The ablation study verifies each module's effectiveness. This research contributes to online content literature and multimodal sequential recommendation in practice. [ABSTRACT FROM AUTHOR]

As a knowledge representation method, knowledge graph is widely used in intelligent question answering systems and recommendation systems. At present, the research on knowledge graph mainly focuses on information query and retrieval based on knowledge graph. In some domain knowledge graphs, specific subgraph structures (patterns) have specific physical meanings. Aiming at this problem, this paper proposes a method and framework of knowledge graph pattern mining based on gat. Firstly, the patterns with specific physical meaning were transformed into subgraph structures containing topological structures and entity attributes. Secondly, the subgraph structure of the pattern is regarded as the query graph, and the knowledge graph is regarded as the data graph, so that the problem is transformed into an approximate subgraph matching problem. Then, the improved relational graph attention network is used to fuse the adaptive edge deletion mechanism to realize the approximate subgraph matching of subgraph structure and attribute, so as to obtain the best matching subgraph. The proposed method is trained in an end-to-end manner. The approximate subgraph matching is realized on the existing data set, and the research work of key pattern mining of complex geological structure knowledge graph is carried out. [ABSTRACT FROM AUTHOR]

Knowledge graphs are now widely used in various domains, including Question-and-answer systems, intelligent search and recommendation systems, and intelligent decision-making systems. However, knowledge graphs inevitably contain inaccurate and incomplete knowledge during the creation process, which leads to a reduction in the usefulness of knowledge graphs. Therefore, to assess the usefulness of knowledge graphs based on specific application requirements, quality assessment is particularly important. Among them, accuracy assessment, as a necessary dimension, reflects the degree of correctness of the triples. However, in the actual assessment process, the existing assessment methods do not consider the user's needs and do not implement the concept of "Fitness for Use". Meanwhile, it takes a lot of labor cost to evaluate the accuracy of large-scale knowledge graphs. Therefore, to ensure the accuracy of the assessment in a cost-saving way while meeting the needs of users, we propose and implement a novel accuracy assessment method that focuses on the requirements of users by designing an effective sampling method to obtain accurate assessment results that are more practical and instructive for users. Finally, the performance of our proposed method is evaluated by comparing it with the real accuracy rate, and the experimental results show that the accuracy rate obtained by the proposed method is very close to the real accuracy rate, and the sample size is minimized. [ABSTRACT FROM AUTHOR]

Knowledge graph (KG) shows great potential in improving recommendation systems. Recent studies have focused on developing end-to-end models based on graph neural networks. However, these previous approaches do not fully utilize collaborative signals, which are the collective information and feedback provided by multiple users in a recommendation system. Specifically, we think that collaborative signals could be better utilized in two points. Firstly, users' collective information leads to differences in node importance in KG, offering opportunities to improve item representation. Secondly, an item's collaborative filtering (CF) feature can reveal the multiple interests of a user, helping to gain fine-grained user representation. In this paper, we highlight the effect of node importance estimation and CF-based item clustering and propose the collaborative signals injection module. We integrate this module in our Collaborative Signals Enhanced Knowledge Graph recommendation (CSEKG) model. CSEKG outperforms state-of-the-art methods like KGIN (Wang et al. in Learning intents behind interactions with knowledge graph for recommendation. CoRR arXiv:2102.07057, 2021) , KGCL (Yang et al. in Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, 2022) , and KGRec (Yang et al. in Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining, 2023) through improving recall@20 by 3.86 % , 5.15 % , and 2.88 % on Last.FM, Amazon-Book and MovieLens-1M, respectively. Furthermore, we flexibly integrate the collaborative signals injection module into existing methods, such as LightGCN, KGAT and KGIN, which improves their performance. Further visualizing recommendation cases show the interpretability benefits brought by collaborative signals. [ABSTRACT FROM AUTHOR]

Crop Recommendation Systems are invaluable tools for farmers, assisting them in making informed decisions about crop selection to optimize yields. These systems leverage a wealth of data, including soil characteristics, historical crop performance, and prevailing weather patterns, to provide personalized recommendations. In response to the growing demand for transparency and interpretability in agricultural decision-making, this study introduces XAI-CROP an innovative algorithm that harnesses eXplainable artificial intelligence (XAI) principles. The fundamental objective of XAI-CROP is to empower farmers with comprehensible insights into the recommendation process, surpassing the opaque nature of conventional machine learning models. The study rigorously compares XAI-CROP with prominent machine learning models, including Gradient Boosting (GB), Decision Tree (DT), Random Forest (RF), Gaussian Naïve Bayes (GNB), and Multimodal Naïve Bayes (MNB). Performance evaluation employs three essential metrics: Mean Squared Error (MSE), Mean Absolute Error (MAE), and R-squared (R2). The empirical results unequivocally establish the superior performance of XAI-CROP. It achieves an impressively low MSE of 0.9412, indicating highly accurate crop yield predictions. Moreover, with an MAE of 0.9874, XAI-CROP consistently maintains errors below the critical threshold of 1, reinforcing its reliability. The robust R2 value of 0.94152 underscores XAI-CROP's ability to explain 94.15% of the data's variability, highlighting its interpretability and explanatory power. [ABSTRACT FROM AUTHOR]

In e-commerce, the session-based personalized recommendation remains challenging due to the limited user information within a single session. Merely relying on a user's local data is insufficient. It is vital to consider global data, extracting insights from sessions across all users to glean collaborative information. However, using all session information will waste computing resources. Moreover, much of the global data may not be pertinent to the current user, thereby undermining the quality of recommendations. To address this, we introduce the concept of personalized next session (PNS), selectively referencing sessions most relevant to the user to enhance the limited local data. This work is the first to adopt a deep network architecture study that incorporates the concept of PNS to recommend the next item for a user in the current session. We evaluated our approach on several real-world datasets, and the results show that our model outperforms state-of-the-art recommendation methods. [ABSTRACT FROM AUTHOR]

Background: Social risk factors, such as food insecurity and financial needs, are associated with increased risk of cardiovascular diseases, health conditions that are highly prevalent in rural populations. A better understanding of rural Veterans' experiences with social risk factors can inform expansion of Veterans Health Administration (VHA) efforts to address social needs. Objective: To examine social risk and need from rural Veterans' lived experiences and develop recommendations for VHA to address social needs. Design: We conducted semi-structured interviews with participants purposively sampled for racial diversity. The interview guide was informed by Andersen's Behavioral Model of Health Services Use and the Outcomes from Addressing Social Determinants of Health in Systems framework. Participants: Rural Veterans with or at risk of cardiovascular disease who participated in a parent survey and agreed to be recontacted. Approach: Interviews were recorded and transcribed. We analyzed transcripts using directed qualitative content analysis to identify themes. Key Results: Interviews (n = 29) took place from March to June 2022. We identified four themes: (1) Social needs can impact access to healthcare, (2) Structural factors can make it difficult to get help for social needs, (3) Some Veterans are reluctant to seek help, and (4) Veterans recommended enhancing resource dissemination and navigation support. Conclusions: VHA interventions should include active dissemination of information on social needs resources and navigation support to help Veterans access resources. Community-based organizations (e.g., Veteran Service Organizations) could be key partners in the design and implementation of future social need interventions. [ABSTRACT FROM AUTHOR]

Social networks are widely used platforms for sharing various information and content, including text, images, and videos.The main challenge in social networking today is the verification of data credibility and the identification of genuine social media profiles. Cybercriminals take advantage of this by utilizing fake profiles to disseminate false information. However, current research mainly concentrates on spam filtering and analyzing malicious behavior separately, disregarding the interrelated nature of these issues. We propose a more desirable global, hybrid solution that encompasses both malicious profile detection and spam detection to mitigate the spread of spam effectively. This paper offers a deep learning-based method for detecting malicious profiles and spam tweets. For the profiles to interact with them as legitimate profiles, we first provide the detection of fake profiles using an automated honeypot. Next, we detect those who make interactions as malicious profiles, and finally, we collect their shared content to find spam tweets using a convolution neural network algorithm. We suggest using collaborative filtering and content filtering algorithms from recommender systems to define accounts similar to harmful profiles and spam similar to spam material picked up by convolution neural networks. We get a highly compelling and intriguing outcome with higher accuracy (99.23%) and lesser loss than typical learning algorithms. [ABSTRACT FROM AUTHOR]

In the present scenario, the product recommendation system is important to boost sales on many e-commerce websites. The majority of the existing product recommendation systems completely rely on the customer's website browsing history or historical transaction records to precisely predict the user's preferences for online product recommendations that are constrained by the limited information available on the e-commerce websites. Usually, processing the customer's feedback is a difficult procedure, where it is tough in interpreting and analyzing the text information. Therefore, an effective deep learning-based recommendation framework is implemented in this research manuscript. After acquiring text information from the amazon product reviews database, the data pre-processing is carried-out by using stemming, lemmatization, and stop word removal techniques. The undertaken pre-processing techniques remove both inconsistent and duplicate data that eases the process of data interpretation and use. Further, the computational time of the model is decreased by removing inconsistent and duplicate data from the original dataset. Then, the feature values are extracted from the pre-processed text data using the term frequency-inverse document frequency (TF-IDF) technique. The extracted feature values are fed to the enhanced convolutional-neural-networks (CNNs) for sentiment analysis. The enhanced CNN model uses Glove as a pre-trained model with a skip-gram in the word-embedding layer for identifying the relevant product ratings based on the user's experience to further enhance product sentiment analysis. The embedding layer in the enhanced CNN-model effectively converts every word into fixed feature vectors that helps in better word representation along with reduced dimensions. The enhanced CNN model obtained a mean recall of 94.80%, the precision of 93.64%, and accuracy of 96.92% on the amazon product reviews database and it is superior to the traditional CNN. [ABSTRACT FROM AUTHOR]

Selective attention refers to the ability to focus on goal-relevant information while filtering out irrelevant information. In a multisensory context, how do people selectively attend to multiple inputs when making categorical decisions? Here, we examined the role of selective attention in cross-modal categorization in two experiments. In a speed categorization task, participants were asked to attend to visual or auditory targets and categorize them while ignoring other irrelevant stimuli. A response-time extended multinomial processing tree (RT-MPT) model was implemented to estimate the contribution of attentional focusing on task-relevant information and attentional filtering of distractors. The results indicated that the role of selective attention was modality-specific, with differences found in attentional focusing and filtering between visual and auditory modalities. Visual information could be focused on or filtered out more effectively, whereas auditory information was more difficult to filter out, causing greater interference with task-relevant performance. The findings suggest that selective attention plays a critical and differential role across modalities, which provides a novel and promising approach to understanding multisensory processing and attentional focusing and filtering mechanisms of categorical decision-making. [ABSTRACT FROM AUTHOR]

Low-light image enhancement based on deep learning has achieved breakthroughs recently. However, the current methods based on deep learning have problems with inadequate resolution enhancement or inadequate contrast. To address these problems, this paper proposes a resolution and contrast fusion network with ConvLSTM (RCFNC) for low-light image enhancement. The network is mainly constructed by four parts, including resolution enhancement branch, contrast enhancement branch, multi-scale feature fusion block (MFFB), and convolution long short-time memory block (ConvLSTM). Specifically, to improve the resolution of the low-light image, a resolution enhancement branch consisting of multi-scale differential feature blocks is proposed, using residual features at different scales to enhance the spatial details of image. To enhance the contrast of the image, a contrast enhancement branch consisting of adaptive convolution residual blocks is introduced to learn the mapping relationship between global and local features in the image. In addition, a weighted fusion is performed using MFFB to better balance the resolution and contrast features obtained from the above branches. Finally, to improve the learning capability of the model, ConvLSTM is added to filter redundant information. Experiments on the LOL, MIT5K, and five benchmark datasets show that RCFNC outperforms current state-of-the-art methods. [ABSTRACT FROM AUTHOR]