Temat: selection algorithm - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Evolutionary algorithm with a configurable search mechanism
Autorzy:: Łapa, Krystian
Cpałka, Krzysztof
Laskowski, Łukasz
Cader, Andrzej
Zeng, Zhigang
Powiązania:: https://bibliotekanauki.pl/articles/1837536.pdf
Data publikacji:: 2020
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: evolutionary algorithm
population-based algorithm
optimization
operator pool
operator selection
individual selection
Opis:: In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 151-171
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Parallel MCNN (PMCNN) with application to prototype selection on large and streaming data
Autorzy:: Devi, V. S.
Meena, L.
Powiązania:: https://bibliotekanauki.pl/articles/91686.pdf
Data publikacji:: 2017
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: prototype selection
one-pass algorithm
streaming data
distributed algorithm
Opis:: The Modified Condensed Nearest Neighbour (MCNN) algorithm for prototype selection is order-independent, unlike the Condensed Nearest Neighbour (CNN) algorithm. Though MCNN gives better performance, the time requirement is much higher than for CNN. To mitigate this, we propose a distributed approach called Parallel MCNN (pMCNN) which cuts down the time drastically while maintaining good performance. We have proposed two incremental algorithms using MCNN to carry out prototype selection on large and streaming data. The results of these algorithms using MCNN and pMCNN have been compared with an existing algorithm for streaming data.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2017, 7, 3; 155-169
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Evolutionary algorithm for selecting dynamic signatures partitioning approach
Autorzy:: Zalasiński, Marcin
Laskowski, Łukasz
Niksa-Rynkiewicz, Tacjana
Cpałka, Krzysztof
Byrski, Aleksander
Przybyszewski, Krzysztof
Trippner, Paweł
Dong, Shi
Powiązania:: https://bibliotekanauki.pl/articles/2147146.pdf
Data publikacji:: 2022
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: identity verification
dynamic signature
hybrid partitions
partitions’ selection
evolutionary algorithm
Opis:: In the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared. In this paper, we propose an approach that: (a) uses an evolutionary algorithm to create signature partitions in the time and velocity domains; (b) selects the most characteristic partitions in terms of matching with reference signatures; and (c) works individually for each user, eliminating the need of using skilled forgeries. The proposed approach was tested using Biosecure DS2 database which is a part of the DeepSignDB, a database with genuine dynamic signatures. Our simulations confirmed the correctness of the adopted assumptions.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 267--279
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "selection algorithm" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język