|
|
Decision Trees and Knowledge Extraction
Vitinger, Jiří ; Mrázová, Iveta (advisor) ; Jiroutek, Pavel (referee)
The goal of data mining is to extract knowledge, dependencies and rules from data sets. Many complex methods were developed to solve it. This thesis presents some of the most important methods, which include the decision trees with algorithms ID3, C4.5 and CART, neural networks like multilayer neural networks with the backpropagation algorithm, RBF networks, Kohonens maps and some modifications of LVQ method. There are also described some clustering methods like hierarchical clustering, QT clustering, kmeans method and its fuzzy modification. The work also includes data pre-processing techniques, which are very important in order to obtain better results of data mining process. Experimental part of the work compares the presented methods by means of the results of many tests on real-world data sets. The results can be used as a guide to choose an appropriate method and its parameters for some given data set. In this work there is presented author's implementation of the decision trees C4.5 and CART in C#. In the application it is possible to watch details of algorithms work. The application provides an API enabling an implementation of new algorithms.
|
|
|
Decision Trees and Knowledge Extraction
Vitinger, Jiří ; Mrázová, Iveta (advisor) ; Jiroutek, Pavel (referee)
The goal of data mining is to extract knowledge, dependencies and rules from data sets. Many complex methods were developed to solve it. This thesis presents some of the most important methods, which include the decision trees with algorithms ID3, C4.5 and CART, neural networks like multilayer neural networks with the backpropagation algorithm, RBF networks, Kohonens maps and some modifications of LVQ method. There are also described some clustering methods like hierarchical clustering, QT clustering, kmeans method and its fuzzy modification. The work also includes data pre-processing techniques, which are very important in order to obtain better results of data mining process. Experimental part of the work compares the presented methods by means of the results of many tests on real-world data sets. The results can be used as a guide to choose an appropriate method and its parameters for some given data set. In this work there is presented author's implementation of the decision trees C4.5 and CART in C#. In the application it is possible to watch details of algorithms work. The application provides an API enabling an implementation of new algorithms.
|
|
|
JSF Framework for Complex Data Visualization
Linha, Martin ; Šlajchrt, Zbyněk (advisor) ; Vitinger, Jiří (referee)
The thesis is focused on the development of JSF framework providing components for complex data visualizations. Its objective consists of the implementation of the API for creating JSF components rendering complex charts based on the JavaScript library C3.js and subsequent implementation of a set of chart components using this API. The contribution of this thesis is a library providing a tool for creating new JSF components based on C3.js together with a set of ready to use components. It begins with research of relevant JSF libraries, following with API analysis and design. Based on that is API implemented, in which a component set is then created. As a part of this work is a user guide, API reference guide and presentation web of implemented components.
|
guest ::
