|
|
Construction of classifiers suitable for segmentation of clients
Hricová, Jana ; Antoch, Jaromír (advisor) ; Zvára, Karel (referee)
Title: Construction of classifiers suitable for segmentation of clients Author: Bc. Jana Hricová Department: Department of Probability and Mathematical Statistics Supervisor: prof. RNDr. Jaromír Antoch, CSc., Department of Probability and Mathematical Statistics Abstract: The master thesis discusses methods that are a part of the data analy- sis, called classification. In the thesis are presented classification methods used to construct tree like classifiers suitable for customer segmentation. Core methodo- logy that is discussed in our thesis is CART (Classification and Regression Trees) and then methodologies around ensemble models that use historical data to cons- truct classification and regression forests, namely Bagging, Boosting, Arcing and Random Forest. Here described methods were applied to real data from the field of customer segmentation and also to simulated data, both processed with RStudio software. Keywords: classification, tree like classifiers, random forests
|
|
|
Building credit scoring models using selected statistical methods in R
Jánoš, Andrej ; Bašta, Milan (advisor) ; Pecáková, Iva (referee)
Credit scoring is important and rapidly developing discipline. The aim of this thesis is to describe basic methods used for building and interpretation of the credit scoring models with an example of application of these methods for designing such models using statistical software R. This thesis is organized into five chapters. In chapter one, the term of credit scoring is explained with main examples of its application and motivation for studying this topic. In the next chapters, three in financial practice most often used methods for building credit scoring models are introduced. In chapter two, the most developed one, logistic regression is discussed. The main emphasis is put on the logistic regression model, which is characterized from a mathematical point of view and also various ways to assess the quality of the model are presented. The other two methods presented in this thesis are decision trees and Random forests, these methods are covered by chapters three and four. An important part of this thesis is a detailed application of the described models to a specific data set Default using the R program. The final fifth chapter is a practical demonstration of building credit scoring models, their diagnostics and subsequent evaluation of their applicability in practice using R. The appendices include used R code and also functions developed for testing of the final model and code used through the thesis. The key aspect of the work is to provide enough theoretical knowledge and practical skills for a reader to fully understand the mentioned models and to be able to apply them in practice.
|
|
|
Ssh Attacks Detection on Netflow Layer
Marek, Marcel ; Barabas, Maroš (referee) ; Michlovský, Zbyněk (advisor)
This bachelor's thesis briefly describes the basic principles of SSH protocol, its architecture and used encryption. The thesis is mainly focused on datamining information from low-level network communication and usage of its results for attacks detection. It also describes dictionary attacks used on SSH service and with NetFlow shows further possibilities of increasing network security.
|
|
|
Classification Methods for Micriarrays Data
Hudec, Vladimír ; Bartík, Vladimír (referee) ; Burgetová, Ivana (advisor)
This paper discusses about the data obtained from gene chips and methods of their analysis. Analyzes some methods for analyzing these data and focus on the method of "Random Forests". Shows dataset that is used for specific experiments. Methods are realized in R language environment. Than they are tested, and the results are presented and compared. Results with method "Random Forests" are compared with other experiments on same dataset.
|
|
| |
|
| |
|
| |
|
|
Classification and Regression Forests
Klaschka, Jan ; Kotrč, Emil
Classification forest is a classification model constructed by combinaning several classification trees. A predictor vector is assigned a class by each of the trees, and the overall classification function is given by majority voting. Similarly, a regression forest consists of several regression trees, and the overall regression function is defined as a weighted average of regression functions of individual trees. Brief explanations of some forest construction methods, namely of bagging, boosting, arcing and Random Forests, are given.
|
|
|
Classification and Regression Forests.
Klaschka, Jan ; Kotrč, Emil
Classification forest is a classification model constructed by combinaning several classification trees. A predictor vector is assigned a class by each of the trees, and the overall classification function is given by majority voting. Similarly, a regression forest consists of several regression trees, and the overall regression function is defined as a weighted average of regression functions of individual trees. Brief explanations of some forest construction methods, namely of bagging, boosting, arcing and Random Forests, are given.
|
|
| |
guest ::
