Wojciech Wieczorek

Prof. Wojciech Wieczorek

University of Bielsko-Biala
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 January 2017
Verified
Book
Closed access
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek

1 January 2016 in Computational and Mathematical Methods in Medicine
Verified
Journal Article
Open access
PDF file
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek
Olgierd UnoldOlgierd Unold
Olgierd Unold
The present paper is a novel contribution to the field of bioinformatics by using grammatical inference in the analysis of data. We developed an algorithm for generating star-free regular expressions which turned out to be good recommendation tools, as they are characterized by a relatively high correlation coefficient between the observed and predicted binary classifications. The experiments have been performed for three datasets of amyloidogenic hexapeptides, and our results are compared with those obtained using the graph approaches, the current state-of-the-art methods in heuristic automata induction, and the support vector machine. The results showed the superior performance of the new grammatical inference algorithm on fixed-length amyloid datasets.

14 December 2021 in Entropy
Verified
Journal Article
Open access
PDF file
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek
Jan KozakJan Kozak
Jan Kozak
ŁSŁukasz Strąk
Łukasz Strąk
ANArkadiusz Nowakowski
Arkadiusz Nowakowski
A new two-stage method for the construction of a decision tree is developed. The first stage is based on the definition of a minimum query set, which is the smallest set of attribute-value pairs for which any two objects can be distinguished. To obtain this set, an appropriate linear programming model is proposed. The queries from this set are building blocks of the second stage in which we try to find an optimal decision tree using a genetic algorithm. In a series of experiments, we show that for some databases, our approach should be considered as an alternative method to classical ones (CART, C4.5) and other heuristic approaches in terms of classification quality.

8 August 2009 in Logic Journal of the IGPL
Verified
Journal Article
Closed access
PDF file
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek
In this paper, an algorithm for the decomposition of a finite language is presented. The goal is to represent a finite language as a product (catenation) of two languages. This problem is thought to be intractable, although its NP-hardness has not been proven. The algorithm is based on checking through some subsets of the states of a minimal acyclic DFA. We also investigate two additional algorithms: the first is based on the use of integer linear programming, and the second is based on finding cliques in a graph. It appears that the latter approaches are inappropriate in terms of time consumption. The experiments have been performed for dozens of languages, and our results are reported.

15 January 2021 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
TJTomasz Jastrzab
Tomasz Jastrzab
ZCZbigniew J. Czech
Zbigniew J. Czech
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek
The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA that represents the target regular language is sought. We define the task of finding an NFA, which accepts all positive examples and rejects all negative ones, as a constraint satisfaction problem, and then propose the parallel algorithms to solve the problem. The results of comprehensive computational experiments on the variety of inference tasks are reported. The question of minimizing an NFA consistent with a learning sample is computationally hard.

1 January 2020
Verified
Conference Paper
Open access
OUOlgierd Unold
Olgierd Unold
MGMateusz Gabor
Mateusz Gabor
Wojciech WieczorekWojciech Wieczorek
Wojciech Wieczorek