Search the dblp DataBase
Mikhail Ju. Moshkov :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Mikhail Ju. Moshkov On the Programs with Finite Development. [Citation Graph (0, 0)][DBLP ] FCT, 1987, pp:323-327 [Conf ] Mikhail Ju. Moshkov On Cardinality of Reducts for the Most Part of Binary Decision Tables. [Citation Graph (0, 0)][DBLP ] IICAI, 2005, pp:2404-2410 [Conf ] Mikhail Ju. Moshkov Restricted Linear Information Systems. [Citation Graph (0, 0)][DBLP ] Intelligent Information Systems, 2005, pp:561-564 [Conf ] Mikhail Ju. Moshkov Greedy Algorithm for Decision Tree Construction in Context of Knowledge Discovery Problems. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 2004, pp:192-197 [Conf ] Mikhail Ju. Moshkov , Marcin Piliszczuk On Partial Tests and Partial Reducts for Decision Tables. [Citation Graph (0, 0)][DBLP ] RSFDGrC (1), 2005, pp:149-155 [Conf ] Mikhail Ju. Moshkov , Marcin Piliszczuk , Beata Zielosko Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules. [Citation Graph (0, 0)][DBLP ] RSKT, 2006, pp:290-296 [Conf ] Mikhail Ju. Moshkov On Construction of the Set of Irreducible Partial Covers. [Citation Graph (0, 0)][DBLP ] SAGA, 2005, pp:38-44 [Conf ] Mikhail Ju. Moshkov Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2003, v:82, n:4, pp:- [Journal ] Mikhail Ju. Moshkov Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:54, n:4, pp:345-368 [Journal ] Mikhail Ju. Moshkov Compressible Infinite Information Systems. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:55, n:1, pp:51-61 [Journal ] Mikhail Ju. Moshkov , Marcin Piliszczuk , Beata Zielosko On Construction of Partial Reducts and Irreducible Partial Decision Rules. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2007, v:75, n:1-4, pp:357-374 [Journal ] Mikhail Ju. Moshkov On algorithms for construction of all irreducible partial covers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:103, n:2, pp:66-70 [Journal ] Igor V. Chikalov , Mikhail Ju. Moshkov , Maria S. Zelentsova On Optimization of Decision Trees. [Citation Graph (0, 0)][DBLP ] , 2005, v:, n:, pp:18-36 [Journal ] Mikhail Ju. Moshkov Greedy Algorithm of Decision Tree Construction for Real Data Tables. [Citation Graph (0, 0)][DBLP ] , 2004, v:, n:, pp:161-168 [Journal ] Mikhail Ju. Moshkov Time Complexity of Decision Trees. [Citation Graph (0, 0)][DBLP ] , 2005, v:, n:, pp:244-459 [Journal ] Mikhail Ju. Moshkov Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach. [Citation Graph (0, 0)][DBLP ] , 2005, v:, n:, pp:125-143 [Journal ] Mikhail Ju. Moshkov , Andrzej Skowron , Zbigniew Suraj On Covering Attribute Sets by Reducts. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:175-180 [Conf ] Mikhail Ju. Moshkov , Marcin Piliszczuk , Beata Zielosko Universal Attribute Reduction Problem. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:417-426 [Conf ] Mikhail Ju. Moshkov , Marcin Piliszczuk , Beata Zielosko On Partial Covers, Reducts and Decision Rules with Weights. [Citation Graph (0, 0)][DBLP ] T. Rough Sets, 2007, v:6, n:, pp:211-246 [Journal ] Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules. [Citation Graph (, )][DBLP ] On Construction of Partial Association Rules. [Citation Graph (, )][DBLP ] On the class of restricted linear information systems. [Citation Graph (, )][DBLP ] Search in 0.021secs, Finished in 0.022secs