Faculty
4700 King Abdullah University of Science and Technology
Thuwal 23955-6900
Kingdom of Saudi Arabia
Mikhail Moshkov
Professor, Applied Mathematics and Computational Science
D.Sc., Moscow State University, Russia, 1999
Ph.D. Saratov State University, Russia, 1983
M.S. Diploma Summa cum Laude, State University of Nizhni Novgorod, Russia, 1977
Research Interests
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 to the problems with exponential numbers of subproblems and to sequential optimization relative to different criteria with applications to machine learning and discrete optimization.
Selected Publications
- A.Alkhalid, I.Chikalov, M.Moshkov, Szczuka, M. et al. "On algorithm for building of optimal a-decision trees". RSCTC 2010, LNCS (LNAI) 6086, Springer, Heidelberg, 438-445, 2010.
- M.Moshkov, A.Skowron, Z.Suraj, "Irreducible descriptive sets ofattributes for information systems", LNCS Transactions on Rough Sets XI. LNCS 5946. Springer, Heidelberg, 92-105, 2010.
- M.Moshkov, M.Piliszczuk, B.Zielosko, "Greedy algorithms with weights for construction of partial association rules", Fundamenta Informaticae, 94(1), 101-120, 2009.
- M.Moshkov, A.Skowron, Z.Suraj, "On minimal inhibitory rules for almost all k-valued information systems", Fundamenta Informaticae, 93(1-3), 261-272, 2009.
- P.Delimata, M.Ju.Moshkov, A.Skowron, Z.Suraj, "Inhibitory Rules in Data Analysis: A Rough Set Approach", Springer book series Studies in Computational Intelligence, vol. 163, Springer, Berlin, Heidelberg, 2009.


