|
|
Using Ontologies in GUHA Procedures
Zeman, Martin ; Ralbovský, Martin (advisor) ; Vojtáš, Peter (referee)
The goal of this master thesis is to implement some of the previously suggested ways of usage of Ontologies in Knowledge Database Discovery (KDD) process. The implementation is done in the Ferda environment, a modular environment for visual GUHA data mining. The work argues about each of the suggested ways of usage of ontologies in consideration of their successive implementation. Great part of the work is devoted to selection of the right language for representation of ontologies. Furthermore, the implementation of the selected modules in Ferda is described. The functionality of these modules is then tested on an example and there is evaluated the contribution of the modules for KDD process. At the end of the work the suggestions for future development of support of ontologies during the KDD process in Ferda DataMiner are described.
|
|
|
Relational GUHA procedures
Kuzmin, Alexander ; Rauch, Jan (advisor) ; Ralbovský, Martin (referee)
The thesis belongs to "implementation category". The goal of this thesis is to design and implement relational extensions of the selected GUHA procedures that are implemented in LISp-Miner system. 4ft-Miner and SD4ft-Miner have been selected for the implementation of relational extensions. There have also been impemented several methods for attribute transformation. Procedures have been implemented in the Ferda Dataminer environment.
|
|
|
User support 4ft-Miner procedure for data mining
Kupka, Daniel ; Rauch, Jan (advisor) ; Ralbovský, Martin (referee)
Up to now the file of knowledges with 4ft-Miner procedure was concerned only in the heads of data mining analysts. So, it was usefull, pursuant many analyses, to collect advices and experiences for data mining. This file of advices is also a part of this work. Furthermore, theoretical findings about using applicable 4ft-quantifiers according to practical situation are presented. This work also contains proposal of two new 4ft-quantifiers - above negation quantifier and pairing quantifier. For ASSOC-procedures users web application for collecting, editing advices, experiences and background knowledges is discribed and implemented. Benefit of this application is also in structuralization of inserted informations. The work also contains common design and the description of implementation of the tool for advices creation in Ferda DataMiner environement. Here, proceeding from possibilities ordered by their priority can be choosen. Informations provided by this tool are not only static, but they react on results of present and last analyses.
|
|
|
User support 4ft-Miner procedure for data mining
Kupka, Daniel ; Ralbovský, Martin (referee) ; Rauch, Jan (advisor)
Up to now the file of knowledges with 4ft-Miner procedure was concerned only in the heads of data mining analysts. So, it was usefull, pursuant many analyses, to collect advices and experiences for data mining. This file of advices is also a part of this work. Furthermore, theoretical findings about using applicable 4ft-quantifiers according to practical situation are presented. This work also contains proposal of two new 4ft-quantifiers - above negation quantifier and pairing quantifier. For ASSOC-procedures users web application for collecting, editing advices, experiences and background knowledges is discribed and implemented. Benefit of this application is also in structuralization of inserted informations. The work also contains common design and the description of implementation of the tool for advices creation in Ferda DataMiner environement. Here, proceeding from possibilities ordered by their priority can be choosen. Informations provided by this tool are not only static, but they react on results of present and last analyses.
|
|
|
Using Ontologies in GUHA Procedures
Zeman, Martin ; Vojtáš, Peter (referee) ; Ralbovský, Martin (advisor)
The goal of this master thesis is to implement some of the previously suggested ways of usage of Ontologies in Knowledge Database Discovery (KDD) process. The implementation is done in the Ferda environment, a modular environment for visual GUHA data mining. The work argues about each of the suggested ways of usage of ontologies in consideration of their successive implementation. Great part of the work is devoted to selection of the right language for representation of ontologies. Furthermore, the implementation of the selected modules in Ferda is described. The functionality of these modules is then tested on an example and there is evaluated the contribution of the modules for KDD process. At the end of the work the suggestions for future development of support of ontologies during the KDD process in Ferda DataMiner are described.
|
|
|
Relational GUHA procedures
Kuzmin, Alexander ; Ralbovský, Martin (referee) ; Rauch, Jan (advisor)
The thesis belongs to "implementation category". The goal of this thesis is to design and implement relational extensions of the selected GUHA procedures that are implemented in LISp-Miner system. 4ft-Miner and SD4ft-Miner have been selected for the implementation of relational extensions. There have also been impemented several methods for attribute transformation. Procedures have been implemented in the Ferda Dataminer environment.
|
|
|
Using domain knowledge in applications of GUHA procedures
Ralbovský, Martin ; Mráz, František (referee) ; Rauch, Jan (advisor)
We presume for this work, that the GUHA procedures' abilities can be extended by using domain knowledge in a suitable form. There are two types of domain knowledge used in this work: background knowledge and ontologies. Background knowledge is a relatively unknown, yet perspective type of domain knowledge containing rules from domain experts in a written form. The work describes this knowledge and introduces suitable rule formalization. Furthermore, a tool for rule validation is described and implemented. The implementation is done in the Ferda environment, a modular environment for visual GUHA data mining. The work also describes first practical experience with this tool. Concerning domain ontologies, the work greatly extends up-to-date knowledge of usage of ontologies in the GUHA data mining. There are all the former techniques for ontology usage mentioned and extended; in suitable cases the implementation design in Ferda environment is presented. The results of the work are discussed with respect to further usage in the Ever-Miner system, a next generation knowledge discovery tool
|
|
|
Fuzzy GUHA
Ralbovský, Martin ; Rauch, Jan (advisor) ; Svátek, Vojtěch (referee) ; Holeňa, Martin (referee) ; Vojtáš, Peter (referee)
The GUHA method is one of the oldest methods of exploratory data analysis, which is regarded as part of the data mining or knowledge discovery in databases (KDD) scienti_c area. Unlike many other methods of data mining, the GUHA method has firm theoretical foundations in logic and statistics. In scope of the method, finding interesting knowledge corresponds to finding special formulas in satisfactory rich logical calculus, which is called observational calculus. The main topic of the thesis is application of the "fuzzy paradigm" to the GUHA method By the term "fuzzy paradigm" we mean approaches that use many-valued membership degrees or truth values, namely fuzzy set theory and fuzzy logic. The thesis does not aim to cover all the aspects of this application, it emphasises mainly on: - Association rules as the most prevalent type of formulas mined by the GUHA method - Usage of fuzzy data - Logical aspects of fuzzy association rules mining - Comparison of the GUHA theory to the mainstream fuzzy association rules - Implementation of the theory using the bit string approach The thesis throughoutly elaborates the theory of fuzzy association rules, both using the theoretical apparatus of fuzzy set theory and fuzzy logic. Fuzzy set theory is used mainly to compare the GUHA method to existing mainstream approaches to formalize fuzzy association rules, which were studied in detail. Fuzzy logic is used to define novel class of logical calculi called logical calculi of fuzzy association rules (LCFAR) for logical representation of fuzzy association rules. The problem of existence of deduction rules in LCFAR is dealt in depth. Suitable part of the proposed theory is implemented in the Ferda system using the bit string approach. In the approach, characteristics of examined objects are represented as strings of bits, which in the crisp case enables efficient computation. In order to maintain this feature also in the fuzzy case, a profound low level testing of data structures and algoritms for fuzzy bit strings have been carried out as a part of the thesis.
|
|
|
XML Schema Visualization
Slavětínský, Václav ; Kosek, Jiří (advisor) ; Ralbovský, Martin (referee)
Bakalářská práce se zabývá návrhem a implementací aplikace, která slouží k převodu W3C XML schémat do interaktivního diagramu ve formátu SVG (Scalable Vector Graphics). Diagram poskytuje údaje získané ze schématu ? údaje o elementech a atributech, a jejich přípustné struktuře. Proto je vhodný jako součást dokumentace XML souborů vyhovujících schématu. Generovaná grafika je interaktivní a přehledná, uživatelům má usnadnit pochopení XML dokumentů a orientaci v nich. Aplikace je napsána v jazyce Java, využívá implementaci abstraktního datového modelu z open source XML parseru Xerces2-J. Interaktivita SVG výstupu je zajištěna ECMAScriptem.
|
|
|
Interactive Visualisation of RELAX NG Schemas
Sýkora, Lukáš ; Kosek, Jiří (advisor) ; Ralbovský, Martin (referee)
The aim of this thesis is to create a tool for visualisation of RELAX NG schemas. RELAX NG schemas define a form of XML documents. They determine what elements and attributes can be used in the document and how they can be combined. Visualisation of schemas enables easier orientation in the structure of RELAX NG patterns. This can be useful for both developers of schemas and users who use schemas for creation of XML documents. RELAX NG schema can be written using XML, which enables its visual representation by means of tree structure. Moreover, the model of the tree is interactive which enables users to display only the branches they are interested in. The aim will be reached in several steps. At first, it is necessary to analyze properly the structures of RELAX NG language with respect to their future visualisation. Next step is SVG format for description of vector graphics. SVG format can be written using XML as well. Interactivity of the model described by SVG is enabled by ECMAScript. The conversion from RELAX NG to SVG graphics will be done by means of XSLT transformation. The main contribution of this thesis will be the visualisation which facilitates the orientation in the schema for both users and developers. Only XSLT processor and a file with XSLT transformation will be needed for the visualisation of RELAX NG. The file with XSLT transformation will be the output of this thesis. The thesis is divided into three main parts. The first part is focused on the analysis of the structures of RELAX NG language and the possibilities of their visualisation. Particular attention will be given to the current possibilities of graphic interpretation of schemas. The second part is devoted to the design of graphic symbols for individual nodes of the graphic model and the possibilities of their interaction. The third part deals with the prototype implementation of transformation of RELAX NG to SVG graphics.
|
guest ::
