• Deutsch
    • English
  • Publish
  • About KOBRA  
    • About us
    • Policy
    • License
    • FAQ
    • Contact
  • 🇬🇧
    • Deutsch
    • English
  • Login
Search 
  •   KOBRA
  • Fachbereiche
  • Search
  •   KOBRA
  • Fachbereiche
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.


Diese Webseite benutzt Cookies.
COOKIE POLICY DER UNI. Close


Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-8 of 8

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Aufsatz Conceptual information systems discussed through an IT-security tool 

Becker, Klaus; Stumme, Gerd; Wille, Rudolf; Wille, Uta; Zwickwolff, Monika (2000)
Conceptual Information Systems are based on a formalization of the concept of "concept" as it is discussed in traditional philosophical logic. This formalization supports a human-centered approach to the development of Information Systems. We discuss this approach by means of an implemented Conceptual Information System for supporting IT security management in companies and organizations.
Thumbnail

Aufsatz A contextual-logic extension of TOSCANA 

Eklund, Peter; Groh, Bernd; Stumme, Gerd; Wille, Rudolf (2000)
The aim of this paper is to indicate how TOSCANA may be extended to allow graphical representations not only of concept lattices but also of concept graphs in the sense of Contextual Logic. The contextual-logic extension of TOSCANA requires the logical scaling of conceptual and relatioal scales for which we propose the Peircean Algebraic Logic as reconstructed by R. W. Burch. As graphical representations we recommend, besides labelled line diagrams of concept lattices and Sowa's diagrams of conceptual graphs, particular ...
Thumbnail

Aufsatz Mining minimal non-redundant association rules using frequent closed itemsets 

Bastide, Yves; Pasquier, Nicolas; Taouil, Rafik; Stumme, Gerd; Lakhal, Lotfi (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 ...
Thumbnail

Aufsatz CEM - visualization and discovery in Email 

Cole, Richard; Eklund, Peter; Stumme, Gerd (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 ...
Thumbnail

Aufsatz Conceptual knowledge discovery and data analysis 

Hereth, Joachim; Stumme, Gerd; Wille, Rudolf; Wille, Uta (2000)
In this paper, we discuss Conceptual Knowledge Discovery in Databases (CKDD) in its connection with Data Analysis. Our approach is based on Formal Concept Analysis, a mathematical theory which has been developed and proven useful during the last 20 years. Formal Concept Analysis has led to a theory of conceptual information systems which has been applied by using the management system TOSCANA in a wide range of domains. In this paper, we use such an application in database marketing to demonstrate how methods and ...
Thumbnail

Aufsatz CEM - a conceptual Email manager 

Cole, Richard; Stumme, Gerd (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.
Thumbnail

Aufsatz Fast computation of concept lattices using data mining techniques 

Stumme, Gerd; Taouil, Rafik; Bastide, Yves; Pasquier, Nicolas; Lakhal, Lotfi (2000)
We present a new algorithm called TITANIC for computing concept lattices. It is based on data mining techniques for computing frequent itemsets. The algorithm is experimentally evaluated and compared with B. Ganter's Next-Closure algorithm.
Thumbnail

Aufsatz 8th International Conference on Conceptual Structures: logical, linguistic, and computational issues 

Stumme, Gerd (2000)

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV
 

 

Browse

All of KOBRACommunities & CollectionsBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access This CommunityBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access

Discover

  • Date Issued
    2000 (8)
  • Publication typeArticle  (8)
  • Keyword (DDC)
    004 (8)
  • Open access open access (8)

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV