Krzysztof Żabiński
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Krzysztof Żabiński has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Beata Zielosko
University of Silesia in Katowice
8 shared publications - Ksenia Shubenkova
Kazan Federal University, Kazan, Russia
3 shared publications - Irina Makarova
Naberezhnye Chelny Institute, Kazan Federal University, Mira Ave. 68/19, 423800 Naberezhnye Chelny, Russia
2 shared publications - Fawaz Alsolami
King Abdullah University of Science and Technology
1 shared publication - Mikhail Moshkov
King Abdullah University of Science and Technology (KAUST)
1 shared publication - Talha Amin
King Abdullah University of Science and Technology
1 shared publication
Latest Publications
- Open Access
Improved EAV-Based Algorithm for Decision Rules Construction
In this article, we present a modification of the algorithm based on EAV (entity–attribute–value) model, for induction of decision rules, utilizing novel approach for attribute ranking. The selection of attributes used as premises of decision rules, is an important stage of the process of rules induction. In the presented approach, this task is realized using ranking of attributes based on standard deviation of attributes’ values per decision classes, which is considered as a distinguishability level. The presented approach allows to work not only with numerical values of attributes but also with categorical ones. For this purpose, an additional step of data transformation into a matrix format has been proposed. It allows to transform data table into a binary one with proper equivalents of categorical values of attributes and ensures independence of the influence of the attribute selection function from the data type of variables. The motivation for the proposed method is the development of an algorithm which allows to construct rules close to optimal ones in terms of length, while maintaining enough good classification quality. The experiments presented in the paper have been performed on data sets from UCI ML Repository, comparing results of the proposed approach with three selected greedy heuristics for induction of decision rules, taking into consideration classification accuracy and length and support of constructed rules. The obtained results show that for the most part of datasests, the average length of rules obtained for 80% of best attributes from the ranking is very close to values obtained for the whole set of attributes. In case of classification accuracy, for 50% of considered datasets, results obtained for 80% of best attributes from the ranking are higher or the same as results obtained for the whole set of attributes.
Open AccessImproved EAV-Based Algorithm for Decision Rules Construction
In this article, we present a modification of the algorithm based on EAV (entity–attribute–value) model, for induction of decision rules, utilizing novel approach for attribute ranking. The selection of attributes used as premises of decision rules, is an important stage of the process of rules induction. In the presented approach, this task is realized using ranking of attributes based on standard deviation of attributes’ values per decision classes, which is considered as a distinguishability level. The presented approach allows to work not only with numerical values of attributes but also with categorical ones. For this purpose, an additional step of data transformation into a matrix format has been proposed. It allows to transform data table into a binary one with proper equivalents of categorical values of attributes and ensures independence of the influence of the attribute selection function from the data type of variables. The motivation for the proposed method is the development of an algorithm which allows to construct rules close to optimal ones in terms of length, while maintaining enough good classification quality. The experiments presented in the paper have been performed on data sets from UCI ML Repository, comparing results of the proposed approach with three selected greedy heuristics for induction of decision rules, taking into consideration classification accuracy and length and support of constructed rules. The obtained results show that for the most part of datasests, the average length of rules obtained for 80% of best attributes from the ranking is very close to values obtained for the whole set of attributes. In case of classification accuracy, for 50% of considered datasets, results obtained for 80% of best attributes from the ranking are higher or the same as results obtained for the whole set of attributes.
- Open Access
- 30 December 2021
- Published by Siec Badawcza Lukasiewicz - Przemyslowy Instytut Motoryzacji in The Archives of Automotive Engineering - Archiwum Motoryzacji
- Vol. 94 (4) , 27-37
Machine Vision in Autonomous Vehicles: Designing and Testing the Decision Making Algorithm Based on Entity Attribute Value Model
If we speak about the Smart City’s transport system, autonomous vehicles idea is the first thing that comes to mind. Today, it is strongly believed that the autonomous vehicles’ introduction into the traffic will increase the road safety. However, driverless cars are not the solution by itself. The road safety and, accordingly, sustainability will strongly depend on decision making algorithms inbuilt into the control module. Therefore, the goal of our research is to design and test the data mining algorithm based on Entity–Attribute–Value (EAV) model for decision making in the Intelligent System in the fully- or semi-autonomous vehicles. In this article, we describe the methodology to create 3 main modules of the designed Intelligent System: (1) an Object detection module; (2) a Data analysis module; (3) a Knowledge database built on decision rules generated with the help of our data mining algorithm. To build the Decision Table on the base of the real data, we have tested our algorithm on a simple collection of photos from a Polish two-lane road. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, our decision making algorithm thanks to excluding the mistakes made on the object detection stage, works faster than existing ones with the same level of correctness.
- 30 December 2021
- Published by Siec Badawcza Lukasiewicz - Przemyslowy Instytut Motoryzacji in The Archives of Automotive Engineering - Archiwum Motoryzacji
- Vol. 94 (4) , 27-37
Open AccessMachine Vision in Autonomous Vehicles: Designing and Testing the Decision Making Algorithm Based on Entity Attribute Value Model
If we speak about the Smart City’s transport system, autonomous vehicles idea is the first thing that comes to mind. Today, it is strongly believed that the autonomous vehicles’ introduction into the traffic will increase the road safety. However, driverless cars are not the solution by itself. The road safety and, accordingly, sustainability will strongly depend on decision making algorithms inbuilt into the control module. Therefore, the goal of our research is to design and test the data mining algorithm based on Entity–Attribute–Value (EAV) model for decision making in the Intelligent System in the fully- or semi-autonomous vehicles. In this article, we describe the methodology to create 3 main modules of the designed Intelligent System: (1) an Object detection module; (2) a Data analysis module; (3) a Knowledge database built on decision rules generated with the help of our data mining algorithm. To build the Decision Table on the base of the real data, we have tested our algorithm on a simple collection of photos from a Polish two-lane road. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, our decision making algorithm thanks to excluding the mistakes made on the object detection stage, works faster than existing ones with the same level of correctness.
- Open Access
- 1 January 2021
- Published by INSTICC
- p. 23-32
Risk Management of Infrastructure Projects as a Way to Ensure Sustainability of the Arctic Territories
- 1 January 2021
- Published by INSTICC
- p. 23-32
Open AccessRisk Management of Infrastructure Projects as a Way to Ensure Sustainability of the Arctic Territories
- Open Access
- 1 January 2021
- Published by Elsevier in Procedia Computer Science
- Vol. 192, 3667-3676
Selected approaches for decision rules construction-comparative study
- 1 January 2021
- Published by Elsevier in Procedia Computer Science
- Vol. 192, 3667-3676
Open AccessSelected approaches for decision rules construction-comparative study
- Open Access
Decision Rules Construction: Algorithm Based on EAV Model
In the paper, an approach for decision rules construction is proposed. It is studied from the point of view of the supervised machine learning task, i.e., classification, and from the point of view of knowledge representation. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, the proposed algorithm is based on transformation of decision table into entity–attribute–value (EAV) format. Additionally, standard deviation function for computation of averages’ values of attributes in particular decision classes was introduced. It allows to select from the whole set of attributes only these which provide the highest degree of information about the decision. Construction of decision rules is performed based on idea of partitioning of a decision table into corresponding subtables. In opposite to dynamic programming approach, not all attributes need to be taken into account but only these with the highest values of standard deviation per decision classes. Consequently, the proposed solution is more time efficient because of lower computational complexity. In the framework of experimental results, support and length of decision rules were computed and compared with the values of optimal rules. The classification error for data sets from UCI Machine Learning Repository was also obtained and compared with the ones for dynamic programming approach. Performed experiments show that constructed rules are not far from the optimal ones and classification results are comparable to these obtained in the framework of the dynamic programming extension.
Open AccessDecision Rules Construction: Algorithm Based on EAV Model
In the paper, an approach for decision rules construction is proposed. It is studied from the point of view of the supervised machine learning task, i.e., classification, and from the point of view of knowledge representation. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, the proposed algorithm is based on transformation of decision table into entity–attribute–value (EAV) format. Additionally, standard deviation function for computation of averages’ values of attributes in particular decision classes was introduced. It allows to select from the whole set of attributes only these which provide the highest degree of information about the decision. Construction of decision rules is performed based on idea of partitioning of a decision table into corresponding subtables. In opposite to dynamic programming approach, not all attributes need to be taken into account but only these with the highest values of standard deviation per decision classes. Consequently, the proposed solution is more time efficient because of lower computational complexity. In the framework of experimental results, support and length of decision rules were computed and compared with the values of optimal rules. The classification error for data sets from UCI Machine Learning Repository was also obtained and compared with the ones for dynamic programming approach. Performed experiments show that constructed rules are not far from the optimal ones and classification results are comparable to these obtained in the framework of the dynamic programming extension.
- 14 March 2019
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 166 (1) , 1-14
Comparison of Heuristics for Optimization of Association Rules
In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
- 14 March 2019
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 166 (1) , 1-14
Comparison of Heuristics for Optimization of Association Rules
In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
- 31 August 2018
- Published by Springer Nature
- p. 171-181
Optimization of Approximate Decision Rules Relative to Length
- 31 August 2018
- Published by Springer Nature
- p. 171-181
Optimization of Approximate Decision Rules Relative to Length
- 28 August 2018
- Published by Springer Nature
- p. 351-360
Optimization of Decision Rules Relative to Length - Comparative Study
- 28 August 2018
- Published by Springer Nature
- p. 351-360
Optimization of Decision Rules Relative to Length - Comparative Study
- 15 August 2018
- Published by Springer Nature
- p. 350-362
Application of Greedy Heuristics for Feature Characterisation and Selection: A Case Study in Stylometric Domain
- 15 August 2018
- Published by Springer Nature
- p. 350-362
Application of Greedy Heuristics for Feature Characterisation and Selection: A Case Study in Stylometric Domain