|
|
Sports Centre
Maděránek, Martin ; Berka, Pavel (referee) ; Donaťáková, Dagmar (advisor)
Solution of the thesis is sportcentrum near Brno Dam. The building is brick, two-storey, basement, covered flat roof. On the first floor is a sports-recreation rooms and a restaurant, on the second floor facilities for staff.
|
|
|
Web graphic knowledge base editor for expert system NEST
Kozák, Martin ; Zamazal, Ondřej (advisor) ; Berka, Petr (referee)
Main goal of this thesis is development of knowledge base editor designed to work online. Such editor would provide its user with all tools that are necessary to create and modify knowledge base in a graphic and user-friendly working environment. This editor is developed for system NEST (New Expert SysTem), which is an expert system developed on University of Economics, Prague. Created editor is named WEBZ it is created as a web application. WEBZ is written in Java and build on Vaadin framework. Vaaadin is a framework created to develop web application while supporting a creation of graphic user interface. The thesis first chapter is a theoretical introduction into expert systems with a brief description of NEST. The description of NEST continues in second chapter, which is focused on a knowledge base of this expert system. In the following chapter, Vaadin framework is briefly described. The thesis continues with the comparison between WEBZ and its predecessors. Last two chapters are dedicated to description of WEBZ both from the perspective of user and from the perspective of developer.
|
|
|
Analysis of real data from Alza.cz product department using methods of KDD
Válek, Martin ; Berka, Petr (advisor) ; Kliegr, Tomáš (referee)
This thesis deals with data analysis using methods of knowledge discovery in databases. The goal is to select appropriate methods and tools for implementation of a specific project based on real data from Alza.cz product department. Data analysis is performed by using association rules and decision rules in the Lisp-Miner and decision trees in the RapidMiner. The methodology used is the CRISP-DM. The thesis is divided into three main sections. First section is focused on the theoretical summary of information about KDD. There are defined basic terms and described the types of tasks and methods of KDD. In the second section is introduced the methodology CRISP-DM. The practical part firstly introduces company Alza.cz and its goals for this task. Afterwards, the basic structure of the data and preparation for the next step (data mining) is described. In conclusion, the results are evaluated and the possibility of their use is outlined.
|
|
|
Teoretical documents to determining transport erosion for design rainfall
BERKA, Martin
This thesis is focused on erosion and its succesive elimination as antierosion measures. The area of interest is in the cadastral territory of Čížov u Jihlavy. For the calculation of the erosion threat was used the Wischmeier-Smith equation. The proposal has the influence of several factors. It´s rainfall, vegetation cover, soil characteristics, morphology, and other.
|
|
|
Faktory úspěchu v rané fázi podnikání
Berka, Michal ; Lukeš, Martin (advisor) ; Andera, Michal (referee)
This thesis discusses factors of success in the process of new business venturing and growth in current business environment. It employs a sample of 200 entrepreneurial cases documented through interviews which were each broken into over 40 mainly quantitative criteria. Aided by simple statistical tools this result is then analyzed and evaluated, leading to a thorough analysis of each of the aspects discussed and finally culminating in conclusion stating which factors are the most significant. Besides purely academic interest, conclusions of this thesis could be of interest to both actual and prospective entrepreneurs.
|
|
|
Post-processing of association rules by multicriterial clustering method
Kejkula, Martin ; Rauch, Jan (advisor) ; Berka, Petr (referee) ; Máša, Petr (referee)
Association rules mining is one of several ways of knowledge discovery in databases. Paradoxically, data mining itself can produce such great amounts of association rules that there is a new knowledge management problem: there can easily be thousands or even more association rules holding in a data set. The goal of this work is to design a new method for association rules post-processing. The method should be software and domain independent. The output of the new method should be structured description of the whole set of discovered association rules. The output should help user to work with discovered rules. The path to reach the goal I used is: to split association rules into clusters. Each cluster should contain rules, which are more similar each other than to rules from another cluster. The output of the method is such cluster definition and description. The main contribution of this Ph.D. thesis is the described new Multicriterial clustering association rules method. Secondary contribution is the discussion of already published association rules post-processing methods. The output of the introduced new method are clusters of rules, which cannot be reached by any of former post-processing methods. According user expectations clusters are more relevant and more effective than any former association rules clustering results. The method is based on two orthogonal clustering of the same set of association rules. One clustering is based on interestingness measures (confidence, support, interest, etc.). Second clustering is inspired by document clustering in information retrieval. The representation of rules in vectors like documents is fontal in this thesis. The thesis is organized as follows. Chapter 2 identify the role of association rules in the KDD (knowledge discovery in databases) process, using KDD methodologies (CRISP-DM, SEMMA, GUHA, RAMSYS). Chapter 3 define association rule and introduce characteristics of association rules (including interestingness measuress). Chapter 4 introduce current association rules post-processing methods. Chapter 5 is the introduction to cluster analysis. Chapter 6 is the description of the new Multicriterial clustering association rules method. Chapter 7 consists of several experiments. Chapter 8 discuss possibilities of usage and development of the new method.
|
|
|
Extrakce informací z webových stránek pomoci extrakčních ontologií
Labský, Martin ; Berka, Petr (advisor) ; Strossa, Petr (referee) ; Vojtáš, Peter (referee) ; Snášel, Václav (referee)
Automatic information extraction (IE) from various types of text became very popular during the last decade. Owing to information overload, there are many practical applications that can utilize semantically labelled data extracted from textual sources like the Internet, emails, intranet documents and even conventional sources like newspaper and magazines. Applications of IE exist in many areas of computer science: information retrieval systems, question answering or website quality assessment. This work focuses on developing IE methods and tools that are particularly suited to extraction from semi-structured documents such as web pages and to situations where available training data is limited. The main contribution of this thesis is the proposed approach of extended extraction ontologies. It attempts to combine extraction evidence from three distinct sources: (1) manually specified extraction knowledge, (2) existing training data and (3) formatting regularities that are often present in online documents. The underlying hypothesis is that using extraction evidence of all three types by the extraction algorithm can help improve its extraction accuracy and robustness. The motivation for this work has been the lack of described methods and tools that would exploit these extraction evidence types at the same time. This thesis first describes a statistically trained approach to IE based on Hidden Markov Models which integrates with a picture classification algorithm in order to extract product offers from the Internet, including textual items as well as images. This approach is evaluated using a bicycle sale domain. Several methods of image classification using various feature sets are described and evaluated as well. These trained approaches are then integrated in the proposed novel approach of extended extraction ontologies, which builds on top of the work of Embley [21] by exploiting manual, trained and formatting types of extraction evidence at the same time. The intended benefit of using extraction ontologies is a quick development of a functional IE prototype, its smooth transition to deployed IE application and the possibility to leverage the use of each of the three extraction evidence types. Also, since extraction ontologies are typically developed by adapting suitable domain ontologies and the ontology remains in center of the extraction process, the work related to the conversion of extracted results back to a domain ontology or schema is minimized. The described approach is evaluated using several distinct real-world datasets.
|
|
|
Agent based models of financial markets - rationality and social networks
Popadinec, Martin ; Burian, Jan (advisor) ; Berka, Petr (referee)
In the thesis we focus on involving Agent-based models in modeling financial markets. In Agent-based models of economical systems, often called Agent-based computational economics (ACE), market price is established by actions and interactions of autonomous agents using heuristics or simple decision-making rules. This approach to modeling of financial markets provide us with better understanding of establishing market price then aggregate economical models which focuses exclusively on societally "optimal" equilibria assuming that they are achieved by informed and rational behavior of people. The thesis consists of two main parts. The first one, theoretical, is an introduction to agent based modeling, bounded rationality and social network Our concern in the second part of the thesis is a model of volatility on financial markets. This model is interesting example of agent based approach to creating economical models. However it contains some non-realistic assumption from which the most controversial is the space where agents interacts -- two dimensional lattice. In this part of the work the model is converted from two dimensional lattice to the networks which better corresponds to real social networks but we also experiment with another extension of the agent's decision-making function. The intended outcome of the work is verifying the quality of the model, to learn the effect of our model extensions on price volatility, overview of attributes of the particular networks and discussion whether such models could provide some valuable information to the economist which are interested in financial markets.
|
|
|
Expert Systems - principles and structure
Šetek, Martin ; Jirků, Petr (advisor) ; Berka, Petr (referee)
Bakalářská práce se zabývá expertními systémy. Popisem principů a struktury. Cílem této práce je čtenářům přiblížit oblast umělé inteligence zabývající se právě expertními systémy, aby čtenář pochopil, čím se expertní systémy zabývají, jak fungují, jaký mají prospěch pro společnost. Práce je strukturovaná do kapitol. První dvě kapitoly se zabývají seznámením čtenářů s umělou inteligencí. Další kapitoly se již zabývají expertními systémy. První část práce objasňuje, co expertní systémy jsou. Dále se věnuje také jejich historii, charakterizujícím znakům a typům úloh, které řeší. Závěr práce se zabývá architekturami expertních systémů.
|
|
|
Ontology Learning and Information Extraction for the Semantic Web
Kavalec, Martin ; Berka, Petr (advisor) ; Štěpánková, Olga (referee) ; Snášel, Václav (referee)
The work gives overview of its three main topics: semantic web, information extraction and ontology learning. A method for identification relevant information on web pages is described and experimentally tested on pages of companies offering products and services. The method is based on analysis of a sample web pages and their position in the Open Directory catalogue. Furthermore, a modfication of association rules mining algorithm is proposed and experimentally tested. In addition to an identification of a relation between ontology concepts, it suggest possible naming of the relation.
|
guest ::
RSS feed.