Szymon Lukasik

Prof. Szymon Lukasik

AGH University of Krakow, Kraków, Małopolskie, Poland
+2
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2009
Verified
Book Chapter
Closed access
PDF file
Szymon LukasikSzymon Lukasik
Szymon Lukasik
SŻSławomir Żak
Sławomir Żak

1 January 2010
Verified
Book Chapter
Closed access
PDF file
Małgorzata CharytanowiczMałgorzata Charytanowicz
Małgorzata Charytanowicz
JNJerzy Niewczas
Jerzy Niewczas
PKPiotr Kulczycki
Piotr Kulczycki
Piotr A. KowalskiPiotr A. Kowalski
Piotr A. Kowalski
Szymon LukasikSzymon Lukasik
Szymon Lukasik
SŻSławomir Żak
Sławomir Żak

21 November 2016
Verified
Conference Paper
Closed access
Szymon LukasikSzymon Lukasik
Szymon Lukasik
Piotr A. KowalskiPiotr A. Kowalski
Piotr A. Kowalski
MCMalgorzata Charytanowicz
Malgorzata Charytanowicz
PKPiotr Kulczycki
Piotr Kulczycki
Task of clustering, that is data division into homogeneous groups represents one of the elementary problems of contemporary data mining. Cluster analysis can be approached through variety of methods based on statistical inference or heuristic techniques. Recently algorithms employing novel meta-heuristics are of special interest - as they can effectively tackle the problem under consideration which is known to be NP-hard. The paper studies the application of nature-inspired Flower Pollination Algorithm for clustering with internal measure of Calinski-Harabasz index being used as optimization criterion. Along with algorithm's description its performance is being evaluated over a set of benchmark instances and compared with the one of well-known K-means procedure. It is concluded that the application of introduced technique brings very promising outcomes. The discussion of obtained results is followed by areas of possible improvements and plans for further research.

1 September 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
AKAmbeshwar Kumar
Ambeshwar Kumar
MRManikandan Ramachandran
Manikandan Ramachandran
Amir H GandomiAmir H Gandomi
Amir H Gandomi
RPRIZWAN PATAN
RIZWAN PATAN
Szymon LukasikSzymon Lukasik
Szymon Lukasik
RSRavichandran Kattur Soundarapandian
Ravichandran Kattur Soundarapandian

25 August 2015 in Neural Processing Letters
Verified
Journal Article
Open access
PDF file
Piotr A. KowalskiPiotr A. Kowalski
Piotr A. Kowalski
Szymon LukasikSzymon Lukasik
Szymon Lukasik
In recent times, several new metaheuristic algorithms based on natural phenomena have been made available to researchers. One of these is that of the Krill Herd Algorithm (KHA) procedure. It contains many interesting mechanisms. The purpose of this article is to compare the KHA optimization algorithm used for learning an artificial neural network (ANN), with other heuristic methods and with more conventional procedures. The proposed ANN training method has been verified for the classification task. For that purpose benchmark examples drawn from the UCI Machine Learning Repository were employed with Classification Error and Sum of Square Errors being used as evaluation criteria. It has been concluded that the application of KHA offers promising performance—both in terms of aforementioned metrics, as well as time needed for ANN training.

24 September 2017 in Annals of Computer Science and Information Systems
Verified
Conference Paper
Closed access
Szymon LukasikSzymon Lukasik
Szymon Lukasik
Piotr A. KowalskiPiotr A. Kowalski
Piotr A. Kowalski
MCMałgorzata Charytanowicz
Małgorzata Charytanowicz
PKPiotr Kulczycki
Piotr Kulczycki