default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail Ju. Moshkov
Mikhail Moshkov
Person information
- affiliation: King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Kerven Durdymyradov, Mikhail Moshkov
:
Bounds on depth of decision trees derived from decision rule systems with discrete attributes. Ann. Math. Artif. Intell. 92(3): 703-732 (2024)- [j76]Azimkhon Ostonov, Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes. Entropy 26(6): 519 (2024) - [c92]Kerven Durdymyradov, Mikhail Moshkov:
Modeling the Functioning of Decision Trees Based on Decision Rule Systems by Greedy Algorithm. ICCCI (2) 2024: 153-162 - [c91]Azimkhon Ostonov, Mikhail Moshkov:
Greedy Algorithm for Construction of Deterministic Decision Trees for Conventional Decision Tables from Closed Classes. IJCRS (1) 2024: 93-104 - [c90]Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. IJCRS (1) 2024: 173-187 - [c89]Kerven Durdymyradov, Mikhail Moshkov:
Simulating Functioning of Decision Trees for Tasks on Decision Rule Systems. IJCRS (1) 2024: 188-200 - [i17]Azimkhon Ostonov, Mikhail Moshkov:
Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes. CoRR abs/2401.01324 (2024) - [i16]Kerven Durdymyradov, Mikhail Moshkov:
Greedy Algorithm for Inference of Decision Trees from Decision Rule Systems. CoRR abs/2401.06793 (2024) - 2023
- [b8]Monther Busbait, Mikhail Moshkov, Albina Moshkova, Vladimir Shevtchenko:
Decision Trees for Fault Diagnosis in Circuits and Switching Networks. Springer 2023, ISBN 978-3-031-39030-2, pp. 1-117 - [j75]Mikhail Moshkov:
Time and space complexity of deterministic and nondeterministic decision trees. Ann. Math. Artif. Intell. 91(1): 45-74 (2023) - [j74]Mikhail Moshkov:
Decision Trees for Binary Subword-Closed Languages. Entropy 25(2): 349 (2023) - [j73]Mohammad Azad, Mikhail Moshkov:
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables. Entropy 25(4): 547 (2023) - [j72]Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes. Entropy 25(10): 1411 (2023) - [c88]Kerven Durdymyradov, Mikhail Moshkov:
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach. IEEE Big Data 2023: 6040-6045 - [c87]Beata Zielosko, Mikhail Moshkov, Anna Glid, Evans Teiko Tetteh:
Decision Rules Induced From Sets of Decision Trees. KES 2023: 4295-4304 - [c86]Azimkhon Ostonov, Mikhail Moshkov:
Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. IJCRS 2023: 89-104 - [i15]Mikhail Moshkov:
Diagnosis of Constant Faults in Switching Networks. CoRR abs/2302.02756 (2023) - [i14]Kerven Durdymyradov, Mikhail Moshkov:
Bounds on Depth of Decision Trees Derived from Decision Rule Systems. CoRR abs/2302.07063 (2023) - [i13]Azimkhon Ostonov, Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes. CoRR abs/2304.10594 (2023) - [i12]Kerven Durdymyradov, Mikhail Moshkov:
Construction of Decision Trees and Acyclic Decision Graphs from Decision Rule Systems. CoRR abs/2305.01721 (2023) - [i11]Azimkhon Ostonov, Mikhail Moshkov:
Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes. CoRR abs/2305.06093 (2023) - [i10]Kerven Durdymyradov, Mikhail Moshkov:
A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. CoRR abs/2311.17306 (2023) - [i9]Azimkhon Ostonov, Mikhail Moshkov:
Comparison of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes. CoRR abs/2312.01116 (2023) - 2022
- [j71]Mikhail Moshkov:
Decision trees for regular factorial languages. Array 15: 100203 (2022) - [j70]Mikhail Moshkov:
Rough analysis of computation trees. Discret. Appl. Math. 321: 90-108 (2022) - [j69]Mikhail Moshkov:
On the Depth of Decision Trees with Hypotheses. Entropy 24(1): 116 (2022) - [j68]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh:
Selected Data Mining Tools for Data Analysis in Distributed Environment. Entropy 24(10): 1401 (2022) - [c85]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh, Anna Glid:
Learning Decision Rules from Sets of Decision Trees. ISD 2022 - [c84]Mikhail Moshkov:
Common Decision Trees, Rules, and Tests (Reducts) for Dispersed Decision Tables. KES 2022: 2503-2507 - [c83]Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh:
Common Association Rules for Dispersed Information Systems. KES 2022: 4613-4620 - [i8]Mikhail Moshkov:
Rough analysis of computation trees. CoRR abs/2201.00311 (2022) - [i7]Mikhail Moshkov:
Time and space complexity of deterministic and nondeterministic decision trees. CoRR abs/2201.01013 (2022) - [i6]Mikhail Moshkov:
Decision trees for binary subword-closed languages. CoRR abs/2201.01493 (2022) - [i5]Mikhail Moshkov:
Decision trees for regular factorial languages. CoRR abs/2201.01952 (2022) - [i4]Mikhail Moshkov:
Exact learning and test theory. CoRR abs/2201.04506 (2022) - [i3]Mikhail Moshkov:
Exact learning for infinite families of concepts. CoRR abs/2201.08225 (2022) - [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
- [b7]Michal Mankowski, Mikhail Moshkov:
Dynamic Programming Multi-Objective Combinatorial Optimization. Springer 2021, ISBN 978-3-030-63919-8, pp. 1-210 - [j67]Vadim V. Lozin, Mikhail Moshkov:
Critical Properties and Complexity Measures of Read-Once Boolean Functions. Ann. Math. Artif. Intell. 89(5-6): 595-614 (2021) - [j66]Mikhail Moshkov:
On the depth of decision trees over infinite 1-homogeneous binary information systems. Array 10: 100060 (2021) - [j65]Mikhail Moshkov:
Decision trees based on 1-consequences. Discret. Appl. Math. 302: 208-214 (2021) - [j64]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses. Entropy 23(7): 808 (2021) - [j63]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko:
Decision Rules Derived from Optimal Decision Trees with Hypotheses. Entropy 23(12): 1641 (2021) - [c82]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sorting by Decision Trees with Hypotheses (extended abstract). CS&P 2021: 126-130 - [c81]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Minimizing Number of Nodes in Decision Trees with Hypotheses. KES 2021: 232-240 - [c80]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Minimizing Depth of Decision Trees with Hypotheses. IJCRS 2021: 123-133 - 2020
- [b6]Fawaz Alsolami, Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions. Intelligent Systems Reference Library 156, Springer 2020, ISBN 978-3-030-12853-1, pp. 1-269 - [j62]Michal Mankowski, Mikhail Moshkov:
Dynamic programming bi-criteria combinatorial optimization. Discret. Appl. Math. 284: 513-533 (2020) - [j61]Michal Mankowski, Mikhail Moshkov:
Extensions of dynamic programming for multi-stage combinatorial optimization. Theor. Comput. Sci. 844: 106-132 (2020) - [c79]Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Representation of Knowledge by Decision Trees for Decision Tables with Multiple Decisions. KES 2020: 653-659
2010 – 2019
- 2019
- [b5]Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library 146, Springer 2019, ISBN 978-3-319-91838-9, pp. 1-268 - [j60]Abdulla Aldilaijan, Mohammad Azad, Mikhail Moshkov:
Experimental Study of Totally Optimal Decision Trees. Fundam. Informaticae 165(3-4): 245-261 (2019) - [j59]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) - [c78]Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Decision Trees for Knowledge Representation (short paper). CS&P 2019 - [c77]Mohammad Azad, Mikhail Moshkov:
Experimental Study of Totally Optimal Decision Rules. ICAISC (2) 2019: 319-326 - 2018
- [j58]Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov:
Bi-criteria optimization problems for decision rules. Ann. Oper. Res. 271(2): 279-295 (2018) - [j57]Talha Amin, Mikhail Moshkov:
Totally optimal decision rules. Discret. Appl. Math. 236: 453-458 (2018) - [j56]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Bi-criteria optimization of decision trees with applications to data analysis. Eur. J. Oper. Res. 266(2): 689-701 (2018) - [c76]Hassan AbouEisha, Victor M. Calo, Konrad Jopek, Mikhail Moshkov, Anna Paszynska, Maciej Paszynski:
Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids. ICCS (2) 2018: 760-772 - 2017
- [j55]Hassan AbouEisha, Victor Manuel Calo, Konrad Jopek, Mikhail Moshkov, Anna Paszynska, Maciej Paszynski, Marcin Skotniczny:
Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming. Int. J. Appl. Math. Comput. Sci. 27(2): 351 (2017) - [j54]Mohammad Azad, Mikhail Moshkov:
Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions. Eur. J. Oper. Res. 263(3): 910-921 (2017) - [j53]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
WQO is decidable for factorial languages. Inf. Comput. 256: 321-333 (2017) - [c75]Michal Mankowski, Mikhail Moshkov:
Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange. IJCRS (1) 2017: 123-130 - [c74]Hassan AbouEisha, Mohammad Azad, Mikhail Moshkov:
On Importance of Rows for Decision Tables. IJCRS (1) 2017: 376-383 - 2016
- [j52]Hassan AbouEisha, Igor Chikalov, Mikhail Moshkov:
Decision trees with minimum average depth for sorting eight elements. Discret. Appl. Math. 204: 203-207 (2016) - [j51]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Totally optimal decision trees for Boolean functions. Discret. Appl. Math. 215: 1-13 (2016) - [j50]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) - [j49]Monther Busbait, Mikhail Moshkov:
Diagnosis of three types of constant faults in read-once contact networks over finite bases. Theor. Comput. Sci. 630: 26-42 (2016) - [j48]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) - [c73]Hassan AbouEisha, Konrad Jopek, Bartlomiej Medygral, Szymon Nosek, Mikhail Ju. Moshkov, Anna Paszynska, Maciej Paszynski, Keshav Pingali:
Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations. ICCS 2016: 865-874 - [c72]Mohammad Azad, Mikhail Ju. Moshkov:
Classification for Inconsistent Decision Tables. IJCRS 2016: 525-534 - 2015
- [j47]Monther Busbait, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov:
Diagnosis of constant faults in read-once contact networks over finite bases. Discret. Appl. Math. 184: 76-88 (2015) - [j46]Anna Paszynska, Maciej Paszynski, Konrad Jopek, Maciej Wozniak, Damian Goik, Piotr Gurgul, Hassan AbouEisha, Mikhail Moshkov, Victor Manuel Calo, Andrew Lenharth, Donald Nguyen, Keshav Pingali:
Quasi-Optimal Elimination Trees for 2D Grids with Singularities. Sci. Program. 2015: 303024:1-303024:18 (2015) - [j45]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) - [c71]Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Multi-pruning of decision trees for knowledge representation and classification. ACPR 2015: 604-608 - [c70]Mikhail Moshkov:
Dynamic Programming Approach for Study of Decision Trees. CS&P 2015: 1 - [c69]Fawaz Alsolami, Talha Amin, Mikhail Moshkov, Beata Zielosko:
Comparison of Heuristics for Optimization of Association Rules. CS&P 2015: 4-11 - [c68]Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Construction of Association Rule Systems. CS&P 2015: 12-21 - [c67]Mohammad Azad, Mikhail Moshkov:
Classification and optimization of decision trees for inconsistent decision tables represented as MVD tables. FedCSIS 2015: 31-38 - [c66]Hassan AbouEisha, Mikhail Ju. Moshkov, Konrad Jopek, Pawel Gepner, Jacek Kitowski, Maciej Paszynski:
Towards Green Multi-frontal Solver for Adaptive Finite Element Method. ICCS 2015: 984-993 - 2014
- [j44]Saad Alrawaf, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Diagnosis of constant faults in iteration-free circuits over monotone basis. Discret. Appl. Math. 166: 287-291 (2014) - [j43]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Relationships Between Length and Coverage of Decision Rules. Fundam. Informaticae 129(1-2): 1-13 (2014) - [j42]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships between Average Depth and Number of Misclassifications for Decision Trees. Fundam. Informaticae 129(1-2): 15-26 (2014) - [c65]Mohammad Azad, Mikhail Moshkov:
Minimizing Size of Decision Trees for Multi-label Decision Tables. FedCSIS 2014: 67-74 - [c64]Mohammad Azad, Mikhail Ju. Moshkov:
Minimization of decision tree depth for multi-label decision tables. GrC 2014: 7-12 - [c63]Mohammad Azad, Mikhail Ju. Moshkov:
‘Misclassification Error' Greedy Heuristic to Construct Decision Trees for Inconsistent Decision Tables. KDIR 2014: 184-191 - [c62]Hassan AbouEisha, Mikhail Moshkov, Victor M. Calo, Maciej Paszynski, Damian Goik, Konrad Jopek:
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids. ICCS 2014: 947-959 - [c61]Mohammad Azad, Mikhail Ju. Moshkov:
Minimization of Decision Tree Average Depth for Decision Tables with Many-valued Decisions. KES 2014: 368-377 - [c60]Fawaz Alsolami, Igor Chikalov, Mikhail Ju. Moshkov:
Comparison of Heuristics for Inhibitory Rule Optimization. KES 2014: 378-387 - [c59]Fawaz Alsolami, Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Decision Rule Classifiers for Multi-label Decision Tables. RSEISP 2014: 191-197 - [p4]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
- [b4]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 - [j41]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Classifiers Based on Optimal Decision Rules. Fundam. Informaticae 127(1-4): 151-160 (2013) - [j40]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) - [j39]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) - [j38]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic programming approach to optimization of approximate decision rules. Inf. Sci. 221: 403-418 (2013) - [c58]Hassan AbouEisha, Mohammed A. Al Farhan, Igor Chikalov, Mikhail Moshkov:
An algorithm for reduct cardinality minimization. GrC 2013: 1-3 - [c57]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 - [c56]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Approximate Inhibitory Rules Relative to Number of Misclassifications. KES 2013: 295-302 - [c55]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables. KES 2013: 359-365 - [c54]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages. LATA 2013: 68-79 - [c53]Hassan AbouEisha, Piotr Gurgul, Anna Paszynska, Maciek Paszynski, Krzysztof Kuznik, Mikhail Moshkov:
An Automatic Way of Finding Robust Elimination Trees for a Multi-frontal Sparse Solver for Radical 2D Hierarchical Meshes. PPAM (2) 2013: 531-540 - [c52]Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity. RSFDGrC 2013: 46-54 - [c51]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov:
Sequential Optimization of Approximate Inhibitory Rules Relative to the Length, Coverage and Number of Misclassifications. RSKT 2013: 154-165 - [c50]Mohammad Azad, Igor Chikalov, Mikhail Moshkov:
Optimization of Decision Rule Complexity for Decision Tables with Many-Valued Decisions. SMC 2013: 444-448 - [p3]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
Comparison of Greedy Algorithms for Decision Tree Optimization. Rough Sets and Intelligent Systems (2) 2013: 21-40 - [p2]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships for Cost and Uncertainty of Decision Trees. Rough Sets and Intelligent Systems (2) 2013: 203-222 - [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
- [j37]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Dynamic Programming Approach for Partial Decision Rule Optimization. Fundam. Informaticae 119(3-4): 233-248 (2012) - [j36]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) - [c49]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Relationships Between Length and Coverage of Exact Decision Rules. CS&P 2012: 1-12 - [c48]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 - [c47]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Average Depth and Number of Misclassifications for Decision Trees. CS&P 2012: 160-169 - [c46]Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Tests for Decision Tables with Many-Valued Decisions - Comparative Study. FedCSIS 2012: 271-277 - [c45]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Marta Zielosko:
Length and Coverage of Inhibitory Decision Rules. ICCCI (2) 2012: 325-334 - [c44]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 - [c43]Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Approximate Decision Rules Relative to Number of Misclassifications. KES 2012: 674-683 - [c42]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
On Cost and Uncertainty of Decision Trees. RSCTC 2012: 190-197 - [c41]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships between Number of Nodes and Number of Misclassifications for Decision Trees. RSCTC 2012: 212-218 - [c40]Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Optimization of Inhibitory Decision Rules Relative to Length and Coverage. RSKT 2012: 149-154 - 2011
- [b3]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 - [j35]Igor Chikalov, Peggy Yao, Mikhail Moshkov, Jean-Claude Latombe:
Learning probabilistic models of hydrogen bond stability from molecular dynamics simulation trajectories. BMC Bioinform. 12(S-1): S34 (2011) - [j34]Igor Chikalov, Peggy Yao, Mikhail Moshkov, Jean-Claude Latombe:
Learning Probabilistic Models of Hydrogen Bond Stability from Molecular Dynamics Simulation Trajectories. J. Intell. Learn. Syst. Appl. 3(3): 155-170 (2011) - [c39]Maram Alnafie, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov:
Sequential Optimization of Binary Search Trees for Multiple Cost Functions. CATS 2011: 41-44 - [c38]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
Comparison of Greedy Algorithms for Decision Tree Construction. KDIR 2011: 438-443 - [c37]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships between Depth and Number of Misclassifications for Decision Trees. RSFDGrC 2011: 286-292 - [c36]Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Online Learning Algorithm for Ensemble of Decision Rules. RSFDGrC 2011: 310-313 - [c35]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
Comparison of Greedy Algorithms for α-Decision Tree Construction. RSKT 2011: 178-186 - [c34]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
Constructing an Optimal Decision Tree for FAST Corner Point Detection. RSKT 2011: 187-194 - [c33]Mikhail Moshkov, Beata Zielosko:
Construction of α-Decision Trees for Tables with Many-Valued Decisions. RSKT 2011: 486-494 - [c32]Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. SOFSEM 2011: 157-165 - [c31]Jewahir AbuBekr, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions. ICCS 2011: 1272-1277 - 2010
- [j33]Mikhail Ju. Moshkov:
Greedy Algorithm with Weights for Decision Tree Construction. Fundam. Informaticae 104(3): 285-292 (2010) - [j32]Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj:
Irreducible Descriptive Sets of Attributes for Information Systems. Trans. Rough Sets 11: 92-105 (2010) - [j31]Pawel Delimata, Barbara Marszal-Paszek, Mikhail Moshkov, Piotr Paszek, Andrzej Skowron, Zbigniew Suraj:
Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules. Trans. Rough Sets 12: 90-105 (2010) - [c30]Igor Chikalov, Mikhail Moshkov, Beata Zielosko:
Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts. RSCTC 2010: 412-417 - [c29]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
On Algorithm for Building of Optimal alpha-Decision Trees. RSCTC 2010: 438-445 - [c28]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
A Tool for Study of Optimal Decision Trees. RSKT 2010: 353-360
2000 – 2009
- 2009
- [b2]Pawel Delimata, Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
Inhibitory Rules in Data Analysis: A Rough Set Approach. Studies in Computational Intelligence 163, Springer 2009, ISBN 978-3-540-85637-5 - [j30]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Greedy Algorithm for Construction of Partial Association Rules. Fundam. Informaticae 92(3): 259-277 (2009) - [j29]Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
On Minimal Inhibitory Rules for Almost All k-Valued Information Systems. Fundam. Informaticae 93(1-3): 261-272 (2009) - [j28]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Greedy Algorithms with Weights for Construction of Partial Association Rules. Fundam. Informaticae 94(1): 101-120 (2009) - [c27]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Construction of Partial Association Rules with Weights. ICMMI 2009: 229-237 - [c26]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] - [j27]Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj:
Maximal consistent extensions of information systems relative to their theories. Inf. Sci. 178(12): 2600-2620 (2008) - [j26]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Partial Covers, Reducts and Decision Rules. Trans. Rough Sets 8: 251-288 (2008) - [j25]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Universal Problem of Attribute Reduction. Trans. Rough Sets 9: 187-199 (2008) - [j24]Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
Extracting Relevant Information about Reduct Sets from Data Tables. Trans. Rough Sets 9: 200-211 (2008) - [c25]Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj:
On Irreducible Descriptive Sets of Attributes for Information Systems. RSCTC 2008: 21-30 - [c24]Pawel Delimata, Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules. RSKT 2008: 55-62 - 2007
- [j23]Mikhail Ju. Moshkov:
On the class of restricted linear information systems. Discret. Math. 307(22): 2837-2844 (2007) - [j22]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) - [j21]Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
On Minimal Rule Sets for Almost All Binary Information Systems. Fundam. Informaticae 80(1-3): 247-258 (2007) - [j20]Mikhail Ju. Moshkov:
On algorithms for construction of all irreducible partial covers. Inf. Process. Lett. 103(2): 66-70 (2007) - [j19]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Partial Covers, Reducts and Decision Rules with Weights. Trans. Rough Sets 6: 211-246 (2007) - [c23]Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj:
On Covering Attribute Sets by Reducts. RSEISP 2007: 175-180 - [c22]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Universal Attribute Reduction Problem. RSEISP 2007: 417-426 - [c21]Pawel Delimata, Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj:
Two Families of Classification Algorithms. RSFDGrC 2007: 297-304 - [c20]Mikhail Moshkov, Marcin Piliszczuk:
Graphical Representation of Information on the Set of Reducts. RSKT 2007: 372-378 - 2006
- [c19]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
On Greedy Algorithms with Weights for Construction of Partial Covers. Intelligent Information Systems 2006: 391-395 - [c18]Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj:
On Testing Membership to Maximal Consistent Extensions of Information Systems. RSCTC 2006: 85-90 - [c17]Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules. RSKT 2006: 290-296 - 2005
- [j18]Mikhail Ju. Moshkov:
Time Complexity of Decision Trees. Trans. Rough Sets 3: 244-459 (2005) - [j17]Igor Chikalov, Mikhail Ju. Moshkov, Maria S. Zelentsova:
On Optimization of Decision Trees. Trans. Rough Sets 4: 18-36 (2005) - [j16]Mikhail Ju. Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach. Trans. Rough Sets 4: 125-143 (2005) - [c16]Mikhail Ju. Moshkov:
On Cardinality of Reducts for the Most Part of Binary Decision Tables. IICAI 2005: 2404-2410 - [c15]Mikhail Ju. Moshkov:
Restricted Linear Information Systems. Intelligent Information Systems 2005: 561-564 - [c14]Mikhail Ju. Moshkov, Marcin Piliszczuk:
On Partial Tests and Partial Reducts for Decision Tables. RSFDGrC (1) 2005: 149-155 - [c13]Mikhail Ju. Moshkov:
On Construction of the Set of Irreducible Partial Covers. SAGA 2005: 38-44 - 2004
- [j15]Mikhail Moshkov, Igor Chikalov:
Consecutive Optimization of Decision Trees Concerning Various Complexity Measures. Fundam. Informaticae 61(2): 87-96 (2004) - [j14]Mikhail Ju. Moshkov:
Greedy Algorithm of Decision Tree Construction for Real Data Tables. Trans. Rough Sets 1: 161-168 (2004) - [c12]Mikhail Ju. Moshkov:
Decision Trees and Reducts for Distributed Decision Tables. MSRAS 2004: 239-248 - [c11]Mikhail Ju. Moshkov:
Greedy Algorithm for Decision Tree Construction in Context of Knowledge Discovery Problems. Rough Sets and Current Trends in Computing 2004: 192-197 - 2003
- [j13]Mikhail Ju. Moshkov:
Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems. Fundam. Informaticae 54(4): 345-368 (2003) - [j12]Mikhail Ju. Moshkov:
Compressible Infinite Information Systems. Fundam. Informaticae 55(1): 51-61 (2003) - [c10]Mikhail Moshkov:
Approximate Algorithm for Minimization of Decision Tree Depth. RSFDGrC 2003: 611-614 - [c9]Mikhail Ju. Moshkov:
Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems. RSKD 2003: 174-185 - 2002
- [j11]Mikhail Moshkov:
On Decision Trees for (1, 2)-Bayesian Networks. Fundam. Informaticae 50(1): 57-76 (2002) - [c8]Mikhail Moshkov:
On Compressible Information Systems. Rough Sets and Current Trends in Computing 2002: 156-160 - 2000
- [j10]Mikhail Moshkov, Igor Chikalov:
On Algorithm for Constructing of Decision Trees with Minimal Depth. Fundam. Informaticae 41(3): 295-299 (2000) - [j9]Mikhail Moshkov:
Deterministic and Nondeterministic Decision Trees for Rough Computing. Fundam. Informaticae 41(3): 301-311 (2000) - [j8]Mikhail Moshkov:
Decision Trees for Regular Language Word Recognition. Fundam. Informaticae 41(4): 449-461 (2000) - [c7]Mikhail Moshkov:
Classification of Infinite Information Systems. Rough Sets and Current Trends in Computing 2000: 199-203
1990 – 1999
- 1998
- [c6]Mikhail Moshkov:
Some Relationships between Decision Trees and Decision Rule Systems. Rough Sets and Current Trends in Computing 1998: 499-505 - 1997
- [j7]Mikhail Moshkov, Igor Chikalov:
Bounds on Average Weighted Depth of Decision Trees. Fundam. Informaticae 31(2): 145-156 (1997) - [j6]Mikhail Moshkov:
Unimprovable Upper Bounds on Time Complexity of Decision Trees. Fundam. Informaticae 31(2): 157-184 (1997) - [c5]Mikhail Moshkov:
Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition. Developments in Language Theory 1997: 343-349 - [c4]Mikhail Moshkov:
Algorithms for Constructing of Decision Trees. PKDD 1997: 335-342 - 1996
- [j5]Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity. Fundam. Informaticae 25(2): 201-214 (1996) - [j4]Mikhail Moshkov:
Some Bounds on Minimal Decision Tree Depth. Fundam. Informaticae 27(2/3): 197-203 (1996) - 1995
- [j3]Mikhail Moshkov:
Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic. Bull. EATCS 56 (1995) - [j2]Mikhail Moshkov:
About the Depth of Decision Trees Computing Boolean Functions. Fundam. Informaticae 22(3): 203-215 (1995) - [c3]Mikhail Moshkov:
Two Approaches to Investigation of Deterministic and Nondeterministic Decision Trees Complexity. WOCFAI 1995: 275-280 - 1994
- [j1]Mikhail Moshkov:
Optimization Problems for Decision Trees. Fundam. Informaticae 21(4): 391-401 (1994) - 1993
- [c2]Mikhail Moshkov:
Decision Trees for Decision Tables. RSKD 1993: 335-342
1980 – 1989
- 1987
- [c1]Mikhail Ju. Moshkov:
On the Programs with Finite Development. FCT 1987: 323-327
Coauthor Index
[i2] [i1] [j64] [j63] [c82] [c81] [c80] [b6] [c79] [b5] [c78] [j58] [j56] [j52] [j51] [j50] [j47] [j45] [c71] [c68] [j44] [j43] [j42] [c60] [c59] [p4] [b4] [j41] [j40] [j39] [j38] [c58] [c57] [c56] [c55] [c52] [c51] [c50] [p3] [p2] [p1] [j37] [j36] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [j35] [j34] [c39] [c38] [c37] [c36] [c35] [c34] [c32] [c31] [c30] [c29] [c28] [j17] [j15] [j10] [j7]
Beata Zielosko
aka: Beata Marta Zielosko
aka: Beata Marta Zielosko
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-04 20:01 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:
