|
|
Knowledge Discovery from Spatio-Temporal Data
Liptáková, Daša ; Burgetová, Ivana (referee) ; Bartík, Vladimír (advisor)
This thesis deals with knowledge discovery from spatio-temporal data. Firstly, it describes the general principles of knowledge discovery and then knowledge discovery from spatio-temporal data, where it mainly focuses on methods for detecting outlying trajectories of moving objects. In the next section, the thesis describes the design and implementation of the mining task and demonstration application. Finally, several experiments are performed over three different datasets.
|
|
|
Knowledge Discovery from Web Logs
Valaštín, Samuel ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
This bachelor thesis deals with the problem of knowledge discovery from web logs. The data source in the form of web access logs allows, after appropriate preprocessing, the use of a number of techniques that are designed to deal with knowledge discovery. By applying these techniques to preprocessed data, it is possible to classify user behavior into groups, to discover interesting associations in user behavior, or to discover previously unknown sequences in common user behavior.
|
|
|
Creation of New Prediction Units in Data Mining System on NetBeans Platform
Havlíček, David ; Bartík, Vladimír (referee) ; Lukáš, Roman (advisor)
The issue of this master's thesis is a creation of new prediction unit for existing system of knowledge discovery in database. The first part of project deal with general problems of knowledge discovery in database and predictive analysis. The second part of the project deal with system developed on FIT, for which is module implemented, used technologies, concept and implementation of mining module for this system. The solution is implemented in Java language and is a built on the NetBeans platform.
|
|
|
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.
|
|
|
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
|
|
|
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.
|
|
|
Data Mining for Suggesting Further Actions
Veselovský, Martin ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
Knowledge discovery from databases is a complex issue involving integration, data preparation, data mining using machine learning methods and visualization of results. The thesis deals with the whole process of knowledge discovery, especially with the issue of data warehousing, where it offers the design and implementation of a specific data warehouse for the company ROI Hunter, a.s. In the field of data mining, the work focuses on the classification and forecasting of the advertising data available from the prepared data warehouse and, in particular, on the decision tree classification. When predicting the development of new ads, emphasis is put on the rationale for the prediction as well as the proposal to adjust the ad settings so that the prediction ends positively and, with a certain likelihood, the ads actually get better results.
|
|
|
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.
|
guest ::
