Search

Federated learning (FL), with the aim of training machine learning models using data and computational resources on edge devices without sharing raw local data, is essential for improving agricultural management and smart agriculture. This study is a review of FL applications that address various agricultural problems. We compare the types of data partitioning and types of FL (horizontal partitioning and horizontal FL, vertical partitioning and vertical FL, and hybrid partitioning and transfer FL), architectures (centralized and decentralized), levels of federation (cross-device and cross-silo), and the use of aggregation algorithms in different reviewed approaches and applications of FL in agriculture. We also briefly review how the communication challenge is solved by different approaches. This work is useful for gaining an overview of the FL techniques used in agriculture and the progress made in this field. [ABSTRACT FROM AUTHOR]

This paper proposes a new string transformation technique called Move with Interleaving (MwI). Four possible ways of rearranging 2D raster images into 1D sequences of values are applied, including scan-line, left-right, strip-based, and Hilbert arrangements. Experiments on 32 benchmark greyscale raster images of various resolutions demonstrated that the proposed transformation reduces information entropy to a similar extent as the combination of the Burrows–Wheeler transform followed by the Move-To-Front or the Inversion Frequencies. The proposed transformation MwI yields the best result among all the considered transformations when the Hilbert arrangement is applied. [ABSTRACT FROM AUTHOR]

One of the most important problems in complex networks is the location of nodes that are essential or play a main role in the network. Nodes with main local roles are the centers of real communities. Communities are sets of nodes of complex networks and are densely connected internally. Choosing the right nodes as seeds of the communities is crucial in determining real communities. We propose a new centrality measure named density-based entropy centrality for the local identification of the most important nodes. It measures the entropy of the sum of the sizes of the maximal cliques to which each node and its neighbor nodes belong. The proposed centrality is a local measure for explaining the local influence of each node, which provides an efficient way to locally identify the most important nodes and for community detection because communities are local structures. It can be computed independently for individual vertices, for large networks, and for not well-specified networks. The use of the proposed density-based entropy centrality for community seed selection and community detection outperforms other centrality measures. [ABSTRACT FROM AUTHOR]

This paper introduces a novel approach to increase the spatiotemporal resolution of an arbitrary environmental variable. This is achieved by utilizing machine learning algorithms to construct a satellite-like image at any given time moment, based on the measurements from IoT sensors. The target variables are calculated by an ensemble of regression models. The observed area is gridded, and partitioned into Voronoi cells based on the IoT sensors, whose measurements are available at the considered time. The pixels in each cell have a separate regression model, and take into account the measurements of the central and neighboring IoT sensors. The proposed approach was used to assess NO 2 data, which were obtained from the Sentinel-5 Precursor satellite and IoT ground sensors. The approach was tested with three different machine learning algorithms: 1-nearest neighbor, linear regression and a feed-forward neural network. The highest accuracy yield was from the prediction models built with the feed-forward neural network, with an R M S E of 15.49 × 10 − 6 mol/m 2 . [ABSTRACT FROM AUTHOR]

The paper reviews community detection methods used besides other partition algorithms for power grid partitioning. The power grid is a complex network. A complex network forms a community structure. There are many edges between community nodes and relatively few of those connecting the vertices of different communities. Community detection is an optimization problem. Its goal is to detect communities that belong to a network or graph in which nodes of a particular community in the same community share properties of the same characteristics or functional relationships. Power grids use adaptable community detection algorithms of various suitability rates used in power grid partitioning. The paper presents types and adaptations of various community detection algorithms used in power grid partitioning. [ABSTRACT FROM AUTHOR]

Copyright of Informatica is the property of IOS Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)