Tuber melanosporum (Ascomycota, Pezizales) is an ectomycorrhizal fungus that produces highly appreciated hypogeous fruiting bodies called black truffles. The aim of this paper was to research the composition of ectomycorrhiza-associated fungal and bacterial communities in T. melanosporum oak plantations. Results of this paper showed the competitive effect of T. melanosporum on other fungal species, especially other mycorrhizal and pathogenic species. T. melanosporum was shown to be associated mainly with bacteria, some of them important for their properties as mycorrhizal helper bacteria. A dendrogram analysis of co-occurrence showed that T. melanosporum tended to co-occur with the following bacteria species: Singulisphaera limicola, Nannocistis excedens and Sporosarcina globispora. In addition, it was linked to fungal species such as Mortierella elongata, M. minutissima, Cryptococcus uzbekistanensis, C. chernovii and C.aerius. This study provides an exhaustive analysis of the diversity, structure and composition of fungal and bacterial communities associated with T. melanosporum to enhance understanding of the biology, composition and role of these communities in truffle plantations.
We propose to embed time series in a latent space where pairwise Euclidean distances (EDs) between samples are equal to pairwise dissimilarities in the original space, for a given dissimilarity measure. To this end, we use auto-encoder (AE) and encoder-only neural networks to learn elastic dissimilarity measures, e.g., dynamic time warping (DTW), that are central to time series classification (Bagnall et al., 2017). The learned representations are used in the context of one-class classification (Mauceri et al., 2020) on the datasets of UCR/UEA archive (Dau et al., 2019). Using a 1-nearest neighbor (1NN) classifier, we show that learned representations allow classification performance that is close to that of raw data, but in a space of substantially lower dimensionality. This implies substantial and compelling savings in terms of computational and storage requirements for nearest neighbor time series classification.
23 April 2021 in Genetic Programming and Evolvable Machines
When dealing with a new time series classification problem, modellers do not know in advance which features could enable the best classification performance. We propose an evolutionary algorithm based on grammatical evolution to attain a data-driven feature-based representation of time series with minimal human intervention. The proposed algorithm can select both the features to extract and the sub-sequences from which to extract them. These choices not only impact classification performance but also allow understanding of the problem at hand. The algorithm is tested on 30 problems outperforming several benchmarks. Finally, in a case study related to subject authentication, we show how features learned for a given subject are able to generalise to subjects unseen during the extraction phase.
Knowledge Graph (KG) Construction is the prerequisite for all other KG research and applications. Researchers and engineers have proposed various approaches to build KGs for their use cases. However, how can we know whether our constructed KG is good or bad? Is it correct and complete? Is it consistent and robust? In this paper, we propose a method called LP-Measure to assess the quality of a KG via a link prediction tasks, without using a gold standard or other human labour. Though theoretically, the LP-Measure can only assess consistency and redundancy, instead of the more desirable correctness and completeness, empirical evidence shows that this measurement method can quantitatively distinguish the good KGs from the bad ones, even in terms of incorrectness and incompleteness. Compared with the most commonly used manual assessment, our LP-Measure is an automated evaluation, which saves time and human labour.