| 2009 |
|---|
| 50 | | Pawel Delimata,
Mikhail Ju. Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
Inhibitory Rules in Data Analysis: A Rough Set Approach
Springer 2009 |
| 2008 |
|---|
| 49 | EE | Mikhail Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
On Irreducible Descriptive Sets of Attributes for Information Systems.
RSCTC 2008: 21-30 |
| 48 | EE | 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 |
| 47 | EE | Mikhail Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
Maximal consistent extensions of information systems relative to their theories.
Inf. Sci. 178(12): 2600-2620 (2008) |
| 46 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
On Partial Covers, Reducts and Decision Rules.
T. Rough Sets 8: 251-288 (2008) |
| 45 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
Universal Problem of Attribute Reduction.
T. Rough Sets 9: 187-199 (2008) |
| 44 | EE | Mikhail Ju. Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
Extracting Relevant Information about Reduct Sets from Data Tables.
T. Rough Sets 9: 200-211 (2008) |
| 2007 |
|---|
| 43 | EE | Mikhail Ju. Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
On Covering Attribute Sets by Reducts.
RSEISP 2007: 175-180 |
| 42 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
Universal Attribute Reduction Problem.
RSEISP 2007: 417-426 |
| 41 | EE | Pawel Delimata,
Mikhail Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
Two Families of Classification Algorithms.
RSFDGrC 2007: 297-304 |
| 40 | EE | Mikhail Moshkov,
Marcin Piliszczuk:
Graphical Representation of Information on the Set of Reducts.
RSKT 2007: 372-378 |
| 39 | EE | Mikhail Ju. Moshkov:
On the class of restricted linear information systems.
Discrete Mathematics 307(22): 2837-2844 (2007) |
| 38 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
On Construction of Partial Reducts and Irreducible Partial Decision Rules.
Fundam. Inform. 75(1-4): 357-374 (2007) |
| 37 | EE | Mikhail Ju. Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
On Minimal Rule Sets for Almost All Binary Information Systems.
Fundam. Inform. 80(1-3): 247-258 (2007) |
| 36 | EE | Mikhail Ju. Moshkov:
On algorithms for construction of all irreducible partial covers.
Inf. Process. Lett. 103(2): 66-70 (2007) |
| 35 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
On Partial Covers, Reducts and Decision Rules with Weights.
T. Rough Sets 6: 211-246 (2007) |
| 2006 |
|---|
| 34 | EE | Mikhail Moshkov,
Andrzej Skowron,
Zbigniew Suraj:
On Testing Membership to Maximal Consistent Extensions of Information Systems.
RSCTC 2006: 85-90 |
| 33 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk,
Beata Zielosko:
Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules.
RSKT 2006: 290-296 |
| 2005 |
|---|
| 32 | | Mikhail Ju. Moshkov:
On Cardinality of Reducts for the Most Part of Binary Decision Tables.
IICAI 2005: 2404-2410 |
| 31 | | Mikhail Ju. Moshkov:
Restricted Linear Information Systems.
Intelligent Information Systems 2005: 561-564 |
| 30 | EE | Mikhail Ju. Moshkov,
Marcin Piliszczuk:
On Partial Tests and Partial Reducts for Decision Tables.
RSFDGrC (1) 2005: 149-155 |
| 29 | EE | Mikhail Ju. Moshkov:
On Construction of the Set of Irreducible Partial Covers.
SAGA 2005: 38-44 |
| 28 | EE | Mikhail Ju. Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach.
T. Rough Sets: 125-143 (2005) |
| 27 | EE | Igor Chikalov,
Mikhail Ju. Moshkov,
Maria S. Zelentsova:
On Optimization of Decision Trees.
T. Rough Sets: 18-36 (2005) |
| 26 | EE | Mikhail Ju. Moshkov:
Time Complexity of Decision Trees.
T. Rough Sets: 244-459 (2005) |
| 2004 |
|---|
| 25 | EE | 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 |
| 24 | EE | Mikhail Moshkov,
Igor Chikalov:
Consecutive Optimization of Decision Trees Concerning Various Complexity Measures.
Fundam. Inform. 61(2): 87-96 (2004) |
| 23 | EE | Mikhail Ju. Moshkov:
Greedy Algorithm of Decision Tree Construction for Real Data Tables.
T. Rough Sets: 161-168 (2004) |
| 2003 |
|---|
| 22 | EE | Mikhail Moshkov:
Approximate Algorithm for Minimization of Decision Tree Depth.
RSFDGrC 2003: 611-614 |
| 21 | EE | Mikhail Ju. Moshkov:
Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems.
Electr. Notes Theor. Comput. Sci. 82(4): (2003) |
| 20 | EE | Mikhail Ju. Moshkov:
Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems.
Fundam. Inform. 54(4): 345-368 (2003) |
| 19 | EE | Mikhail Ju. Moshkov:
Compressible Infinite Information Systems.
Fundam. Inform. 55(1): 51-61 (2003) |
| 2002 |
|---|
| 18 | EE | Mikhail Moshkov:
On Compressible Information Systems.
Rough Sets and Current Trends in Computing 2002: 156-160 |
| 17 | | Mikhail Moshkov:
On Decision Trees for (1, 2)-Bayesian Networks.
Fundam. Inform. 50(1): 57-76 (2002) |
| 2000 |
|---|
| 16 | EE | Mikhail Moshkov:
Classification of Infinite Information Systems.
Rough Sets and Current Trends in Computing 2000: 199-203 |
| 15 | | Mikhail Moshkov,
Igor Chikalov:
On Algorithm for Constructing of Decision Trees with Minimal Depth.
Fundam. Inform. 41(3): 295-299 (2000) |
| 14 | | Mikhail Moshkov:
Deterministic and Nondeterministic Decision Trees for Rough Computing.
Fundam. Inform. 41(3): 301-311 (2000) |
| 13 | | Mikhail Moshkov:
Decision Trees for Regular Language Word Recognition.
Fundam. Inform. 41(4): 449-461 (2000) |
| 1998 |
|---|
| 12 | EE | Mikhail Moshkov:
Some Relationships between Decision Trees and Decision Rule Systems.
Rough Sets and Current Trends in Computing 1998: 499-505 |
| 1997 |
|---|
| 11 | | Mikhail Moshkov:
Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition.
Developments in Language Theory 1997: 343-349 |
| 10 | | Mikhail Moshkov:
Algorithms for Constructing of Decision Trees.
PKDD 1997: 335-342 |
| 9 | | Mikhail Moshkov,
Igor Chikalov:
Bounds on Average Weighted Depth of Decision Trees.
Fundam. Inform. 31(2): 145-156 (1997) |
| 8 | | Mikhail Moshkov:
Unimprovable Upper Bounds on Time Complexity of Decision Trees.
Fundam. Inform. 31(2): 157-184 (1997) |
| 1996 |
|---|
| 7 | | Mikhail Moshkov:
Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity.
Fundam. Inform. 25(2): 201-214 (1996) |
| 6 | | Mikhail Moshkov:
Some Bounds on Minimal Decision Tree Depth.
Fundam. Inform. 27(2/3): 197-203 (1996) |
| 1995 |
|---|
| 5 | | Mikhail Moshkov:
Two Approaches to Investigation of Deterministic and Nondeterministic Decision Trees Complexity.
WOCFAI 1995: 275-280 |
| 4 | | Mikhail Moshkov:
About the Depth of Decision Trees Computing Boolean Functions.
Fundam. Inform. 22(3): 203-215 (1995) |
| 1994 |
|---|
| 3 | | Mikhail Moshkov:
Optimization Problems for Decision Trees.
Fundam. Inform. 21(4): 391-401 (1994) |
| 1993 |
|---|
| 2 | | Mikhail Moshkov:
Decision Trees for Decision Tables.
RSKD 1993: 335-342 |
| 1987 |
|---|
| 1 | | Mikhail Ju. Moshkov:
On the Programs with Finite Development.
FCT 1987: 323-327 |
