Suche
Anzeige der Dokumente 171-180 von 261
Aufsatz
Mining minimal non-redundant association rules using frequent closed itemsets
(2000)
The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their ...
Aufsatz
CEM - a conceptual Email manager
(2000)
CEM is an email management system which stores its email in a concept lattice rather than in the usual tree structure. By using such a conceptual multi-hierarchy, the system provides more flexibility in retrieving stored emails. The paper presents the underlying mathematical structures, discusses requirements for their maintenance and presents their implementation.
Aufsatz
Exploration tools in formal concept analysis
(1996)
The development of conceptual knowledge systems specifically requests knowledge acquisition tools within the framework of formal concept analysis. In this paper, the existing tools are presented, and furhter developments are discussed.
Aufsatz
CEM - visualization and discovery in Email
(2000)
This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allows a user to navigate email using a visual lattice metaphor rather than a tree structure. By using such a conceptual multi-hierarchy, the content and shape of the lattice can be varied to accommodate any number of queries against the email collection. The system provides more flexibility in retrieving stored emails and can be generalised to any electronic documents. The paper presents the underlying mathematical ...
Dissertation
Verknüpfung von Domänenwissen für ein Ontologie-basiertes IT-Management
(2018-05-14)
Mit der steigenden Komplexität von IT-Systemen wird auch die Verwaltung dieser Systeme komplexer. Den Fragestellungen, die sich durch diese Komplexität auf der Seite des Betriebs und der Überwachung von IT-Systemen stellen, wird durch integriertes und automatisiertes IT-Management begegnet, indem auch implizite Zusammenhänge zwischen Aspekten aus unterschiedlichen Sichten auf die Systeme berücksichtigt werden, sowie die weitgehende Eliminierung des manuellen Anteils bei Überwachung und Pflege der Systeme angestrebt ...
Dissertation
Evolving Distributed Algorithms with Genetic Programming
(2009-05-11)
Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile ...
Preprint
Shrinking restarting automata
(Universität Kassel, FB 17, Mathematik/Informatik, 2005)
Restarting automata are a restricted model of computation that was introduced by Jancar et.al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Thus, each language accepted by a restarting automaton belongs to the complexity class $CSL cap NP$. Here we consider a natural generalization of this model, ...
Preprint
5. Krypto-Tag - Workshop über Kryptographie
(2006)
Dieser Tagungsband enthält die gesammelten Zusammenfassungen der acht eingereichten Vorträge des 5. Krypto-Tags. Der Kryptotag ist eine zentrale Aktivität der Fachgruppe "Angewandte Kryptologie" der Gesellschaft für Informatik e.V. Er ist eine wissenschaftliche Veranstaltung im Bereich der Kryptologie und von der organisatorischen Arbeit der Fachgruppe getrennt.
Preprint
Learning analysis by reduction from positive data
(Universität Kassel, FB 17, Mathematik/Informatik, 2005)
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by SLT-R-automata with respect to the Chomsky hierarchy.