Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Łapa, Krystian" wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    On explainable fuzzy recommenders and their performance evaluation
    Autorzy:
    Rutkowski, Tomasz
    Łapa, Krystian
    Nielek, Radosław
    Powiązania:
    https://bibliotekanauki.pl/articles/330650.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    recommender system
    explainable recommendation
    fuzzy system
    Akaike information criterion
    system rekomendacyjny
    system rozmyty
    kryterium informacyjne Akaike
    Opis:
    This paper presents a novel approach to the design of explainable recommender systems. It is based on the Wang–Mendel algorithm of fuzzy rule generation. A method for the learning and reduction of the fuzzy recommender is proposed along with feature encoding. Three criteria, including the Akaike information criterion, are used for evaluating an optimal balance between recommender accuracy and interpretability. Simulation results verify the effectiveness of the presented recommender system and illustrate its performance on the MovieLens 10M dataset.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 3; 595-610
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new approach to detecting and preventing populations stagnation through dynamic changes in multi-population-based algorithms
    Autorzy:
    Łapa, Krystian
    Rutkowska, Danuta
    Byrski, Aleksander
    Napoli, Christian
    Powiązania:
    https://bibliotekanauki.pl/articles/23944836.pdf
    Data publikacji:
    2023
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    multi-population-based algorithms
    migration topologies
    population stagnation
    Opis:
    In this paper, a new mechanism for detecting population stagnation based on the analysis of the local improvement of the evaluation function and the infinite impulse response filter is proposed. The purpose of this mechanism is to improve the population stagnation detection capability for various optimization scenarios, and thus to improve multi-population-based algorithms (MPBAs) performance. In addition, various other approaches have been proposed to eliminate stagnation, including approaches aimed at both improving performance and reducing the complexity of the algorithms. The developed methods were tested, among the others, for various migration topologies and various MPBAs, including the MNIA algorithm, which allows the use of many different base algorithms and thus eliminates the need to select the population-based algorithm for a given simulation problem. The simulations were performed for typical benchmark functions and control problems. The obtained results confirm the validity of the developed method.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2023, 13, 4; 289--306
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    On-line signature partitioning using a population based algorithm
    Autorzy:
    Zalasiński, Marcin
    Łapa, Krystian
    Cpałka, Krzysztof
    Przybyszewski, Krzysztof
    Yen, Gary G.
    Powiązania:
    https://bibliotekanauki.pl/articles/91729.pdf
    Data publikacji:
    2020
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    on-line signature
    biometrics
    signature partitioning
    population-based algorithm
    podpis on-line
    biometria
    partycjonowanie sygnatur
    algorytm populacyjny
    Opis:
    The on-line signature is a biometric attribute which can be used for identity verification. It is a very useful characteristic because it is commonly accepted in societies across the world. However, the verification process using this particular biometric feature is a rather difficult one. Researchers working on identity verification involving the on-line signature might face various problems, including the different discriminative power of signature descriptors, the problem of a large number of descriptors, the problem of descriptor generation, etc. However, population-based algorithms (PBAs) can prove very useful when resolving these problems. Hence, we propose a new method for on-line signature partitioning using a PBA in order to improve the verification process effectiveness. Our method uses the Differential Evolution algorithm with a properly defined evaluation function for creating the most characteristic partitions of the dynamic signature. We present simulation results of the proposed method for the BioSecure DS2 database distributed by the BioSecure Association.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 1; 5-13
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-population-based algorithm with an exchange of training plans based on population evaluation
    Autorzy:
    Łapa, Krystian
    Cpałka, Krzysztof
    Kisiel-Dorohinicki, Marek
    Paszkowski, Józef
    Dębski, Maciej
    Le, Van-Hung
    Powiązania:
    https://bibliotekanauki.pl/articles/2147148.pdf
    Data publikacji:
    2022
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    population-based algorithm
    multi-population algorithm
    hybrid algorithm
    island algorithm
    subpopulation evaluation
    training plan
    Opis:
    Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 239--253
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies