In recent times, pollution has emerged as a significant global concern, with European regulations stipulating limits on PM 2.5 particle levels. Addressing this challenge necessitates innovative approaches. Smart low-cost sensors suffer from imprecision, and can not replace legal stations in terms of accuracy, however, their potential to amplify the capillarity of air quality evaluation on the territory is not under discussion. In this paper, we propose an AI system to correct PM 2.5 levels in low-cost sensor data. Our research focuses on data from Turin, Italy, emphasizing the impact of humidity on low-cost sensor accuracy. In this study, different Neural Network architectures that vary the number of neurons per layer, consecutive records and batch sizes were used and compared to gain a deeper understanding of the network’s performance under various conditions. The AirMLP7-1500 model, with an impressive R-squared score of 0.932, stands out for its ability to correct PM 2.5 measurements. While our approach is tailored to the city of Turin, it offers a systematic methodology for the definition of those models and holds the promise to significantly improve the accuracy of air quality data collected from low-cost sensors, increasing the awareness of citizens and municipalities about this critical environmental information.

In many complex systems one observes the formation of medium-level structures, whose detection could allow a high-level description of the dynamical organization of the system itself, and thus to its better understanding. We have developed in the past a powerful method to achieve this goal, which however requires a heavy computational cost in several real-world cases. In this work we introduce a modified version of our approach, which reduces the computational burden. The design of the new algorithm allowed the realization of an original suite of methods able to work simultaneously at the micro level (that of the binary relationships of the single variables) and at meso level (the identification of dynamically relevant groups). We apply this suite to a particularly relevant case, in which we look for the dynamic organization of a gene regulatory network when it is subject to knock-outs. The approach combines information theory, graph analysis, and an iterated sieving algorithm in order to describe rather complex situations. Its application allowed to derive some general observations on the dynamical organization of gene regulatory networks, and to observe interesting characteristics in an experimental case.