Hrubé množiny a ich aplikácie

Abstract

This thesis explores the theoretical foundations of rough set theory, delving into the concepts of approximation spaces, indiscernibility relations, and reducts. A detailed description of algorithms related to rough set theory, including attribute reduction and outlier identification. In addition, a~software application is developed to implement and visualize these algorithms. Finally, experimental results will be presented, demonstrating the effectiveness of rough set-based algorithms in various data analysis tasks.