Pages
Victor Calo, Curtin University, Australia Igor Chikalov, Intel, USA Victor Gergel, Nizhni Novgorod University, Russia Vadim Lozin, Warwick University, UK Irina Lozina, Warwick University, UK Iosif Meerov, Nizhni Novgorod University, Russia Hung Son Nguyen, Warsaw University, Poland Maciej Paszynski, AGH University, Poland Anna Paszynska, Jagiellonian University, Poland Andrzej Skowron, Warsaw University, Poland Zbigniew Suraj, Rzeszow University, Poland Nikolai Zolotykh, Nizhni Novgorod University, Russia Beata Zielosko, Silesian University, Poland
Preparation of the book I. Chikalov, Average Time Complexity of Decision Trees, Series Intelligent Systems Reference Library, Vol. 21, 104 p., Springer, 2011 Details This one year book preparation project is based on the results of Igor Chikalov considered in his PhD Thesis and new results obtained at KAUST. Publications See more about this book: Average Time Complexity of Decision Trees I.Chikalov, Average Time Complexity of Decision Trees, Series Intelligent Systems Reference Library, Vol. 21, Springer, 2011 https://www.springer.com/gp/book/9783642226601# Decision tree is a widely used
Preparation of the book M. Moshkov, B. Zielosko, Combinatorial Machine Learning: A Rough Set Approach, Series Studies in Computational Intelligence, Vol. 360, 178 p., Springer, 2011 Details The book is used in KAUST as a textbook for the original course CS 361 Combinatorial Machine Learning. It was a one year project financially supported by KAUST. Publications See more about this book: Combinatorial Machine Learning: A Rough Set Approach M.Moshkov, B.Zielosko, Combinatorial Machine Learning: A Rough Set Approach, Series Studies in Computational Intelligence, Vol. 360, Springer, 2011 http:/
Initiative Project Details This is one and half year project of three research groups in KAUST, Warsaw University and Warwick University financially supported by KAUST. The aim of project is the familiarization of research community with three theories in data analysis that were developed almost independently but have many common points. This project includes: Preparation of the book 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, Series Intelligent Systems Reference
Courses CS 260 Design and Analysis of Algorithms Prerequisites: computer programming skills, probability, basic data structures and algorithms, basic discrete mathematics. The course covers main approaches to design and analysis of algorithms including important algorithms and data structures, and results in complexity and computability. The main contents are: review of algorithm analysis (search in ordered array, binary insertion sort, merge sort, worst-case and average-case time complexity, minimum complexity of sorting n elements for small n, 2-3 trees, asymptotic notation); divide and
Professor Mikhail Moshkov leads the TREES research group, which stands for Extensions of Dynamic Programming, Machine Learning, Discrete Optimization Research Group Led by Prof. Mikhail Moshkov, the TREES research group. Main research areas: Extensions of Dynamic Programming, Machine Learning and Data Mining, Discrete Optimization, Applied Healthcare Analytics. Main research areas: Extensions of Dynamic Programming (sequential optimization relative to different cost functions, counting of optimal solutions, construction of the set of Pareto optimal points, study of relationships between two
Other
