Search

We statistically validated a sample of hot Neptune candidates applying a two-step vetting technique using dave and triceratops. We performed a systematic validation of 250 transit-like events in the Transiting Exoplanet Survey Satellite archive in the parameter region defined by P≤4d and 3R⊕≤R≤5R⊕⁠. Through our analysis, we identified 18 hot Neptune-sized candidates, with a false positive probability

Nowadays, satellite image time series (SITS) are commonly employed to derive land-cover maps (LCM) to support decision makers in a variety of land management applications. In the most general workflow, the production of LCM strongly relies on available GT data to train supervised machine learning models. Unfortunately, these data are not always available due to time-consuming and costly field campaigns. In this scenario, the possibility to transfer a model learnt on a particular year ( source domain ) to a successive period of time ( target domain ), over the same study area, can save time and money. Such a kind of model transfer is challenging due to different acquisition conditions affecting each time period, thus resulting in possible distribution shifts between source and target domains. In the general field of machine learning, unsupervised domain adaptation (UDA) approaches are well suited to cope with the learning of models under distribution shifts between source and target domains. While widely explored in the general computer vision field, they are still underinvestigated for SITS-based land-cover mapping, especially for the temporal transfer scenario. With the aim to cope with this scenario in the context of SITS-based land-cover mapping, here we propose spatially aligned domain-adversarial neural network, a framework that combines both adversarial learning and self-training to transfer a classification model from a time period (year) to a successive one on a specific study area. Experimental assessment on a study area located in Burkina Faso characterized by challenging operational constraints demonstrates the significance of our proposal. The obtained results have shown that our proposal outperforms all the UDA competing methods by 7 to 12 points of F 1-score across three different transfer tasks.

Huge amount of data are nowadays produced by a large and disparate family of sensors, which typically measure multiple variables over time. Such rich information can be profitably organized as multivariate time-series. Collect enough labelled samples to set up supervised analysis for such kind of data is challenging while a reasonable assumption is to dispose of a limited background knowledge that can be injected in the analysis process. In this context, semi-supervised clustering methods represent a well suited tool to get the most out of such reduced amount of knowledge. With the aim to deal with multivariate time-series analysis under a limited background knowledge setting, we propose a semi-supervised (constrained) deep embedding time-series clustering framework that exploits knowledge supervision modeled as Must- and Cannot-link constraints. More in detail, our proposal, named conDetSEC (constrained Deep embedding time SEries Clustering), is based on Gated Recurrent Units (GRUs) with the aim to explicitly manage the temporal dimension associated to multi-variate time series data. conDetSEC implements a procedure in which an embedding generation step is combined with a clustering refinement step. Both steps exploit the small amount of available knowledge provided by Must- and Cannot-link constraints. More specifically, during the data embedding generation the constraints are used by jointly optimizing the network parameters via both unsupervised and semi-supervised tasks, while at the refinement step they are used in conjunction with the goal to stretch the embedding manifold towards the clustering centroids to recover a more clear cluster structure. Experimental evaluation on real-world benchmarks coming from diverse domains has highlighted the effectiveness of our proposal in comparison with state-of-the-art unsupervised and semi-supervised time-series clustering methods.

Deep Learning algorithms have recently gained significant attention due to their impressive performance. However, their high complexity and un-interpretable mode of operation hinders their confident deployment in real-world safety-critical tasks. This work targets ante hoc interpretability, and specifically Concept Bottleneck Models (CBMs). Our goal is to design a framework that admits a highly interpretable decision making process with respect to human understandable concepts, on multiple levels of granularity. To this end, we propose a novel hierarchical concept discovery formulation leveraging: (i) recent advances in image-text models, and (ii) an innovative formulation for multi-level concept selection via data-driven and sparsity inducing Bayesian arguments. Within this framework, concept information does not solely rely on the similarity between the whole image and general unstructured concepts; instead, we introduce the notion of concept hierarchy to uncover and exploit more granular concept information residing in patch-specific regions of the image scene. As we experimentally show, the proposed construction not only outperforms recent CBM approaches, but also yields a principled framework towards interpetability.