Search the digital library catalog

Abstract: 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.
Keywords: federated learning, agriculture, architecture, data partitioning, federation scal, aggregation algorithms, communication bottleneck
Published in DKUM: 05.06.2024; Views: 142; Downloads: 37
Full text (839,33 KB)
This document has many files! More...

Abstract: 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.
Keywords: networks, undirected graphs, community detection, node centrality, label propagation
Published in DKUM: 06.02.2024; Views: 335; Downloads: 27
Full text (707,65 KB)
This document has many files! More...

Abstract: Zaradi nedefiniranosti procesov odločanja globokih nevronskih mrež in njihovega dolgotrajnega učenja predstavlja določitev prenesenega znanja ključen izziv pri implementaciji učinkovite detekcije objektov na novih domenah. Preneseno znanje opredeljuje struktura plasti nevronske mreže, nad katerimi izgradimo nov model, ter izbira plasti, ki jim med učenjem zamrznemo vrednosti uteži. V magistrskem delu analiziramo vpliv števila zamrznjenih plasti na uspešnost učenja s prenosom znanja. V prvem delu opišemo tehnike prenosa znanja ter podamo formalno definicijo detekcije objektov, pri čemer opredelimo poznane metode in izpostavimo ključne izzive, povezane z njimi. Nato predstavimo izveden eksperiment, v katerem primerjamo uspešnost štirih konfiguracij pri prenosu znanja na modelu YOLOv4 na štiri različne ciljne domene. Ugotovimo, da so pri različnih ciljnih domenah uspešne različne konfiguracije, ki so odvisne od stopnje podobnosti izvorne in ciljne domene ter plasti izvornega modela, na kateri je določena značilka izluščena. Čeprav predstavljeni rezultati kažejo nemožnost predvidevanja optimalne konfiguracije prenosa znanja, izveden eksperiment nakazuje, da je učenje tudi v primeru neoptimalnega prenosa znanja uspešnejše od učenja brez prenosa znanja.
Keywords: učenje s prenosom znanja, prenos znanja, detekcija objektov, obdelava videoposnetkov, globoko učenje
Published in DKUM: 07.06.2022; Views: 1027; Downloads: 219
Full text (16,36 MB)