|
|
Programming tools for creation expert systems
Hrbek, Filip ; Berka, Petr (advisor) ; Svátek, Vojtěch (referee)
This bachelor thesis is going to explore the supply of programming tools for creation expert system and compare these tools by established criteria. This document is divided into theoretical and practical part. The first one is trying to describe expert system topic including division of programming tools into general programming language, programming language for artificial intelligence and development toolkits for expert system. The reader can imagine general model, which will be compared by practical applications. In the practical part I have written something about established criteria. The study describes programming tools. Information about them I have found in the manuals, tutorials, information from manufacturer, testing these tools. In conclusion I have compared them in tables. I have chosen only few examples of programming tools, because the offer on now day market is too wide.
|
|
|
Semantics in Multimedia: Event detection and cross-media feature extraction
Nemrava, Jan ; Svátek, Vojtěch (advisor) ; Berka, Petr (referee) ; Smrž, Pavel (referee)
This dissertation thesis describes the area of multimedia semantics which is a research area that brings together research streams that until recently run separately. The aim of the work is to provide an insight to all areas from this wide discipline and give an outlook on current problems especially to the semantic gab phenomena. Number of findings and outcomes in this work comes from international project K-Space, in which the author took part for three years. The extensive theoretical introduction into problematic is followed by a list state-of-the-art application from this area and overview of KIZI activities and involvements in the European project. The contribution of the work is a research on textual resources complementary to video and experiments with automatic detection of sporting events based on pre-classified examples and trained model. The practical contribution is also a demo web application that shows all the resources together and allows non-linear browsing of events.
|
|
|
Mapování ontologií a jeho vyhodnocování pomocí vzorů
Zamazal, Ondřej ; Svátek, Vojtěch (advisor) ; Vacura, Miroslav (referee) ; Pokorný, Jaroslav (referee) ; Štuller, Július (referee)
Ontology Matching is one of the hottest topic within the Semantic Web of recent years. There is still ample of space for improvement in terms of performance. Furthermore, current ontology matchers mostly concentrate on simple entity to entity matching. However, matching of whole structures could bring some additional complex relationships. These structures of ontologies can be captured as ontology patterns. The main theme of this thesis is an examination of pattern-based ontology matching enhanced with ontology transformation and pattern-based ontology alignment evaluation. The former is examined due to its potential benefits regarding complex matching and matching as such. The latter is examined because complex hypotheses could be beneficial feedback as complement to traditional evaluation methods. These two tasks are related to four different topics: ontology patterns, ontology transformation, ontology alignment evaluation and ontology matching. With regard to those four topics, this work covers the following aspects: * Examination of different aspects of ontology patterns. Particularly, description of relevant ontology patterns for ontology transformation and for ontology matching (such as naming, matching and transformation patterns). * Description of a pattern-based method for ontology transformation. * Introduction of new methods for an alignment evaluation; including using patterns as a complex structures for more detailed analysis. * Experiments and demonstrations of new concepts introduced in this thesis. The thesis first introduces naming pattern and matching pattern classification on which ontology transformation framework is based. Naming patterns are useful for detection of ontology patterns and for generation of new names for entities. Matching patterns are basis for transformation patterns in terms of sharing some building blocks. In comparison with matching patterns, transformation patterns have transformation links that represent way how parts of ontology patterns are transformed. Besides several evaluations and implementations, the thesis provides a demonstration of getting complex matching due to ontology transformation process. Ontology transformation framework has been implemented in Java environment where all generic patterns are represented as corresponding Java objects. Three main implemented services are made generally available as RESTful services: ontology pattern detection, transformation instruction generation and ontology transformation.
|
|
|
Hodnocení sémantických aplikací pro podnikové prostředí
Nekvasil, Marek ; Svátek, Vojtěch (advisor) ; Novotný, Ota (referee) ; Mikulecký, Peter (referee) ; Paralič, Ján (referee)
Broader and broader areas of application deployment are covered by semantic technologies recently and in the meantime their scope is increasing constantly. The possibilities of semantic applications are now so vast that they cannot be judged as a single market segment any more. The business skepticism that arises due to the uncertainty of investments in such technologies is only augmented by these differences and picking up on that this thesis concentrates on the aspects that can enable and evaluate not only the economic efficiency of engaging the semantic technologies in a business environment but also the effectiveness of doing so. This work concentrates on the ways of how to prove the differences amongst semantic applications, define their distinct segments based on use-case, and subsequently identify their Critical Success Factors and evaluate them against the real conditions of the applications' deployment with the participation of people involved in their development. Following the results of these interactions this thesis presents an innovative approach that enables to construct models for judging the maturity of enterprises for the deployment of the respective applications including the actual construction of these models for all the identified applications' use-cases segments. Moreover, in a later part of the work the evaluation using these models is demonstrated on AQUA application (outcome of a project the author did personally partake in) along with sketching additional specifics that may help the timely assessment of semantics in certain cases. The results presented in later chapters are supported by the underlying background researches in the fields of Semantic Technologies and IT assessment both of whose state-of-the-art methods are described here. Usability of the current standardized methods (such as those used in COBIT) for assessing semantic applications is also considered with respect to the lack of other best practices in business deployment of semantics.
|
|
|
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.
|
|
|
Publishing of bibliographic information according to the Linked Data principles
Hladká, Jitka ; Sklenák, Vilém (advisor) ; Svátek, Vojtěch (referee)
Bibliographic data provide well established means of the information resource description. Nowadays, there is obvious need to make this data more web-friendly and web-compatible, while web is mostly seen as the only place where people are seeking information. The proposed solution is to change the traditional bibliographic data representation format. Semantic Web initiative presents enhancement of the current web with machine processable data semantics (meaning). The main goal is to manage more effective information processing by web applications that brings up many benefits for web users. Linked data are seen as practical means to reach the semantic web vision. This initiative promotes best practices of publishing, connecting and sharing structural data on the web. This thesis reports the transformation of bibliographic records' format in case of Database of publishing activities at University of Economics, Prague (PCVSE). Benefits of linked data publishing model are demonstrated on the realized projects. The main part describes practical experiences gained during the implementation of RDF framework in phases of data modelling, interlinking and exposing the dataset. The linked data publishing model is seen there as an optimal web-compatible bibliographic data representation format.
|
|
|
SPARQL plugin for Ontopia Knowledge Suite
Ovčáčík, Vlastimil ; Kliegr, Tomáš (advisor) ; Svátek, Vojtěch (referee)
Reader of this bachelor thesis will familiarize with two technologies of semantic web -- Topic Maps and RDF. In the first half of this document we can find principles, history and thoughts on near future of both technologies. There are explained necessary principles of both standards. Emphasis is placed on query languages SPARQL and TMQL. Object of this thesis is understanding differences and mutual aspects of both Topic Maps and RDF. This understanding is key for finding interoperability between these two technologies on semantic web. The second half of this thesis is aimed on implementation of sparql4ontopia - a plugin for Ontopia Knowledge Suite, which enables quering topic maps with SPARQL. This plugin utilizes Sesame project for SPARQL query evaluation and Nikunau tool from SesameTM project for mapping SPARQL on Topic Maps Data Model. Possibilities and limitations of this plugin are described. There is also description of sparql4ontopia development and implementation. Last chapter shed light on SPARQL endpoint and possible way of implementation into Ontopia Knowledge Suite.
|
|
|
Support of Semantics in CMS Drupal
Kubaliak, Lukáš ; Svátek, Vojtěch (advisor) ; Hazucha, Andrej (referee)
The work concern about the support of semantics in known content managing systems. It is describing the possibilities of use for these technologies and their public accessibility. We find out, that today's technologies and methods are in the state of public inducting. In the question of semantic support in CMS Drupal we developed a tool for extending its support of semantic formats. This tool allows CMS Drupal to export its information in a Topic Maps format. For this it uses the XTM file.
|
|
|
Structured data on the Web: Comparison of Linked Data and Web APIs
Zemánek, Jan ; Svátek, Vojtěch (advisor) ; Sklenák, Vilém (referee)
The aim of this work is, firstly, to describe the two popular ways of making structured data accessible on the Web, namely Web APIs and Linked Data; secondly, it is to conduct a theoretical survey of features of each of these two techniques. The contribution of this work lays in a table comparing Web APIs and Linked Data and a detailed description of each of the items in the table. In conclusion, this work gives a verdict on which one of these two techniques leads from a technological point of view to more reusable data on the Web.
|
|
|
Web interface for ontology similarity measures
Pichl, Ota ; Zamazal, Ondřej (advisor) ; Svátek, Vojtěch (referee)
Semantic Web is one of the most recent topics on the internet. The idea of Semantic Web is associated to informatics ontologies which can provide features for description of web knowledge. Ontologies than bring the feature of semantic annotation for data and knowledge on the internet. This work is focused on comparison of ontologies and determination of their similarity or dissimilarity. Determination of these similarities can be made with various types of methods like vector space measures or collection measures. It is appropriate to implement these methods due to problems and uncertainties which ontologies can bring. Ontology independence is one of the basic characteristics (open world assumption) and because of independence there can appear certain conflicts if exist two ontologies describing the same part of reality. There can be a problem when these two ontologies describe the same entity but with different label or in different structure. Nevertheless there are many other reasons for making these comparisons e.g. extension of semantic search engines or searching for similar ontologies which could be joined together. Solution of this problem can be found in ontology similarity measures. Currently there is no application like this which would provide methods for ontology measures. The main goal of this bachelor thesis is to create a web interface which will provide essential methods for determination of ontology similarity.
|
guest ::
