The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mikhail Moshkov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikhail Moshkov
    Algorithms for Constructing of Decision Trees. [Citation Graph (0, 0)][DBLP]
    PKDD, 1997, pp:335-342 [Conf]
  2. Mikhail Moshkov
    Classification of Infinite Information Systems. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 2000, pp:199-203 [Conf]
  3. Mikhail Moshkov
    On Compressible Information Systems. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 2002, pp:156-160 [Conf]
  4. Mikhail Moshkov
    Decision Trees for Decision Tables. [Citation Graph (0, 0)][DBLP]
    RSKD, 1993, pp:335-342 [Conf]
  5. Mikhail Moshkov
    Some Relationships between Decision Trees and Decision Rule Systems. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 1998, pp:499-505 [Conf]
  6. Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj
    On Testing Membership to Maximal Consistent Extensions of Information Systems. [Citation Graph (0, 0)][DBLP]
    RSCTC, 2006, pp:85-90 [Conf]
  7. Mikhail Moshkov
    Approximate Algorithm for Minimization of Decision Tree Depth. [Citation Graph (0, 0)][DBLP]
    RSFDGrC, 2003, pp:611-614 [Conf]
  8. Mikhail Moshkov
    Two Approaches to Investigation of Deterministic and Nondeterministic Decision Trees Complexity. [Citation Graph (0, 0)][DBLP]
    WOCFAI, 1995, pp:275-280 [Conf]
  9. Mikhail Moshkov
    Deterministic and Nondeterministic Decision Trees for Rough Computing. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:41, n:3, pp:301-311 [Journal]
  10. Mikhail Moshkov
    Decision Trees for Regular Language Word Recognition. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:41, n:4, pp:449-461 [Journal]
  11. Mikhail Moshkov
    On Decision Trees for (1, 2)-Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:1, pp:57-76 [Journal]
  12. Mikhail Moshkov
    Optimization Problems for Decision Trees. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:4, pp:391-401 [Journal]
  13. Mikhail Moshkov
    About the Depth of Decision Trees Computing Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:3, pp:203-215 [Journal]
  14. Mikhail Moshkov
    Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:2, pp:201-214 [Journal]
  15. Mikhail Moshkov
    Unimprovable Upper Bounds on Time Complexity of Decision Trees. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:2, pp:157-184 [Journal]
  16. Mikhail Moshkov, Igor Chikalov
    On Algorithm for Constructing of Decision Trees with Minimal Depth. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:41, n:3, pp:295-299 [Journal]
  17. Mikhail Moshkov, Igor Chikalov
    Consecutive Optimization of Decision Trees Concerning Various Complexity Measures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:61, n:2, pp:87-96 [Journal]
  18. Mikhail Moshkov, Igor Chikalov
    Bounds on Average Weighted Depth of Decision Trees. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:2, pp:145-156 [Journal]
  19. Mikhail Moshkov
    Some Bounds on Minimal Decision Tree Depth. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:27, n:2/3, pp:197-203 [Journal]
  20. Pawel Delimata, Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj
    Two Families of Classification Algorithms. [Citation Graph (0, 0)][DBLP]
    RSFDGrC, 2007, pp:297-304 [Conf]
  21. Mikhail Moshkov, Marcin Piliszczuk
    Graphical Representation of Information on the Set of Reducts. [Citation Graph (0, 0)][DBLP]
    RSKT, 2007, pp:372-378 [Conf]

  22. Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition. [Citation Graph (, )][DBLP]


  23. On Irreducible Descriptive Sets of Attributes for Information Systems. [Citation Graph (, )][DBLP]


  24. Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts. [Citation Graph (, )][DBLP]


  25. On Algorithm for Building of Optimal alpha-Decision Trees. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002