|
Knowledge Discovery in Databases of Moving Objects
Chovanec, Vladimír ; Mlích, Jozef (referee) ; Chmelař, Petr (advisor)
The aim of this master's thesis is to get familiar with problems of data mining and classification. This thesis also continues with application SUNAR, which is upgraded in practical part with SVM classification of persons passing between cameras. In the conclusion, we discuss ways to improve classification and person recognition in application SUNAR.
|
|
Methods for Classification of WWW Pages
Svoboda, Pavel ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
The main goal of this master's thesis was to study the main principles of classification methods. Basic principles of knowledge discovery process, data mining and using an external class CSSBox are described. Special attantion was paid to implementation of a ,,k-nearest neighbors`` classification method. The first objective of this work was to create training and testing data described by 'n' attributes. The second objective was to perform experimental analysis to determine a good value for 'k', the number of neighbors.
|
|
Data Mining with Python
Šenovský, Jakub ; Bartík, Vladimír (referee) ; Zendulka, Jaroslav (advisor)
The main goal of this thesis was to get acquainted with the phases of data mining, with the support of the programming languages Python and R in the field of data mining and demonstration of their use in two case studies. The comparison of these languages in the field of data mining is also included. The data preprocessing phase and the mining algorithms for classification, prediction and clustering are described here. There are illustrated the most significant libraries for Python and R. In the first case study, work with time series was demonstrated using the ARIMA model and Neural Networks with precision verification using a Mean Square Error. In the second case study, the results of football matches are classificated using the K - Nearest Neighbors, Bayes Classifier, Random Forest and Logical Regression. The precision of the classification is displayed using Accuracy Score and Confusion Matrix. The work is concluded with the evaluation of the achived results and suggestions for the future improvement of the individual models.
|
|
Use of Knowledge Discovery for Data from PDF Files
Dvořáček, Libor ; Burgetová, Ivana (referee) ; Bartík, Vladimír (advisor)
This bachelor thesis deals with the extraction of tables from digitally created pdfs and the subsequent use of the obtained data for data analysis. Methods of dimension reduction and cluster analysis are used. The main content is an analysis of available tools for data extraction in the python language, a description and comparison of the used machine learning methods and implementation of an application that combines all these topics into one functional unit at: http://extraktor.herokuapp.com
|
|
Web Mining - Clustering
Rychnovský, Martin ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
This work presents the topic of data mining on the web. It is focused on clustering. The aim of this project was to study the field of clustering and to implement clustering through the k-means algorithm. Then, the algorithm was tested on a dataset of text documents and on data extracted from web. This clustering method was implemented by means of Java technologies.
|
|
Time-Serie Mining Module of a Data Mining System
Klement, Ondřej ; Bartík, Vladimír (referee) ; Zendulka, Jaroslav (advisor)
The subject of this master's thesis is extension of existing data mining system. System will be extended by the module for the time series data mining. This thesis consists of common introduction to data mining issues and continues with time series analysis. Thesis then also contains some of the current tasks and algorithms used in time series data mining, follows by the concept of the implementation and description of the choosen mining method. Possible future system's improvments are disscused at the end of the paper.
|
|
Preprocessing Methods in Knowledge Discovery
Pokorný, Lubomír ; Lukáš, Roman (referee) ; Bartík, Vladimír (advisor)
This thesis discusses preprocessing methods in knowledge discovery. There are four methods of discretization, filling in the missing values and normalization is investigated. There is closer view on building the application which discretizate numeric atribute in database. All methods were successfully tested and the results were added.
|
|
Mining Multiple Level Association Rules
Nachtnebl, Viktor ; Stryka, Lukáš (referee) ; Bartík, Vladimír (advisor)
Knowledge discovery from data scope is quite a young concept but is becoming more and more popular. This bachelor's thesis is engaged in mining multiple level association rules. There are four different methods of investigation discussed. These offer an insight into the problem of concept and implementation of application. At the end we have confronted and reviewed the results of these four algorithms.
|
|
Decision Making Support in CRM Systems
Filus, Michal ; Očenášek, Pavel (referee) ; Jirák, Ota (advisor)
The thesis deals with a decision making support in CRM systems. The goal of this thesis was to design a module for decision making support in the CRM system using Pentaho analysis tools. The theoretical part contains a description of the data warehousing and data mining with a focus on analytic operations and decision making support. It also contains brief description of CRM systems and possible application of decision making support in these systems. The practical part deals with the description of architecture of CRM system CRMminer and describes the decision making support module in this system.
|
|
Knowledge Discovery over Data Warehouses
Pumprla, Ondřej ; Chmelař, Petr (referee) ; Stryka, Lukáš (advisor)
This Master's thesis deals with the principles of the data mining process, especially with the mining of association rules. The theoretical apparatus of general description and principles of the data warehouse creation is set. On the basis of this theoretical knowledge, the application for the association rules mining is implemented. The application requires the data in the transactional form or the multidimensional data organized in the Star schema. The implemented algorithms for finding of the frequent patterns are Apriori and FP-tree. The system allows the variant setting of parameters for mining process. Also, the validation tests and efficiency proofs were accomplished. From the point of view of the association rules searching support, the resultant application is more applicable and robust than the existing compared systems SAS Miner and Oracle Data Miner.
|