Cited by 65Privacy-Preserving Technologies in DataMetaheuristic Optimization Algorithms ResearchMachine Learning and Data Classification

Meta-heuristic as manager in federated learning approaches for image processing purposes

Open access
Połap, Dawid, Woźniak, Marcin·2021·Applied Soft Computing

Abstract

The new form of artificial intelligence training, i.e. federated learning, is becoming more popular in the last few years. It is an optimization problem that includes additional mechanisms such as aggregation and data transmission. In this paper, we propose a hybridization of this type of training with a meta-heuristic. The meta-heuristic algorithm is adapted to manage the entire process as well as to analyze the best models to minimize attacks on this type of collaboration. The proposed solution is based on minimizing the general model error, with additional control mechanisms for incoming models, or adapting the aggregation method depending on the quality of the model. The innovative solution has been analyzed in terms of its application to the problem of image classification using classical and convolutional neural networks, and the most popular meta-heuristic algorithms. The proposal was analyzed in terms of the accuracy of the general model as well as for security against poisoning attacks. We reached 91% of accuracy using the proposed method with the Red Fox Optimization Algorithm and 95% in terms of detection of poisoned samples in the database.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.asoc.2021.107872

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Polap and their team published three research papers [17], [19], [22], all focused on skin cancer detection with FL.

    “Researcher Polap and their team have published three research papers [17], [19], [22], all of them focused on skin cancer detection with the FL environment.”
  • Six reviewed papers [17], [19], [22], [23], [29], [30] used more than 10,000 images individually.

    “Finally, we found six papers [17], [19], [22], [23], [29], [30] all of them have used more than 10,000 images individually.”
  • Połap and the groups used the MNIST: HAM10000 dataset in a series of articles [17], [19], [22] with FL environment.

    “Połap and the groups used the dataset in a series of articles [17], [19], [22] with FL environment.”
  • Inception was used in [17], [19], and [22]; AlexNet in [17] and [19].

    “Other pre-trained CNN models are Inception ( [17], [19], [22]), AlexNet ( [17], [19]).”
  • Połap and Woźniak [19] proposed a meta-heuristic search based federated model that calculated average loss of all local models and selected only models scoring higher than average loss for server aggregation.

    “Połap and Woźniak [19] proposed a meta-heuristic search based federated model, first they calculated average loss of all local models and then selected only models that have scored higher than the average loss for aggregation in server.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

1 of the 52 references couldn’t be matched to a known paper.

Research works printed but not linked: 2

  1. H.T. Jongen, K. Meer, E. Triesch, Optimization Theory, Springer Science & Business Media, 2007.
  2. M. Fang, X. Cao, J. Jia, N. Gong, Local model poisoning attacks to Byzantine- robust federated learning, in: 29th {USENIX} Security Symposium, {USENIX} Security 20, 2020, pp. 1605-1622.

Cited by

Sorted by citations

Authors
Połap, D., & Woźniak, M.
Affiliations
Silesian University of Technology (PL)
Corresponding author
Połap, Dawid
Venue
Applied Soft Computing
Publisher
Elsevier BV
Published
2021-12
Volume
113
Pages
107872
ISSN
1568-4946 (ISSN-L)
OpenAlex
W3198908542
Cited by
65
References
52
Citations by year
2026: 3 · 2025: 11 · 2024: 13 · 2023: 17 · 2022: 20 · 2021: 1
FWCI
4.51
Type
journal article
Language
en
Open access
Locations
Applied Soft Computing (publishedVersion, cc-by)
Funders
  • Silesian University of Technology (BKM-512/RMS2/2021)
  • Narodowa Agencja Wymiany Akademickiej (PPI/PRO/2019/1/00051)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
federated learning, metaheuristic optimization, model aggregation, poisoning attacks, image classification, convolutional neural networks, model selection, poisoning detection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review