8,122 research outputs found

    Honey fraud detection based on sugar syrup adulterations by HPLC-UV fingerprinting and chemometrics

    Full text link
    In recent years, honey-producing sector has faced the increasing presence of adulterated honeys, implying greateconomic losses and questioning the quality of this highly appreciated product by the society. Due to the highsugar content of honey, sugar syrups are among its most common adulterants, being also the most difficult todetect even with isotope ratio techniques depending on the origin of the sugar syrup plant source. In this work, ahoney authentication method based on HPLC-UV fingerprinting was developed, exhibiting a 100% classificationrate of honey samples against a great variety of sugar syrups (agave, corn, fiber, maple, rice, sugar cane andglucose) by partial least squares-discriminant analysis (PLS-DA). In addition, the detection and level quantitationof adulteration using syrups as adulterants (down to 15%) was accomplished by partial least squares (PLS)regression with low prediction errors by both internal and external validation (values below 12.8% and 19.7%,respectively

    Optimizing DUS testing for Chimonanthus praecox using feature selection based on a genetic algorithm

    Get PDF
    Chimonanthus praecox is a famous traditional flower in China with high ornamental value. It has numerous varieties, yet its classification is highly disorganized. The distinctness, uniformity, and stability (DUS) test enables the classification and nomenclature of various species; thus, it can be used to classify the Chimonanthus varieties. In this study, flower traits were quantified using an automatic system based on pattern recognition instead of traditional manual measurement to improve the efficiency of DUS testing. A total of 42 features were quantified, including 28 features in the DUS guidelines and 14 new features proposed in this study. Eight algorithms were used to classify wintersweet, and the random forest (RF) algorithm performed the best when all features were used. The classification accuracy of the outer perianth was the highest when the features of the different parts were used for classification. A genetic algorithm was used as the feature selection algorithm to select a set of 22 reduced core features and improve the accuracy and efficiency of the classification. Using the core feature set, the classification accuracy of the RF model improved to 99.13%. Finally, K-means was used to construct a pedigree cluster tree of 23 varieties of wintersweet; evidently, wintersweet was clustered into a single class, which can be the basis for further study of genetic relationships among varieties. This study provides a novel method for DUS detection, variety identification, and pedigree analysis

    Long-term land cover changes assessment in the Jiului Valley mining basin in Romania

    Get PDF
    Introduction: Highlighting and assessing land cover changes in a heterogeneous landscape, such as those with surface mining activities, allows for understanding the dynamics and status of the analyzed area. This paper focuses on the long-term land cover changes in the Jiului Valley, the largest mining basin in Romania, using Landsat temporal image series from 1988 to 2017.Methods: The images were classified using the supervised Support Vector Machine (SVM) algorithm incorporating four kernel functions and two common algorithms (Maximum Likelihood Classification - MLC) and (Minimum Distance - MD). Seven major land cover classes have been identified: forest, pasture, agricultural land, built-up areas, mined areas, dump sites, and water bodies. The accuracy of every classification algorithm was evaluated through independent validation, and the differences in accuracy were subsequently analyzed. Using the best-performing SVM-RBF algorithm, classified maps of the study area were developed and used for assessing land cover changes by post-classification comparison (PCC).Results and discussions: All three algorithms displayed an overall accuracy, ranging from 76.56% to 90.68%. The SVM algorithms outperformed MLC by 4.87%–8.80% and MD by 6.82%–10.67%. During the studied period, changes occurred within analyzed classes, both directly and indirectly: forest, built-up areas, mined areas, and water bodies experienced increases, whereas pasture, agricultural land, and dump areas saw declines. The most notable changes between 1988 and 2017 were observed in built-up and dump areas: the built-up areas increased by 110.7%, while the dump sites decreased by 53.0%. The mined class showed an average growth of 6.5%. By highlighting and mapping long-term land cover changes in this area, along with their underlying causes, it became possible to analyze the impact of land management and usage on sustainable development and conservation effort over time

    On the Generation of Realistic and Robust Counterfactual Explanations for Algorithmic Recourse

    Get PDF
    This recent widespread deployment of machine learning algorithms presents many new challenges. Machine learning algorithms are usually opaque and can be particularly difficult to interpret. When humans are involved, algorithmic and automated decisions can negatively impact people’s lives. Therefore, end users would like to be insured against potential harm. One popular way to achieve this is to provide end users access to algorithmic recourse, which gives end users negatively affected by algorithmic decisions the opportunity to reverse unfavorable decisions, e.g., from a loan denial to a loan acceptance. In this thesis, we design recourse algorithms to meet various end user needs. First, we propose methods for the generation of realistic recourses. We use generative models to suggest recourses likely to occur under the data distribution. To this end, we shift the recourse action from the input space to the generative model’s latent space, allowing to generate counterfactuals that lie in regions with data support. Second, we observe that small changes applied to the recourses prescribed to end users likely invalidate the suggested recourse after being nosily implemented in practice. Motivated by this observation, we design methods for the generation of robust recourses and for assessing the robustness of recourse algorithms to data deletion requests. Third, the lack of a commonly used code-base for counterfactual explanation and algorithmic recourse algorithms and the vast array of evaluation measures in literature make it difficult to compare the per formance of different algorithms. To solve this problem, we provide an open source benchmarking library that streamlines the evaluation process and can be used for benchmarking, rapidly developing new methods, and setting up new experiments. In summary, our work contributes to a more reliable interaction of end users and machine learned models by covering fundamental aspects of the recourse process and suggests new solutions towards generating realistic and robust counterfactual explanations for algorithmic recourse

    An artificial intelligence approach to predicting personality types in dogs

    Get PDF
    Canine personality and behavioural characteristics have a significant influence on relationships between domestic dogs and humans as well as determining the suitability of dogs for specific working roles. As a result, many researchers have attempted to develop reliable personality assessment tools for dogs. Most previous work has analysed dogs’ behavioural patterns collected via questionnaires using traditional statistical analytic approaches. Artificial Intelligence has been widely and successfully used for predicting human personality types. However, similar approaches have not been applied to data on canine personality. In this research, machine learning techniques were applied to the classification of canine personality types using behavioural data derived from the C-BARQ project. As the dataset was not labelled, in the first step, an unsupervised learning approach was adopted and K-Means algorithm was used to perform clustering and labelling of the data. Five distinct categories of dogs emerged from the K-Means clustering analysis of behavioural data, corresponding to five different personality types. Feature importance analysis was then conducted to identify the relative importance of each behavioural variable’s contribution to each cluster and descriptive labels were generated for each of the personality traits based on these associations. The five personality types identified in this paper were labelled: “Excitable/Hyperattached”, “Anxious/Fearful”, “Aloof/Predatory”, “Reactive/Assertive”, and “Calm/Agreeable”. Four machine learning models including Support Vector Machine (SVM), K-Nearest Neighbour (KNN), Naïve Bayes, and Decision Tree were implemented to predict the personality traits of dogs based on the labelled data. The performance of the models was evaluated using fivefold cross validation method and the results demonstrated that the Decision Tree model provided the best performance with a substantial accuracy of 99%. The novel AI-based methodology in this research may be useful in the future to enhance the selection and training of dogs for specific working and non-working roles

    Rapid detection of diabetic retinopathy in retinal images: a new approach using transfer learning and synthetic minority over-sampling technique

    Get PDF
    The challenge of early detection of diabetic retinopathy (DR), a leading cause of vision loss in working-age individuals in developed nations, was addressed in this study. Current manual analysis of digital color fundus photographs by clinicians, although thorough, suffers from slow result turnaround, delaying necessary treatment. To expedite detection and improve treatment timeliness, a novel automated detection system for DR was developed. This system utilized convolutional neural networks. Visual geometry group 16-layer network (VGG16), a pre-trained deep learning model, for feature extraction from retinal images and the synthetic minority over-sampling technique (SMOTE) to handle class imbalance in the dataset. The system was designed to classify images into five categories: normal, mild DR, moderate DR, severe DR, and proliferative DR (PDR). Assessment of the system using the Kaggle diabetic retinopathy dataset resulted in a promising 93.94% accuracy during the training phase and 88.19% during validation. These results highlight the system's potential to enhance DR diagnosis speed and efficiency, leading to improved patient outcomes. The study concluded that automation and artificial intelligence (AI) could play a significant role in timely and efficient disease detection and management

    Computational models for predicting liver toxicity in the deep learning era

    Get PDF
    Drug-induced liver injury (DILI) is a severe adverse reaction caused by drugs and may result in acute liver failure and even death. Many efforts have centered on mitigating risks associated with potential DILI in humans. Among these, quantitative structure-activity relationship (QSAR) was proven to be a valuable tool for early-stage hepatotoxicity screening. Its advantages include no requirement for physical substances and rapid delivery of results. Deep learning (DL) made rapid advancements recently and has been used for developing QSAR models. This review discusses the use of DL in predicting DILI, focusing on the development of QSAR models employing extensive chemical structure datasets alongside their corresponding DILI outcomes. We undertake a comprehensive evaluation of various DL methods, comparing with those of traditional machine learning (ML) approaches, and explore the strengths and limitations of DL techniques regarding their interpretability, scalability, and generalization. Overall, our review underscores the potential of DL methodologies to enhance DILI prediction and provides insights into future avenues for developing predictive models to mitigate DILI risk in humans

    Analysis and monitoring of single HaCaT cells using volumetric Raman mapping and machine learning

    Get PDF
    No explorer reached a pole without a map, no chef served a meal without tasting, and no surgeon implants untested devices. Higher accuracy maps, more sensitive taste buds, and more rigorous tests increase confidence in positive outcomes. Biomedical manufacturing necessitates rigour, whether developing drugs or creating bioengineered tissues [1]–[4]. By designing a dynamic environment that supports mammalian cells during experiments within a Raman spectroscope, this project provides a platform that more closely replicates in vivo conditions. The platform also adds the opportunity to automate the adaptation of the cell culture environment, alongside spectral monitoring of cells with machine learning and three-dimensional Raman mapping, called volumetric Raman mapping (VRM). Previous research highlighted key areas for refinement, like a structured approach for shading Raman maps [5], [6], and the collection of VRM [7]. Refining VRM shading and collection was the initial focus, k-means directed shading for vibrational spectroscopy map shading was developed in Chapter 3 and exploration of depth distortion and VRM calibration (Chapter 4). “Cage” scaffolds, designed using the findings from Chapter 4 were then utilised to influence cell behaviour by varying the number of cage beams to change the scaffold porosity. Altering the porosity facilitated spectroscopy investigation into previously observed changes in cell biology alteration in response to porous scaffolds [8]. VRM visualised changed single human keratinocyte (HaCaT) cell morphology, providing a complementary technique for machine learning classification. Increased technical rigour justified progression onto in-situ flow chamber for Raman spectroscopy development in Chapter 6, using a Psoriasis (dithranol-HaCaT) model on unfixed cells. K-means-directed shading and principal component analysis (PCA) revealed HaCaT cell adaptations aligning with previous publications [5] and earlier thesis sections. The k-means-directed Raman maps and PCA score plots verified the drug-supplying capacity of the flow chamber, justifying future investigation into VRM and machine learning for monitoring single cells within the flow chamber

    Deep Learning Techniques for Electroencephalography Analysis

    Get PDF
    In this thesis we design deep learning techniques for training deep neural networks on electroencephalography (EEG) data and in particular on two problems, namely EEG-based motor imagery decoding and EEG-based affect recognition, addressing challenges associated with them. Regarding the problem of motor imagery (MI) decoding, we first consider the various kinds of domain shifts in the EEG signals, caused by inter-individual differences (e.g. brain anatomy, personality and cognitive profile). These domain shifts render multi-subject training a challenging task and impede robust cross-subject generalization. We build a two-stage model ensemble architecture and propose two objectives to train it, combining the strengths of curriculum learning and collaborative training. Our subject-independent experiments on the large datasets of Physionet and OpenBMI, verify the effectiveness of our approach. Next, we explore the utilization of the spatial covariance of EEG signals through alignment techniques, with the goal of learning domain-invariant representations. We introduce a Riemannian framework that concurrently performs covariance-based signal alignment and data augmentation, while training a convolutional neural network (CNN) on EEG time-series. Experiments on the BCI IV-2a dataset show that our method performs superiorly over traditional alignment, by inducing regularization to the weights of the CNN. We also study the problem of EEG-based affect recognition, inspired by works suggesting that emotions can be expressed in relative terms, i.e. through ordinal comparisons between different affective state levels. We propose treating data samples in a pairwise manner to infer the ordinal relation between their corresponding affective state labels, as an auxiliary training objective. We incorporate our objective in a deep network architecture which we jointly train on the tasks of sample-wise classification and pairwise ordinal ranking. We evaluate our method on the affective datasets of DEAP and SEED and obtain performance improvements over deep networks trained without the additional ranking objective
    • …
    corecore