National Repository of Grey Literature 900 records found  beginprevious851 - 860nextend  jump to record: Search took 0.02 seconds. 
Document Classification
Marek, Tomáš ; Škoda, Petr (referee) ; Otrusina, Lubomír (advisor)
This thesis deals with a document classification, especially with a text classification method. Main goal of this thesis is to analyze two arbitrary document classification algorithms to describe them and to create an implementation of those algorithms. Chosen algorithms are Bayes classifier and classifier based on support vector machines (SVM) which were analyzed and implemented in the practical part of this thesis. One of the main goals of this thesis is to create and choose optimal text features, which are describing the input text best and thus lead to the best classification results. At the end of this thesis there is a bunch of tests showing comparison of efficiency of the chosen classifiers under various conditions.
Learnable Evolution Model for Optimization (LEM)
Grunt, Pavel ; Vašíček, Zdeněk (referee) ; Schwarz, Josef (advisor)
My thesis is dealing with the Learnable Evolution Model (LEM), a new evolutionary method of optimization, which employs a classification algorithm. The optimization process is guided by a characteristics of differences between groups of high and low performance solutions in the population. In this thesis I introduce new variants of LEM using classification algorithm AdaBoost or SVM. The qualities of proposed LEM variants were validated in a series of experiments in static and dynamic enviroment. The results have shown that the metod has better results with smaller group sizes. When compared to the Estimation of Distribution Algorithm, the LEM variants achieve comparable or better values faster. However, the LEM variant which combined the AdaBoost approach with the SVM approach had the best overall performance.
Visipedia - Embedding-driven Visual Feature Extraction and Learning
Jakeš, Jan ; Beran, Vítězslav (referee) ; Zemčík, Pavel (advisor)
Multidimenzionální indexování je účinným nástrojem pro zachycení podobností mezi objekty bez nutnosti jejich explicitní kategorizace. V posledních letech byla tato metoda hojně využívána pro anotaci objektů a tvořila významnou část publikací spojených s projektem Visipedia. Tato práce analyzuje možnosti strojového učení z multidimenzionálně indexovaných obrázků na základě jejich obrazových příznaků a přestavuje metody predikce multidimenzionálních souřadnic pro předem neznámé obrázky. Práce studuje příslušené algoritmy pro extrakci příznaků, analyzuje relevantní metody strojového účení a popisuje celý proces vývoje takového systému. Výsledný systém je pak otestován na dvou různých datasetech a provedené experimenty prezentují první výsledky pro úlohu svého druhu.
Automated Web Page Categorization Tool
Lat, Radek ; Bartík, Vladimír (referee) ; Malčík, Dominik (advisor)
Tato diplomová práce popisuje návrh a implementaci nástroje pro automatickou kategorizaci webových stránek. Cílem nástroje je aby byl schopen se z ukázkových webových stránek naučit, jak každá kategorie vypadá. Poté by měl nástroj zvládnout přiřadit naučené kategorie k dříve nespatřeným webovým stránkám. Nástroj by měl podporovat více kategorií a jazyků. Pro vývoj nástroje byly použity pokročilé techniky strojového učení, detekce jazyků a dolování dat. Nástroj je založen na open source knihovnách a je napsán v jazyce Python 3.3.
Named Entity Recognition
Rylko, Vojtěch ; Otrusina, Lubomír (referee) ; Smrž, Pavel (advisor)
In this master thesis are described the history and theoretical background of named-entity recognition and implementation of the system in C++ for named entity recognition and disambiguation. The system uses local disambiguation method and statistics generated from the  Wikilinks web dataset. With implemented system and with alternative implementations are performed various experiments and tests. These experiments show that the system is sufficiently successful and fast. System participates in the Entity Recognition and Disambiguation Challenge 2014.
Prediction of Protein Stability upon Mutations Using Machine Learning
Malinka, František ; Martínek, Tomáš (referee) ; Bendl, Jaroslav (advisor)
This thesis describes a new approach to the detection of protein stability change upon amino acid mutations. The main goal is to create a new meta-tool, which combines the outputs of eight well-established prediction tools and due to suitable method of consensus making, it is able to improve the overall prediction accuracy. The optimal strategy of combination of outputs of these tools is found by using a various number of machine learning methods. From all tested machine learning methods, KStar showed the highest prediction accuracy on the training dataset compiled from experimentally validated mutations originating from ProTherm database. Due to this reason, it is chosen as an optimal prediction technique. The general prediction abilities is validated on the testing dataset composed of multi-point amino acid mutations extracted also from ProTherm database. Since the multi-point mutations were not used for training any of integrated tools, we suppose that such comparison is objective. As a result, the developed meta-tool based on KStar technique improves the correlation coefficient about 0.130 on the training dataset and 0.239 on the testing dataset, respectively (the comparison is being made against the most succesful integrated tool). Based on the obtained results, it is possible to claim that machine learning methods are suitable technique for the problems from area of protein predictions.
Knowledge Discovery in Object Relational Databases
Chytka, Karel ; Vrážel, Dušan (referee) ; Chmelař, Petr (advisor)
The goal of this master's thesis is to acquaint with a problem of a knowledge discovery and objectrelational data classification. It summarizes problems which are connected with mining spatiotemporal data. There is described data mining kernel algorithm SVM. The second part solves classification method implementation. This method solves data mining in a Caretaker trajectory database. This thesis contains application's implementation for spatio-temporal data preprocessing, their organization in database and presentation too.
Melody Harmonization
Vlasák, Jaroslav ; Černocký, Jan (referee) ; Fapšo, Michal (advisor)
This bachaleor's thesis is focused on an automatic harmonization of melody. The implemented system is using a machine learning approach and learning the harmony principles from the database of MIDI files. The input of the system could be monophony songs in MIDI or ABC format. The output of the system are polyphony songs in MIDI format harmonized in the style of protestant chorale.
Detection of Network Anomalies Based on NetFlow Data
Czudek, Marek ; Bartoš, Václav (referee) ; Kořenek, Jan (advisor)
This thesis describes the use of NetFlow data in the systems for detection of disruptions or anomalies in computer network traffic. Various methods for network data collection are described, focusing especially on the NetFlow protocol. Further, various methods for anomaly detection  in network traffic are discussed and evaluated, and their advantages as well as disadvantages are listed. Based on this analysis one method is chosen. Further, test data set is analyzed using the method. Algorithm for real-time network traffic anomaly detection is designed based on the analysis outcomes. This method was chosen mainly because it enables detection of anomalies even in an unlabelled network traffic. The last part of the thesis describes implementation of the  algorithm, as well as experiments performed using the resulting  application on real NetFlow data.
Information Extraction from Biomedical Texts
Knoth, Petr ; Burget, Radek (referee) ; Smrž, Pavel (advisor)
Recently, there has been much effort in making biomedical knowledge, typically stored in scientific articles, more accessible and interoperable. As a matter of fact, the unstructured nature of such texts makes it difficult to apply  knowledge discovery and inference techniques. Annotating information units with semantic information in these texts is the first step to make the knowledge machine-analyzable.  In this work, we first study methods for automatic information extraction from natural language text. Then we discuss the main benefits and disadvantages of the state-of-art information extraction systems and, as a result of this, we adopt a machine learning approach to automatically learn extraction patterns in our experiments. Unfortunately, machine learning techniques often require a huge amount of training data, which can be sometimes laborious to gather. In order to face up to this tedious problem, we investigate the concept of weakly supervised or bootstrapping techniques. Finally, we show in our experiments that our machine learning methods performed reasonably well and significantly better than the baseline. Moreover, in the weakly supervised learning task we were able to substantially bring down the amount of labeled data needed for training of the extraction system.

National Repository of Grey Literature : 900 records found   beginprevious851 - 860nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.