M.S. Diploma Summa cum Laude, State University of Nizhni Novgorod, Russia, 1977
An author of more than 140 publications, Professor Moshkov's research interests include:
Study of time complexity of algorithms in such computational models as decision trees, decision rule systems and acyclic programs with applications to combinatorial optimization, fault diagnosis, pattern recognition, machine learning, data mining and analysis of Bayesian networks.Analysis and design of classifiers based on decision trees, reducts, decision rule systems, inhibitory rule systems, and lazy learning algorithms.Extensions of dynamic programming for sequential optimization relative to different cost functions and for study of relationships between two cost functions with applications to combinatorial optimization and data mining.
I.Chikalov, V.Lozin, I.Lozina, M.Moshkov, H.S.Nguyen, A.Skowron, B.Zielosko, "Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data", Springer book series Intelligent Systems Reference Library, vol. 41, Springer, 2013.
M.Moshkov, B.Zielosko, "Combinatorial Machine Learning: A Rough Set Approach", Springer book series Studies in Computational Intelligence, vol. 360, Springer, 2011.
P.Delimata, M.Moshkov, A.Skowron, Z.Suraj, "Inhibitory Rules in Data Analysis: A Rough Set Approach", Springer book series Studies in Computational Intelligence, vol. 163, Springer, 2009.
M.Moshkov, M.Piliszczuk, B.Zielosko, "Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications", Springer book series Studies in Computational Intelligence, vol. 145, Springer, 2008.
M.Moshkov, "Time Complexity of Decision Trees" (research monograph), Transactions on Rough Sets III, Lecture Notes in Computer Science 3400, Springer, 244-459, 2005.