Igor Chikalov

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

2019

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 146, Springer, ISBN: 978-3-319-91838-9, 2019

Decision Trees for Knowledge Representation (short paper).

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Concurrency, 2019

2018

Bi-criteria optimization of decision trees with applications to data analysis.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Bi-criteria optimization problems for decision rules.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

2016

Dynamic Programming Approach for Construction of Association Rule Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Totally optimal decision trees for Boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Decision trees with minimum average depth for sorting eight elements.

[BibT_eX]

[DOI]

Hassan AbouEisha

Discret. Appl. Math., 2016

2015

Three Approaches to Deal with Tests for Inconsistent Decision Tables - Comparative Study.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2015

Diagnosis of constant faults in read-once contact networks over finite bases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Multi-pruning of decision trees for knowledge representation and classification.

[BibT_eX]

[DOI]

Proceedings of the 3rd IAPR Asian Conference on Pattern Recognition, 2015

2014

Optimization of Decision Rules Based on Dynamic Programming Approach.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Intelligent Machines-4, 2014

Relationships between Average Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Relationships Between Length and Coverage of Decision Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Diagnosis of constant faults in iteration-free circuits over monotone basis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Decision Rule Classifiers for Multi-label Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, 2014

Comparison of Heuristics for Inhibitory Rule Optimization.

[BibT_eX]

[DOI]

Fawaz Alsolami

Mikhail Ju. Moshkov

Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

2013

Relationships for Cost and Uncertainty of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Dynamic Programming Approach for Exact Decision Rule Optimization.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Comparison of Greedy Algorithms for Decision Tree Optimization.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 41, Springer, ISBN: 978-3-642-28666-7, 2013

Dynamic programming approach to optimization of approximate decision rules.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Optimization and analysis of decision trees and rules: dynamic programming approach.

[BibT_eX]

[DOI]

Int. J. Gen. Syst., 2013

A Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions - A Comparative Study.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Classifiers Based on Optimal Decision Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Optimization of Decision Rule Complexity for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2013

Sequential Optimization of Approximate Inhibitory Rules Relative to the Length, Coverage and Number of Misclassifications.

[BibT_eX]

[DOI]

Fawaz Alsolami

Proceedings of the Rough Sets and Knowledge Technology - 8th International Conference, 2013

Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

Decision Rules, Trees and Tests for Tables with Many-valued Decisions-comparative Study.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

Optimization of Approximate Inhibitory Rules Relative to Number of Misclassifications.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

An algorithm for reduct cardinality minimization.

[BibT_eX]

[DOI]

Hassan AbouEisha

Mohammed A. Al Farhan

Proceedings of the 2013 IEEE International Conference on Granular Computing, 2013

2012

Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Dynamic Programming Approach for Partial Decision Rule Optimization.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Optimization of Inhibitory Decision Rules Relative to Length and Coverage.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 7th International Conference, 2012

Relationships between Number of Nodes and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2012

On Cost and Uncertainty of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2012

Optimization of Approximate Decision Rules Relative to Number of Misclassifications: Comparison of Greedy and Dynamic Programming Approaches.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Engineering, Machine Learning and Lattice Computing with Applications, 2012

Optimization of Approximate Decision Rules Relative to Number of Misclassifications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge-Based and Intelligent Information and Engineering Systems, 2012

Length and Coverage of Inhibitory Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

Tests for Decision Tables with Many-Valued Decisions - Comparative Study.

[BibT_eX]

[DOI]

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Average Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

Relationships Between Length and Coverage of Exact Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

2011

Average Time Complexity of Decision Trees

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 21, Springer, ISBN: 978-3-642-22660-1, 2011

Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2011

Learning Probabilistic Models of Hydrogen Bond Stability from Molecular Dynamics Simulation Trajectories.

[BibT_eX]

[DOI]

J. Intell. Learn. Syst. Appl., 2011

Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Decision Rules for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Beata Zielosko

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Constructing an Optimal Decision Tree for FAST Corner Point Detection.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Comparison of Greedy Algorithms for α-Decision Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Online Learning Algorithm for Ensemble of Decision Rules.

[BibT_eX]

[DOI]

Beata Zielosko

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Relationships between Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Comparison of Greedy Algorithms for Decision Tree Construction.

[BibT_eX]

Proceedings of the KDIR 2011, 2011

Sequential Optimization of Binary Search Trees for Multiple Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

A Tool for Study of Optimal Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Set and Knowledge Technology - 5th International Conference, 2010

Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts.

[BibT_eX]

[DOI]

Beata Zielosko

Proceedings of the Rough Sets and Current Trends in Computing, 2010

On Algorithm for Building of Optimal <i>alpha</i>-Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2010

2005

On Optimization of Decision Trees.

[BibT_eX]

[DOI]

Mikhail Ju. Moshkov

Maria S. Zelentsova

Trans. Rough Sets, 2005

2004

Consecutive Optimization of Decision Trees Concerning Various Complexity Measures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

Providing common I/O clock for wireless distributed platforms.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

Distributed array of synchronized sensors and actuators.

[BibT_eX]

[DOI]

Proceedings of the 2004 12th European Signal Processing Conference, 2004

2002

On Average Depth of Decision Trees Implementing Boolean Functions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

2000

On Algorithm for Constructing of Decision Trees with Minimal Depth.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2000

1999

On Average Time Complexity of Decision Trees and Branching Programs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

1998

On Decision Trees with Minimal Average Depth.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997

Bounds on Average Weighted Depth of Decision Trees.

[BibT_eX]

[DOI]