Search

This paper reports on a study on delinquent acts in three academic libraries in northern Ghana. A survey method was used for the study and a questionnaire was used to collect data. The study population consisted of staff in the Reader Service Sections of the three libraries. The study found that failure to observe library regulations, keeping overdue materials, eating in the library, littering, reserving seats unjustifiably, and hiding of books for the purpose of monopoly are examples of delinquent acts practiced by library users. According to the participants, the main reasons for delinquent acts are inadequate orientation to users, insufficient copies of books, and indiscipline among library users. The respondents further reported that these actions led to a reduction in library resources and low patronage. To curb deviant behaviors in libraries, the study recommends the adoption of pragmatic approaches including massive orientation for users, imbibing positive library culture that fosters respect, bolstering commitment and cooperation among library users and the staff, increasing library budgets as well as finding more creative ways of acquiring more copies of books, such as using Open Educational Resources (OERs), belonging to consortia and building and/or enhancing existing Institutional Repositories (IR). [ABSTRACT FROM AUTHOR]

Interlayer link prediction aims to identify the same entities in multiplex networks, providing significant value for applications like social network analysis and personalized recommendations. However, malicious individuals can misuse it to aggregate users’ private information. To address this, social network platforms must explore preventive measures, such as useful information deletion or noise information addition, to attack successful interlayer link prediction. This study introduces a novel node importance-based network structure perturbation method to degrade the accuracy of interlayer link prediction algorithms hence protecting user privacy. It utilizes the “guessing the friends” game analogy to identify influential nodes in social networks based on degree centrality. Perturbation involves randomly removing connections from nodes with low, medium, and high degree centrality. Multiple interlayer link prediction algorithms are evaluated under these perturbation attacks to assess their impact. Experiments on real-world datasets validate the proposed method’s effectiveness and reveal that perturbing the nodes with low degree centrality significantly affects interlayer link prediction accuracy. This research contributes valuable insights into safeguarding user privacy in interlayer link prediction, offering a robust approach anchored in node importance considerations. It promises to advance interlayer link prediction techniques and protect social network user privacy effectively. [ABSTRACT FROM AUTHOR]

The anterior cingulate cortex (ACC) has been shown to be critical to many aspects of executive function including filtering irrelevant information, updating response contingencies when reinforcement contingencies change and stabilizing task sets. Nonspecific lesions to this region in rats produce a vulnerability to distractors that have gained salience through prior associations with reinforcement. These lesions also exacerbate cognitive fatigue in tests of sustained attention but do not produce global attentional impairments nor do they produce distractibility to novel distractors that do not have a prior association with reinforcement. To determine the neurochemical basis of these cognitive impairments, dopaminergically selective lesions of the ACC were made in both male and female Long‐Evans, hooded rats prior to assessment in two attentional tasks. Dopaminergic lesions of the ACC increase the vulnerability of subjects to previously reinforced distractors and impede formation of an attentional set. Lesioned rats were not more susceptible to the effects of novel, irrelevant stimuli in a test of sustained attention as has been previously shown. Additionally, the effects of dopaminergic lesions were found to differ based on sex. Lesioned female, but not male, rats were more vulnerable than sham‐lesioned females to the effects of prolonged testing and the removal of reinforcement during a test of sustained attention. Together, these data support the hypothesis that dopamine in the ACC is critical to filtering distractors whose salience has been gained through reinforcement. [ABSTRACT FROM AUTHOR]

This study investigates the dynamic relationship between cross-border e-commerce and logistics co-development strategies within the context of small and medium-sized enterprises (SMEs) in China. The primary objective is to formulate an empirical model capable of estimating the utility and flexibility of cross-border e-commerce logistics, specifically focusing on its role in achieving competitive advantage for SMEs. The research employs a comprehensive approach, considering various factors that influence the formulation and implementation of cross-border e-commerce logistics strategies. Factors such as scale, quality, potential, and infrastructure are scrutinized to provide a nuanced understanding of the dynamic interplay. Real-world data is analyzed using advanced statistical techniques to derive meaningful insights. The data of CBEC and logistics planning in Guangdong from 2013 to 2018 was used as a case example to demonstrate its and flexibility and usefulness of empirically proposed model estimation and develop a holistic indicator system for the evaluation of the synergistic development of CBEC and logistics. This research focus on the modelling of the CBEC for the synergistic effect analysis and evaluate the usefulness and flexibility of CBEC to achieve competitive advantage. The study aims to uncover insights into the most effective approaches for Chinese SMEs in navigating the landscape of cross-border e-commerce. By examining the results derived from the empirical model, the research sheds light on the impact of cross-border e-commerce logistics on competitive advantage. The findings contribute to a deeper understanding of how SMEs can strategically position themselves in the cross-border e-commerce arena. Through the analysis of real-world data and the application of advanced statistical methods, this research offers valuable insights for Chinese SMEs. The insights generated from the study not only illuminate the intricacies of cross-border e-commerce logistics but also provide practical recommendations to reduce associated costs. Ultimately, the study aims to equip SMEs with the knowledge necessary to thrive in the evolving landscape of cross-border e-commerce. [ABSTRACT FROM AUTHOR]

Since the performance of the platform can be largely influenced by the relationships between users, it is important to consider the effect of recommender systems from a relational perspective, which is overlooked in the literature. Our study complements the literature by distinguishing recommended candidates as either familiar or unfamiliar based on relationship embeddedness. Using a recommender system’s launch on a freight exchange platform as a natural experiment, we employ difference-in-differences estimations to quantify the effects of recommending diverse candidates on user’s acceptance and overall transaction frequency. Results show that recommendations with familiar candidates are more likely to be accepted, but lead to a lower user’s overall transaction frequency. On the contrary, recommendations with unfamiliar candidates result in a higher user’s overall transaction frequency, suggesting that the positive effect of the recommender system is primarily driven by recommendations with unfamiliar candidates. We attribute these findings to informative signals of more matching opportunities conveyed by recommendations with unfamiliar candidates, which elevate user’s evaluation of the platform and stimulate more transactions. Our work contributes to the literature by highlighting a relational perspective in the design of recommender systems and the importance of diversity rather than accuracy. [ABSTRACT FROM AUTHOR]

The widespread adoption of Electronic Healthcare Records has resulted in an abundance of healthcare data. This data holds significant potential for improving healthcare services by providing valuable clinical insights and enhancing clinical decision-making. This paper presents a patient classification methodology that utilizes a multiclass and multilabel diagnostic approach to predict the patient's clinical class. The proposed model effectively handles comorbidities while maintaining a high level of accuracy. The implementation leverages the MIMIC III database as a data source to create a phenotyping dataset and train the models. Various machine learning models are employed in this study. Notably, the natural language processing-based One-Vs-Rest classifier achieves the best classification results, maintaining accuracy and F1 scores even with a large number of classes. The patient diagnostic class prediction model, based on the International Classification of Diseases 9, showcased in this paper, has broad applications in diagnostic support, treatment prediction, clinical assistance, recommender systems, clinical decision support systems, and clinical knowledge discovery engines. [ABSTRACT FROM AUTHOR]

The integration of cutting-edge technologies such as the Internet of Things (IoT), robotics, and machine learning (ML) has the potential to significantly enhance the productivity and profitability of traditional fish farming. Farmers using traditional fish farming methods incur enormous economic costs owing to labor-intensive schedule monitoring and care, illnesses, and sudden fish deaths. Another ongoing issue is automated fish species recommendation based on water quality. On the one hand, the effective monitoring of abrupt changes in water quality may minimize the daily operating costs and boost fish productivity, while an accurate automatic fish recommender may aid the farmer in selecting profitable fish species for farming. In this paper, we present AquaBot, an IoT-based system that can automatically collect, monitor, and evaluate the water quality and recommend appropriate fish to farm depending on the values of various water quality indicators. A mobile robot has been designed to collect parameter values such as the pH, temperature, and turbidity from all around the pond. To facilitate monitoring, we have developed web and mobile interfaces. For the analysis and recommendation of suitable fish based on water quality, we have trained and tested several ML algorithms, such as the proposed custom ensemble model, random forest (RF), support vector machine (SVM), decision tree (DT), K-nearest neighbor (KNN), logistic regression (LR), bagging, boosting, and stacking, on a real-time pond water dataset. The dataset has been preprocessed with feature scaling and dataset balancing. We have evaluated the algorithms based on several performance metrics. In our experiment, our proposed ensemble model has delivered the best result, with 94% accuracy, 94% precision, 94% recall, a 94% F1-score, 93% MCC, and the best AUC score for multi-class classification. Finally, we have deployed the best-performing model in a web interface to provide cultivators with recommendations for suitable fish farming. Our proposed system is projected to not only boost production and save money but also reduce the time and intensity of the producer's manual labor. [ABSTRACT FROM AUTHOR]

As modern technologies, particularly home assistant devices and sensors, become more integrated into our daily lives, they are also making their way into the domain of energy management within our homes. Homeowners, now acting as prosumers, have access to detailed information at 15-min or even 5-min intervals, including weather forecasts, outputs from renewable energy source (RES)-based systems, appliance schedules and the current energy balance, which details any deficits or surpluses along with their quantities and the predicted prices on the local energy market (LEM). The goal for these prosumers is to reduce costs while ensuring their home's comfort levels are maintained. However, given the complexity and the rapid decision-making required in managing this information, the need for a supportive system is evident. This is particularly true given the routine nature of these decisions, highlighting the potential for a system that provides personalized recommendations to optimize energy consumption, whether that involves adjusting the load or engaging in transactions with the LEM. In this context, we propose a recommendation system powered by large language models (LLMs), Scikit-llm and zero-shot classifiers, designed to evaluate specific scenarios and offer tailored advice for prosumers based on the available data at any given moment. Two scenarios for a prosumer of 5.9 kW are assessed using candidate labels, such as Decrease, Increase, Sell and Buy. A comparison with a content-based filtering system is provided considering the performance metrics that are relevant for prosumers. [ABSTRACT FROM AUTHOR]

In an era overwhelmed by academic big data, students grapple with identifying academic papers that resonate with their learning objectives and research interests, due to the sheer volume and complexity of available information. This study addresses the challenge by proposing a novel academic paper recommendation system designed to enhance personalized learning through the nuanced understanding of academic social networks. Utilizing the theory of social homogeneity, the research first constructs a sophisticated academic social network, capturing high-order social relationships, such as co-authorship and advisor–advisee connections, through hypergraph modeling and advanced network representation learning techniques. The methodology encompasses the development and integration of a hypergraph convolutional neural network and a contrastive learning framework to accurately model and recommend academic papers, focusing on aligning with students' unique preferences and reducing reliance on sparse interaction data. The findings, validated across multiple real-world datasets, demonstrate a significant improvement in recommendation accuracy, particularly in addressing the cold-start problem and effectively mapping advisor–advisee relationships. The study concludes that leveraging complex academic social networks can substantially enhance the personalization and precision of academic paper recommendations, offering a promising avenue for addressing the challenges of academic information overload and fostering more effective personalized learning environments. [ABSTRACT FROM AUTHOR]

Object-oriented micro-video background music recommendation is a complicated task where the matching degree between videos and background music is a major issue. However, music selections in user-generated content (UGC) are prone to selection bias caused by historical preferences of uploaders. Since historical preferences are not fully reliable and may reflect obsolete behaviors, over-reliance on them should be avoided as knowledge and interests dynamically evolve. In this article, we propose a Deconfounded Cross-Modal matching model to mitigate such bias. Specifically, uploaders' personal preferences of music genres are identified as confounders that spuriously correlate music embeddings and background music selections, causing the learned system to over-recommend music from majority groups. To resolve such confounders, backdoor adjustment is utilized to deconfound the spurious correlation between music embeddings and prediction scores. We further utilize Monte Carlo estimator with batch-level average as the approximations to avoid integrating the entire confounder space calculated by the adjustment. Furthermore, we design a teacher–student network to utilize the matching of music videos, which is professionally generated content (PGC) with specialized matching, to better recommend content-matching background music. The PGC data are modeled by a teacher network to guide the matching of uploader-selected UGC data of student network by Kullback–Leibler–based knowledge transfer. Extensive experiments on the TT-150k-genre dataset demonstrate the effectiveness of the proposed method. The code is publicly available on https://github.com/jing-1/DecCM [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]

Food Recommender Systems (RecSys) are innovative knowledge systems that inform consumers of food choices according to criteria, including nutritional content, health concerns, production method, carbon footprint or other social and ethical considerations. They raise important questions at the intersection of technology accuracy and today evolving consumers' knowledge seeking behaviours, which implies to unpack the epistemic value of food RecSys. This study investigates the drivers of the perceived value of food RSs consumption by proposing a model that establishes via PLS-SEM (n = 253) a positive relationship between the Yuka company's food RecSys' epistemic value and its perceived value. The model demonstrates that Yuka RecSys' epistemic value relies on the disciplinary drivers of compatibility, self-confidence, and consumer innovativeness, and the problematising drivers of memory and learning, which come from using the application. The perceived value of food RecSys is found to relate to RecSys epistemic value beyond the functional accuracy aspects of recommendation algorithms. Results highlight the importance of developing a refined understanding of epistemic value considering the consumption of RecSys. RecSys' developers, retailers, food manufacturers and policy makers must work on better mapping and adjusting information through consumers socialised RecSys' usage to shape the design of the next generation RecSys. [ABSTRACT FROM AUTHOR]

With the emerging era of E‐commerce and online shopping, people are also in a habit to receive default product recommendations on the web pages that they access. Google is already providing such suggestions. Till now recommendations were made only based on previous sentiments or feedback or ratings, but this research has improved the product recommendation method by including one more parameter for the same. This article represents two parameters for making predictions of product allocation to a new customer. These parameters are ratings given by the existing users for that particular product and the region to which the new customer belongs. Following these parameters, a prediction model and an algorithm, Improved_Collab_Similarity, have been implemented. The dataset has been developed where India as a country along with all its States has been considered for products which are popular for their creation based on regional and ancient skills of the people belonging to that area. Results for the mentioned prediction model have been discussed in this article where generally precision increases with the increase in a number of products but at some points, it does not increase when a smaller number of that product was purchased by the customers. [ABSTRACT FROM AUTHOR]

The industrial internet of things (IIoT) encompasses smart devices, manufacturing systems, humans, and networks for automated productive outcomes. The placement of devices and networks is vulnerable to distributed denial of service (DDOS) attacks that degrade the productivity and efficiency of IIoT. In this article, we propose a checkpoint‐intrigued adversary mitigation scheme (CIAMS) for improving the security features and recommendations of the detection systems. Features that use the recommendation to provide relevant information maintain their security level. A DDoS attack is dealt with at the outset, resulting in increased productivity. The IIoT's smart devices are less productive and efficient because of this DDoS attack. This CIAMS method is designed to address vulnerability and the ability to survive the features checkpoints. The proposed scheme substantiates the security breach and lag in the checkpoint systems against DDOS attacks. The checkpoints' vulnerability level and surviving features are assessed using a classified learning approach. In this assessment, the degrading features are reimbursed by improving the security functions, control, and access methods. Periodic checkpoint replacement and mutual security measures are used for mitigating the prolonging DDOS impact in the network. The proposed scheme's performance is verified using false positives, service distribution, lag, an efficiency score. Improvements have been made to the industrial environment's service delivery and efficiency. By reducing false positives by 10.35%, the proposed scheme improves service distribution ratio and efficiency score by 11.68% and 12.55% for different devices. [ABSTRACT FROM AUTHOR]

Background: Recommendations for cosmetics are gaining popularity, but they are not being made with consideration of the analysis of cosmetic ingredients, which customers consider important when selecting cosmetics. Aims: This article aims to propose a method for estimating the efficacy of cosmetics based on their ingredients and introduces a system that recommends personalized products for consumers, combined with AI skin analysis. Methods: We constructed a deep neural network architecture to analyze sequentially arranged cosmetic ingredients in the product and incorporated skin analysis models to get the precise skin status of users from frontal face images. Our recommendation system makes decisions based on the results optimized for the individual. Results: Our cosmetic recommendation system has shown its effectiveness through reliable evaluation metrics, and numerous examples have demonstrated its ability to make reasonable recommendations for various skin problems. Conclusion: The result shows that deep learning methods can be used to predict the effects of products based on their cosmetic ingredients and are available for use in personalized cosmetic recommendations. [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]

Personalisation, which tailors to individual preferences, is considered a possible route for improving engagement with digital mental health (DMH) products. Despite claims about the presence and importance of personalised features, evidence about their extent and impact is limited. The study objective was to review evidence from published research to investigate and characterise the contribution of personalisation to engagement and effectiveness.Research papers were retrieved using keywords, with 139 papers being fully examined and 61 meeting our eligibility criteria. Most of the eligible articles reviewing DMH systems have weak to intermediate forms of personalisation (45). Only nine were coded as having strong, adaptive personalisation. Of the 40 articles which evaluated the personalisation effectiveness, 28 were qualitative indicating user preference for personalised features. The 16 controlled, quantitative designs lacked a non-personalised intervention, making it difficult to determine the added value. Effect sizes calculated from available data showed minimal differences in effectiveness compared to non-personalised apps.Our review indicates mixed evidence of personalisation’s performance in DMH interventions. Generally, there is a lack of good quality evidence to isolate specific contributions of personalisation. Opportunities were identified for improved evaluation, however caution is required when implementing more sophisticated methods of DMH personalisation. [ABSTRACT FROM AUTHOR]

E-commerce platforms incorporate reputation systems that allow buyers to rate sellers after transactions. However, existing reputation systems face challenges such as privacy leakage, linkability, and multiple rating attacks. The feedback data can inadvertently expose user information privacy because they reveal the buyers' identities and preferences, which deters a significant number of users from providing their ratings. Moreover, malicious actors can exploit data analysis and machine learning techniques to mine user privacy from the rating data, posing serious threats to user security and trust. This study introduces ARS-Chain, a pioneering and secure blockchain-driven anonymous reputation-sharing framework tailored for e-commerce platforms. The core of ARS-Chain is a dynamic ring addition mechanism with linkable ring signatures (LRS), where the number of LRS rings is dynamically added in alignment with the evolving purchase list, and LRS link tags are constructed with the LRS rings and item identifiers. Further, a consortium blockchain is introduced to store these anonymous ratings on e-commerce platforms. As a result, ARS-Chain ensures full anonymity while achieving cross-platform reputation sharing, making rating records unlinkable, and effectively countering multiple rating attacks. The experimental results confirm that ARS-Chain significantly enhances user information privacy protection while maintaining system performance, having an important impact on the construction of trust mechanisms for e-commerce platforms. [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]

The diagnosis and recommendation integrated system (DRIS) has such high reliability that it can be used to evaluate many crops. Therefore, in order to have a practical database for these norms, this study was conducted to evaluate the established DRIS norms for plant pineapples (Ananas comosus L.) and to assess their nutrition status in an acid sulfate soil. Healthy and disease-free leaf samples of 8-month-old pineapple plants without fruits were collected from experimental fields with nutritional omission trials and from farmers' fields at four cultivating sites. Nutrient concentrations were analyzed to determine DRIS indices. The result showed that the + 7 leaf was highly reliable to diagnose the macro-nutrition status, while the + 1 leaf and + 3 leaf lacked the nutrient ratios pair to assess P and Mg nutrition status. Based on the average DRIS indices of the four sites, the nutrient surplus was observed in the order P>Mn>Fe>Ca (81.7 > 52.8 > 15.7 > 13.3), while nutrient deficiency varied in the order K>Zn>N>Mg (−88.2<-20.3<-16.4<-10.7) at the + 7 leaf. The DRIS norms needed to be calibrated to obtain nutrient ratio pairs for P in the + 1 leaf, and P and Mg at the + 3 leaf. [ABSTRACT FROM AUTHOR]

Summary: The existing active disturbance rejection control (ADRC) method may not provide sufficient disturbance rejection to multiple mismatched disturbances for the fractional order systems. In this paper, a composite disturbance rejection approach is developed for a class of fractional order uncertain systems, by synthesizing the fractional order ADRC (FOADRC) approach and a disturbance observer (DO)‐based compensation scheme. Taking advantage of more disturbance information and a filter structure, an improved DO is developed to achieve precise estimation of disturbances in the presence of sensor noises. In addition, a state transformation is developed to convert the system into a simple integral chain model with only matched disturbances. Then a composite control law is designed to compensate the disturbances and provide satisfying dynamic performance. The efficiency of the proposed method is demonstrated by a numerical simulation and an actual servo control simulation, as well as the comparison with two kinds of the existing ADRC methods and the commonly used integral sliding mode control (I‐SMC) method. [ABSTRACT FROM AUTHOR]

Recommender Systems are mainly used in various e-commerce applications, especially online stores threatening users’ privacy. The privacy issues can be overcome by using security solutions, which include blockchain technology for privacy applications. The fusion of the Internet of Things and blockchain technology has fully improved modern distributed systems. The combination guarantees the safety and scalability of the recommender system. We aim to create an authorized secure exchange device using blockchain-enabled multiparty computation by adding smart contracts to the core blockchain protocol. The recommendation structure and Blockchain technology make online shopping more convenient and private. We propose a blockchain-related recommender system using the “movielens” data. The case study includes a smart contract model that recommends movies to buyers. Initially, we tested the model on a small “movielens dataset” and extended it to a 3M movielens dataset. We developed a classifier model for movielens and proposed a Dual light graph convolutional network for movielens data classification. Our results, including ablation analysis, show that blockchain strategies and Dual light graph convolutional networks can effectively improve recommender systems’ privacy. Furthermore, the suggested blockchain technique can be stretched by similar procedures. [ABSTRACT FROM AUTHOR]

Recommender systems are becoming more and more significant in today's digital world and in the modern economy. They make a substantial contribution to company operations by offering tailored advice and decreasing overwhelm. Collaborative filtering, being popular in the domain of recommendation, is used to offer recommendations to attract the target audience based on the feedback of people with comparable interests. This method has some limitations, such as a cold-start issue, which makes the system less effective in anticipating unknown objects. We provide a hybrid deep-learning-based strategy centered on a method to enrich user and item profiles to address the cold-start issue in the recommendation process using a collaborative filtering approach. We employ pretrained deep learning models to produce rich user and item feature vectors that aid in the creation of useful suggestions and handling of user and item cold-start issues. The creation of more precise and tailored similarity matrices is made possible by adding metadata to the extracted features of the user and item. The results of the experiment demonstrate that in terms of precision and rate coverage, the proposed method performs better than the baseline techniques. [ABSTRACT FROM AUTHOR]

Knowledge graph (KG) is introduced as side information into recommender systems, which can alleviate the sparsity and cold start problems in collaborative filtering. Existing studies mainly focus on modeling users' historical behavior data and KG-based propagation. However, they have the limitation of ignoring noise information during recommendation. We consider that noise exists in two parts (i.e. KG and user-item interaction data). In this paper, we propose Knowledge-aware Dual-Channel Graph Neural Networks (KDGNN) to improve the recommendation performance by reducing the noise in the recommendation process. Specifically, (1) for the noise in KG, we design a personalized gating mechanism, namely dual-channel balancing mechanism, to block the propagation of redundant information in KG. (2) For the noise in user-item interaction data, we integrate personalized and knowledge-aware signals to capture user preferences fully and use personalized knowledge-aware attention to denoise user-item interaction data. Compared with existing KG-based methods, we aim to propose a knowledge-aware recommendation method from a new perspective of denoising. We perform performance analysis on three real-world datasets, and experiment results demonstrate that KDGNN achieves strongly competitive performance compared with several compelling state-of-the-art baselines. [ABSTRACT FROM AUTHOR]

Motivation The rapid expansion of Bioinformatics research has led to a proliferation of computational tools for scientific analysis pipelines. However, constructing these pipelines is a demanding task, requiring extensive domain knowledge and careful consideration. As the Bioinformatics landscape evolves, researchers, both novice and expert, may feel overwhelmed in unfamiliar fields, potentially leading to the selection of unsuitable tools during workflow development. Results In this article, we introduce the Bioinformatics Tool Recommendation system (BTR), a deep learning model designed to recommend suitable tools for a given workflow-in-progress. BTR leverages recent advances in graph neural network technology, representing the workflow as a graph to capture essential context. Natural language processing techniques enhance tool recommendations by analyzing associated tool descriptions. Experiments demonstrate that BTR outperforms the existing Galaxy tool recommendation system, showcasing its potential to streamline scientific workflow construction. Availability and implementation The Python source code is available at https://github.com/ryangreenj/bioinformatics_tool_recommendation. [ABSTRACT FROM AUTHOR]

Recommendation systems are an effective solution to deal with information overload, particularly in the e-commerce sector, in which sequential recommendation is extensively utilized. Sequential recommendations aim to acquire users' interests and provide accurate recommendations by analyzing users' historical interaction sequences. To improve recommendation performance, it is vital to take into account the long- and short-term interests of users. Despite significant advancements in this domain, some issues need to be addressed. Conventional sequential recommendation models typically express each item with a uniform embedding, ignoring evolutionary patterns among item attributes, such as category, brand, and price. Moreover, these models often model users' long- and short-term interests independently, failing to adequately address the issues of interest drift and short-term interest evolution. This study proposes a new model, the Feature-aware Long-Short Interest Evolution Network (FLSIE), to address the above-mentioned issues. Specifically, the model uses explicit feature embedding to represent item attribute information and employs a two-dimensional (2D) attention mechanism to distinguish the significance of individual features in a specific item and the relevance of each item in the interaction sequence. Furthermore, to avoid the issue of interest drift, the model employs a long-term interest guidance mechanism to enhance the representation of short-term interest and adopts a gated recurrent unit with attentional update gate to model the dynamic evolution of users' short-term interest. Experimental results indicate that our presented model outperforms existing methods on three real-world datasets. [ABSTRACT FROM AUTHOR]

Neuro-fuzzy techniques have been widely used in many applications due to their ability to generate interpretable fuzzy rules. Ensemble learning, on the other hand, is an emerging paradigm in artificial intelligence used to improve performance results by combining multiple single learners. This paper aims to develop and evaluate a set of homogeneous ensembles over four medical datasets using hyperparameter tuning of four neuro-fuzzy systems: adaptive neuro-fuzzy inference system (ANFIS), Dynamic evolving neuro-fuzzy system (DENFIS), Hybrid fuzzy inference system (HyFIS), and neuro-fuzzy classifier (NEFCLASS). To address the interpretability challenges and to reduce the complexity of high-dimensional data, the information gain filter was used to identify the most relevant features. After that, the performance of the neuro-fuzzy single learners and ensembles was evaluated using four performance metrics: accuracy, precision, recall, and f1 score. To decide which single learners/ensembles perform better, the Scott-Knott and Borda count techniques were used. The Scott-Knott first groups the models based on the accuracy to find the classifiers appearing in the best cluster, while the Borda count ranks the models based on all the four performance metrics without favoring any of the metrics. Results showed that: (1) The number of the combined single learners positively impacts the performance of the ensembles, (2) Single neuro-fuzzy classifiers demonstrate better or similar performance to the ensembles, but the ensembles still provide better stability of predictions, and (3) Among the ensembles of different models, ANFIS provided the best ensemble results. [ABSTRACT FROM AUTHOR]

E-commerce providers increasingly rely on recommender systems to curate online consumption. EU law requirements for such recommender systems were initially introduced in privacy legislation, but recent years have seen several new provisions on this topic in consumer protection legislation and platform regulation. However, the latter regulations are limited to online intermediaries and, just like privacy legislation, they merely require businesses that use recommender systems to provide transparency on this to consumers. Transparency is not a solution for the challenges that recommender systems pose because it is difficult to achieve (especially towards consumers) and is not enough to allow users to control recommendations. Furthermore, most of these tools rely on private enforcement, which has proved to be less than effective. [ABSTRACT FROM AUTHOR]

Community detection is a well-known area of research that yields essential results in various fields such as social media, biological networks, pandemic spread, recommendation systems, etc. There are two important areas for improvement in existing community detection algorithms: quality of community formed should be improved and a parallel approach to community detection is needed to handle massive data. In this paper, we have proposed a three-step parallel algorithm, Par-Com, using the concept of k Clique and modularity optimization to address both of the above issues. The proposed algorithm increases the execution speed and also improves the quality of the community formed by optimizing modularity. Par-Com uses dynamic load balancing on the multicore architecture of Supercomputer ParamShivay. We have also evaluated Par-Com's performance against nine sequential and three parallel community detection algorithms on varying size datasets, i.e. karate, macaque, email, immuno, soc-epinions, facebook, and com-Friendster. The experiment result shows that Par-Com outperforms other algorithms under consideration with up to 45% increase in modularity and up to 84% increase in execution speed. Par-Com is also capable of detecting overlapping communities, fuzzy membership of each node, most influential node in each community formed, and outlier nodes. Nodes within a community that have the highest influence are deemed as experts. The choices made by an expert in a particular community are served as recommendations to other users within that community. [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]

A distributed state observer is designed for state estimation and tracking of mobile robots amidst dynamic environments and occlusions within distributed LiDAR sensor networks. The proposed novel framework enhances three-dimensional bounding box detection and tracking utilizing a consensus-based information filter and a region of interest for state estimation of mobile robots. The framework enables the identification of the input to the dynamic process using remote sensing, enhancing the state prediction accuracy for low-visibility and occlusion scenarios in dynamic scenes. Experimental evaluations in indoor settings confirm the effectiveness of the framework in terms of accuracy and computational efficiency. These results highlight the benefit of integrating stationary LiDAR sensors' state estimates into a switching consensus information filter to enhance the reliability of tracking and to reduce estimation error in the sense of mean square and covariance. [ABSTRACT FROM AUTHOR]

Search engines serve as information gatekeepers on a multitude of topics dealing with different aspects of society. However, the ways search engines filter and rank information are prone to biases related to gender, ethnicity, and race. In this article, we conduct a systematic algorithm audit to examine how one specific form of bias, namely, sexualization, is manifested in Google's text search results about different national and gender groups. We find evidence of the sexualization of women, particularly those from the Global South and East, in search outputs in both organic and sponsored search results. Our findings contribute to research on the sexualization of people in different forms of media, bias in web search, and algorithm auditing as well as have important implications for the ongoing debates about the responsibility of transnational tech companies for preventing systems they design from amplifying discrimination. [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]

Accurate segmentation of brain tumors has a vital impact on clinical diagnosis and treatment, and good segmentation results are helpful for the treatment of this disease, which is a serious threat to human health. High‐precision segmentation of brain tumors remains a challenging task due to their diverse shapes, sizes, locations, and complex boundaries. Considering the special structure of medical brain tumor images, many researchers have proposed a brain tumor segmentation (BraTS) network based on 3D U‐Net. However, there are also problems such as insufficient receptive fields and excessive computing costs. In this paper, we propose an efficient BraTS model based on group normalization (GN) and 3D U‐Net (3D‐EffUNet). First, according to the characteristics of brain tumor images, the medical image of the whole case is input into the model, and 3D convolution layers are used to extract features and filter irrelevant information. Then, using 3D U‐Net as the main framework, an efficient convolutional module is designed for more precise processing of brain tumor features. Moreover, an efficient convolution module based on GN and an attention mechanism is introduced to reduce the complexity of the network without affecting the segmentation performance and to increase the awareness of voxels between adjacent dimensions and the local space. Finally, the decoder was used to reconstruct high‐precision BraTS information. The model is trained and tested on the BraTS2021 dataset, and the experimental results show that it can maintain good segmentation performance and greatly reduce the calculation cost. [ABSTRACT FROM AUTHOR]

This paper conceptualizes a consumer-centric, regenerative artificial intelligence ("ReGenAI") model for the Fast-Moving Consumer Goods ("FMCG") retailing channel. The system uses its awareness of context, time, and users to (re)generate customer touchpoints and other marketing communications. Its output provides deep insights into regular and altered FMCG customer journeys, such as shopping behaviors under stressors like lifestyle choices or cataclysmic socio-economic and weather events. The recursive model advances from current, generative AI systems. It uses "tired or inspired" as a simplified bifurcated grocery shopper taxonomy to operationalize customers' purchasing and consumption behaviors into actionable data for demand planning and retail operations. [ABSTRACT FROM AUTHOR]

The integration of graph embedding technology and collaborative filtering algorithms has shown promise in enhancing the performance of recommendation systems. However, existing integrated recommendation algorithms often suffer from feature bias and lack effectiveness in personalized user recommendation. For instance, users' historical interactions with a certain class of items may inaccurately lead to recommendations of all items within that class, resulting in feature bias. Moreover, accommodating changes in user interests over time poses a significant challenge. This study introduces a novel recommendation model, RCKFM, which addresses these shortcomings by leveraging the CoFM model, TransR graph embedding model, backdoor tuning of causal inference, KL divergence, and the factorization machine model. RCKFM focuses on improving graph embedding technology, adjusting feature bias in embedding models, and achieving personalized recommendations. Specifically, it employs the TransR graph embedding model to handle various relationship types effectively, mitigates feature bias using causal inference techniques, and predicts changes in user interests through KL divergence, thereby enhancing the accuracy of personalized recommendations. Experimental evaluations conducted on publicly available datasets, including "MovieLens-1M" and "Douban dataset" from Kaggle, demonstrate the superior performance of the RCKFM model. The results indicate a significant improvement of between 3.17% and 6.81% in key indicators such as precision, recall, normalized discount cumulative gain, and hit rate in the top-10 recommendation tasks. These findings underscore the efficacy and potential impact of the proposed RCKFM model in advancing recommendation systems. [ABSTRACT FROM AUTHOR]

A text recommendation system helps language learners find suitable reading materials. Similar to graded readers, most systems assign difficulty levels or school grades to the documents in their database, and then identify the documents that best match the language proficiency of the learner. This graded approach has two main limitations. First, the common grade scale assumes that all learners find the same words difficult, ignoring different orders in vocabulary acquisition. Second, it cannot cater to the incremental vocabulary expansion typical of language learners, since discrete grades do not facilitate fine-grained adaptation in text recommendation. This article evaluates a personalized and adaptive method for text recommendation that aims to mitigate these limitations. This method recommends documents according to the new-word density preferred by the user. It estimates a document's new-word density with an open learner model that predicts the user's vocabulary knowledge. Users can dynamically update the learner model as they acquire new vocabulary. We conducted a user study involving ten learners of Chinese as a foreign language. Results shows that this method can estimate the learner model at 77.6% accuracy, outperforming the graded approach. Further, a user simulation demonstrates that it can recommend documents within 0.22% of the target new-word density, satisfying user preferences more accurately than the graded approach. [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]

The more science advances, the more questions are asked. This compounding growth can make it difficult to keep up with current research directions. Furthermore, this difficulty is exacerbated for junior researchers who enter fields with already large bases of potentially fruitful research avenues. In this paper, we propose a novel task and a recommender system for research directions, RecSOI, that draws from statements of ignorance (SOIs) found in the research literature. By building researchers' profiles based on textual elements, RecSOI generates personalized recommendations of potential research directions tailored to their interests. In addition, RecSOI provides context for the recommended SOIs, so that users can quickly evaluate how relevant the research direction is for them. In this paper, we provide an overview of RecSOI's functioning, implementation, and evaluation, demonstrating its effectiveness in guiding researchers through the vast landscape of potential research directions. [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]

To improve the accuracy of multiple target tracking in the clutter environment, a new joint probabilistic data association (JPDA) algorithm based on variational Bayesian adaptive moment estimation is proposed. First, considering the existence of measurements, the posterior distribution of the target state in JPDA is composed of two parts of probability weighting, that is, the posterior distribution of the target state that the real measurement exists in the association gate and the posterior distribution of the target state that the real measurement does not exist in the association gate. By combining the conjugate properties of the prior and posterior distributions, the prior distributions of the target state in the two cases are classified to provide more accurate a priori information to filter, so as to improve the accuracy of data association. Second, considering the coupling effect between state estimation and data association process, combined with variational Bayesian inference, the problem of minimizing Kullback–Leibler divergence is transformed into the problem of maximizing the evidence lower bound, thereby effectively measuring the distance between the posterior distribution of target state estimation and the real posterior distribution, so as to improve the accuracy of data association again from the perspective of optimizing nonlinear filter. Finally, the adaptive momentum estimation strategy is introduced to iteratively solve the variable distribution that meets the maximization of the evidence lower bound, and the optimization of the posterior distribution of the target state is completed. Theoretical derivation and simulation experiments are conducted to verify the feasibility and effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Background: People with polycystic ovary syndrome suffer from many symptoms and are at risk of developing diseases such as hypertension and diabetes in the future. Therefore, the importance of self-care doubles. It is mainly to modify the lifestyle, especially following the principles of healthy eating. The purpose of this study is to review artificial intelligence-based systems for providing management recommendations, especially food recommendations. Materials and methods: This study started by searching three databases: PubMed, Scopus, and Web of Science, from inception until 6 June 2023. The result was the retrieval of 15,064 articles. First, we removed duplicate studies. After the title and abstract screening, 119 articles remained. Finally, after reviewing the full text of the articles and considering the inclusion and exclusion criteria, 20 studies were selected for the study. To assess the quality of articles, we used criteria proposed by Malhotra, Wen, and Kitchenham. Out of the total number of included studies, seventeen studies were high quality, while three studies were moderate quality. Results: Most studies were conducted in India in 2021. Out of all the studies, diagnostic recommendation systems were the most frequently researched, accounting for 86% of the total. Precision, sensitivity, specificity, and accuracy were more common than other performance metrics. The most significant challenge or limitation encountered in these studies was the small sample size. Conclusion: Recommender systems based on artificial intelligence can help in fields such as prediction, diagnosis, and management of polycystic ovary syndrome. Therefore, since there are no nutritional recommendation systems for these patients in Iran, this study can serve as a starting point for such research. [ABSTRACT FROM AUTHOR]

Real-world listening settings often consist of multiple concurrent sound streams. To limit perceptual interference during selective listening, the auditory system segregates and filters the relevant sensory input. Previous work provided evidence that the auditory cortex is critically involved in this process and selectively gates attended input toward subsequent processing stages. We studied at which level of auditory cortex processing this filtering of attended information occurs using functional magnetic resonance imaging (fMRI) and a naturalistic selective listening task. Forty-five human listeners (of either sex) attended to one of two continuous speech streams, presented either concurrently or in isolation. Functional data were analyzed using an inter-subject analysis to assess stimulus-specific components of ongoing auditory cortex activity. Our results suggest that stimulus-related activity in the primary auditory cortex and the adjacent planum temporale are hardly affected by attention, whereas brain responses at higher stages of the auditory cortex processing hierarchy become progressively more selective for the attended input. Consistent with these findings, a complementary analysis of stimulus-driven functional connectivity further demonstrated that information on the to-be-ignored speech stream is shared between the primary auditory cortex and the planum temporale but largely fails to reach higher processing stages. Our findings suggest that the neural processing of ignored speech cannot be effectively suppressed at the level of early cortical processing of acoustic features but is gradually attenuated once the competing speech streams are fully segregated. [ABSTRACT FROM AUTHOR]

Today, due to the expansion of the Internet and social networks, people are faced with a vast amount of dynamic information. To mitigate the issue of information overload, recommender systems have become pivotal by analyzing users' activity histories to discern their interests and preferences. However, most available social image recommender systems utilize a static strategy, meaning they do not adapt to changes in user preferences. To overcome this challenge, our paper introduces a dynamic image recommender system that leverages a deep reinforcement learning (DRL) framework, enriched with a novel set of features including emotion, style, and personality. These features, uncommon in existing systems, are instrumental in crafting a user's characteristic vector, offering a personalized recommendation experience. Additionally, we overcome the challenge of state representation definition in reinforcement learning by introducing a new state representation. The experimental results show that our proposed method, compared to some related works, significantly improves Recall@k and Precision@k by approximately 7%–10% (for the top 100 images recommended) for personalized image recommendation. [ABSTRACT FROM AUTHOR]