default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeata Zielosko
Beata Marta Zielosko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Urszula Stanczyk
, Beata Zielosko, Grzegorz Baron:
Importance of Characteristic Features and Their Form for Data Exploration. Entropy 26(5): 404 (2024)- 2023
- [j25]Krzysztof Zabinski, Beata Zielosko:
Improved EAV-Based Algorithm for Decision Rules Construction. Entropy 25(1): 91 (2023) - [c51]Beata Zielosko, Urszula Stanczyk, Kamil Jablonski:
Filtering Decision Rules Driven by Sequential Forward and Backward Selection of Attributes: An Illustrative Example in Stylometric Domain. FedCSIS 2023: 833-842 - [c50]Urszula Stanczyk, Beata Zielosko, Grzegorz Baron:
Attribute Relevance and Discretisation in Knowledge Discovery: A Study in Stylometric Domain. ICCS (2) 2023: 273-281 - [c49]Urszula Stanczyk, Beata Zielosko, Grzegorz Baron:
Going Deeper than Supervised Discretisation in Processing of Stylometric Features. ISD 2023 - [c48]Beata Zielosko, Mikhail Moshkov, Anna Glid, Evans Teiko Tetteh:
Decision Rules Induced From Sets of Decision Trees. KES 2023: 4295-4304 - [c47]Agata Hilarowicz, Beata Zielosko, Malgorzata Mysliwiec:
The Employers' Expectations Towards Students' Competencies In The Framework Of Digital Transformation Processes. KES 2023: 4521-4530 - [c46]Beata Zielosko, Evans Teiko Tetteh, Diana Hunchak:
Multi-heuristic Induction of Decision Rules. IJCRS 2023: 18-30 - 2022
- [j24]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh:
Selected Data Mining Tools for Data Analysis in Distributed Environment. Entropy 24(10): 1401 (2022) - [c45]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh, Anna Glid:
Learning Decision Rules from Sets of Decision Trees. ISD 2022 - [c44]Beata Zielosko, Urszula Stanczyk, Krzysztof Zabinski:
Ranking of attributes - comparative study based on data from stylometric domain. KES 2022: 2737-2746 - [c43]Beata Zielosko, Evans Teiko Tetteh:
Application of selected heuristics in associative classification task. KES 2022: 3271-3280 - [c42]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh:
Common Association Rules for Dispersed Information Systems. KES 2022: 4613-4620 - [i2]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Greedy Algorithms for Decision Trees with Hypotheses. CoRR abs/2203.08848 (2022) - [i1]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting. CoRR abs/2203.08894 (2022) - 2021
- [j23]Krzysztof Zabinski, Beata Zielosko:
Decision Rules Construction: Algorithm Based on EAV Model. Entropy 23(1): 14 (2021) - [j22]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Decision Rules Derived from Optimal Decision Trees with Hypotheses. Entropy 23(12): 1641 (2021) - [c41]Beata Zielosko, Krzysztof Zabinski:
Selected approaches for decision rules construction-comparative study. KES 2021: 3667-3676 - [c40]Beata Zielosko, Urszula Stanczyk:
Condition attributes, properties of decision rules, and discretisation: Analysis of relations and dependencies. KES 2021: 3922-3931 - 2020
- [j21]Urszula Stanczyk, Beata Zielosko:
Heuristic-based feature selection for rough set approach. Int. J. Approx. Reason. 125: 187-202 (2020) - [c39]Beata Zielosko, Urszula Stanczyk:
Reduct-based ranking of attributes. KES 2020: 2576-2585 - [c38]Urszula Stanczyk, Beata Zielosko:
Assessing quality of decision reducts. KES 2020: 3273-3282
2010 – 2019
- 2019
- [j20]Fawaz Alsolami, Talha Amin, Mikhail Moshkov, Beata Zielosko, Krzysztof Zabinski:
Comparison of Heuristics for Optimization of Association Rules. Fundam. Informaticae 166(1): 1-14 (2019) - [c37]Urszula Stanczyk, Beata Zielosko:
On Approaches to Discretisation of Stylometric Data and Conflict Resolution in Decision Making. KES 2019: 1811-1820 - 2018
- [c36]Beata Zielosko, Krzysztof Zabinski:
Optimization of Approximate Decision Rules Relative to Length. BDAS 2018: 171-181 - [c35]Urszula Stanczyk, Beata Zielosko, Krzysztof Zabinski:
Application of Greedy Heuristics for Feature Characterisation and Selection: A Case Study in Stylometric Domain. IJCSR 2018: 350-362 - [p4]Urszula Stanczyk, Beata Zielosko, Lakhmi C. Jain:
Advances in Feature Selection for Data and Pattern Recognition: An Introduction. Advances in Feature Selection for Data and Pattern Recognition 2018: 1-9 - [p3]Beata Zielosko, Krzysztof Zabinski:
Optimization of Decision Rules Relative to Length Based on Modified Dynamic Programming Approach. Advances in Feature Selection for Data and Pattern Recognition 2018: 73-93 - [e3]Urszula Stanczyk, Beata Zielosko, Lakhmi C. Jain:
Advances in Feature Selection for Data and Pattern Recognition. Intelligent Systems Reference Library 138, Springer 2018, ISBN 978-3-319-67587-9 [contents] - 2017
- [c34]Beata Zielosko:
Optimization of Exact Decision Rules Relative to Length. KES-IDT (1) 2017: 149-158 - [c33]Urszula Stanczyk, Beata Zielosko:
On Combining Discretisation Parameters and Attribute Ranking for Selection of Decision Rules. IJCRS (1) 2017: 329-349 - [e2]Lech Polkowski, Yiyu Yao, Piotr Artiemjew, Davide Ciucci, Dun Liu, Dominik Slezak, Beata Zielosko:
Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10313, Springer 2017, ISBN 978-3-319-60836-5 [contents] - [e1]Lech Polkowski, Yiyu Yao, Piotr Artiemjew, Davide Ciucci, Dun Liu, Dominik Slezak, Beata Zielosko:
Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10314, Springer 2017, ISBN 978-3-319-60839-6 [contents] - 2016
- [j19]Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Construction of Association Rule Systems. Fundam. Informaticae 147(2-3): 159-171 (2016) - [j18]Beata Zielosko:
Application of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length. Fundam. Informaticae 148(1-2): 87-105 (2016) - [j17]Mohammad Azad, Mikhail Ju. Moshkov, Beata Zielosko:
Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions. Trans. Rough Sets 20: 24-50 (2016) - [c32]Beata Zielosko, Marek Robaszkiewicz:
Greedy Algorithm for Optimization of Association Rules Relative to Length. KES-IDT (1) 2016: 281-292 - 2015
- [j16]Mohammad Azad, Igor Chikalov, Mikhail Ju. Moshkov, Beata Zielosko:
Three Approaches to Deal with Tests for Inconsistent Decision Tables - Comparative Study. Trans. Rough Sets 19: 38-50 (2015) - [j15]Beata Zielosko:
Sequential Optimization of γ-Decision Rules Relative to Length, Coverage and Number of Misclassifications. Trans. Rough Sets 19: 65-82 (2015) - [c31]Beata Zielosko:
Optimization of Inhibitory Decision Rules Relative to Coverage - Comparative Study. BDAS 2015: 267-276 - [c30]Fawaz Alsolami, Talha Amin, Mikhail Moshkov, Beata Zielosko:
Comparison of Heuristics for Optimization of Association Rules. CS&P 2015: 4-11 - [c29]Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Construction of Association Rule Systems. CS&P 2015: 12-21 - [c28]Beata Zielosko:
Global Optimization of Exact Association Rules Relative to Length. CS&P 2015: 237-247 - [c27]Beata Zielosko:
Optimization of Decision Rules Relative to Coverage - Comparison of Greedy and Modified Dynamic Programming Approaches. ICMMI 2015: 639-650 - [c26]Beata Zielosko:
Global Optimization of Exact Association Rules Relative to Coverage. PReMI 2015: 428-437 - 2014
- [j14]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Relationships Between Length and Coverage of Decision Rules. Fundam. Informaticae 129(1-2): 1-13 (2014) - [c25]Beata Zielosko:
Optimization of Approximate Decision Rules Relative to Coverage. BDAS 2014: 170-179 - [c24]Beata Zielosko:
Optimization of Decision Rules Relative to Coverage - Comparative Study. RSEISP 2014: 237-247 - [p2]Beata Zielosko, Igor Chikalov, Mikhail Moshkov, Talha Amin:
Optimization of Decision Rules Based on Dynamic Programming Approach. Innovations in Intelligent Machines (4) 2014: 369-392 - 2013
- [b3]Igor Chikalov, Vadim V. Lozin, Irina Lozina, Mikhail Moshkov, Hung Son Nguyen, Andrzej Skowron, Beata Zielosko:
Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data. Intelligent Systems Reference Library 41, Springer 2013, ISBN 978-3-642-28666-7, pp. 3-192 - [j13]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Classifiers Based on Optimal Decision Rules. Fundam. Informaticae 127(1-4): 151-160 (2013) - [j12]Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
A Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions - A Comparative Study. Fundam. Informaticae 128(1-2): 1-15 (2013) - [j11]Abdulaziz Alkhalid, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6): 614-634 (2013) - [j10]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic programming approach to optimization of approximate decision rules. Inf. Sci. 221: 403-418 (2013) - [c23]Mohammad Azad, Beata Zielosko, Mikhail Moshkov, Igor Chikalov:
Decision Rules, Trees and Tests for Tables with Many-valued Decisions-comparative Study. KES 2013: 87-94 - [c22]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Approximate Inhibitory Rules Relative to Number of Misclassifications. KES 2013: 295-302 - [p1]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Exact Decision Rule Optimization. Rough Sets and Intelligent Systems (1) 2013: 211-228 - 2012
- [j9]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Partial Decision Rule Optimization. Fundam. Informaticae 119(3-4): 233-248 (2012) - [j8]Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions. Fundam. Informaticae 120(3-4): 231-242 (2012) - [c21]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Relationships Between Length and Coverage of Exact Decision Rules. CS&P 2012: 1-12 - [c20]Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions. CS&P 2012: 13-24 - [c19]Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Tests for Decision Tables with Many-Valued Decisions - Comparative Study. FedCSIS 2012: 271-277 - [c18]Beata Zielosko:
Sequential Optimization of γ-Decision Rules. FedCSIS 2012: 339-346 - [c17]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Marta Zielosko:
Length and Coverage of Inhibitory Decision Rules. ICCCI (2) 2012: 325-334 - [c16]Beata Marta Zielosko:
Optimization of β-Decision Rules Relative to Number of Misclassifications. ICCCI (2) 2012: 345-354 - [c15]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Approximate Decision Rules Relative to Number of Misclassifications: Comparison of Greedy and Dynamic Programming Approaches. KES (Selected Papers) 2012: 41-50 - [c14]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Approximate Decision Rules Relative to Number of Misclassifications. KES 2012: 674-683 - [c13]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Inhibitory Decision Rules Relative to Length and Coverage. RSKT 2012: 149-154 - 2011
- [b2]Mikhail Moshkov, Beata Zielosko:
Combinatorial Machine Learning - A Rough Set Approach. Studies in Computational Intelligence 360, Springer 2011, ISBN 978-3-642-20994-9, pp. 1-170 - [c12]Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Online Learning Algorithm for Ensemble of Decision Rules. RSFDGrC 2011: 310-313 - [c11]Mikhail Moshkov, Beata Zielosko:
Construction of α-Decision Trees for Tables with Many-Valued Decisions. RSKT 2011: 486-494 - [c10]Igor Chikalov, Beata Zielosko:
Decision Rules for Decision Tables with Many-Valued Decisions. RSKT 2011: 763-768 - 2010
- [c9]Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts. RSCTC 2010: 412-417
2000 – 2009
- 2009
- [j7]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Greedy Algorithm for Construction of Partial Association Rules. Fundam. Informaticae 92(3): 259-277 (2009) - [j6]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Greedy Algorithms with Weights for Construction of Partial Association Rules. Fundam. Informaticae 94(1): 101-120 (2009) - [c8]Agnieszka Nowak, Beata Zielosko:
Clustering of Partial Decision Rules. ICMMI 2009: 183-190 - [c7]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Construction of Partial Association Rules with Weights. ICMMI 2009: 229-237 - [c6]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Construction of Partial Association Rules. RSKT 2009: 176-183 - 2008
- [b1]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications. Studies in Computational Intelligence 145, Springer 2008, ISBN 978-3-540-69027-6, pp. 1-142 [contents] - [j5]Beata Zielosko, Marcin Piliszczuk:
Greedy Algorithm for Attribute Reduction. Fundam. Informaticae 85(1-4): 549-561 (2008) - [j4]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Partial Covers, Reducts and Decision Rules. Trans. Rough Sets 8: 251-288 (2008) - [j3]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Universal Problem of Attribute Reduction. Trans. Rough Sets 9: 187-199 (2008) - 2007
- [j2]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Construction of Partial Reducts and Irreducible Partial Decision Rules. Fundam. Informaticae 75(1-4): 357-374 (2007) - [j1]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Partial Covers, Reducts and Decision Rules with Weights. Trans. Rough Sets 6: 211-246 (2007) - [c5]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Universal Attribute Reduction Problem. RSEISP 2007: 417-426 - 2006
- [c4]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Greedy Algorithms with Weights for Construction of Partial Covers. Intelligent Information Systems 2006: 391-395 - [c3]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules. RSKT 2006: 290-296 - 2005
- [c2]Beata Zielosko, Alicja Wakulicz-Deja:
Intelligent Data Processing in Distributed Internet Applications. Intelligent Information Systems 2005: 585-592 - 2004
- [c1]Beata Zielosko, Andrzej Jan Dyszkiewicz:
Intelligent Medical Systems on Internet Technologies Platform. MSRAS 2004: 589-594
Coauthor Index
Mikhail Ju. Moshkov
aka: Mikhail Moshkov
aka: Mikhail Moshkov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
