Typed Formal Concept Analysis
نویسندگان
چکیده
Formal Concept Analysis (FCA) appears to be ideal for interpreting data in domains that are a-priori unstructured. In our research we focus on complex contexts with very large and rapidly changing numbers of real-world objects – for instance, data generated on-line and tracking real-time contexts in transport, enterprise warehousing, manufacturing control or social networking activities on the web. The ontology of such contexts, i.e., the types of attribute data and those of objects, and their interrelation (such as subtyping or which objects have which attributes or reference which other objects via surrogate attributes) is partly known to domain experts. Because of incomplete knowledge however, missing classes and relationships need to be inferred. In addition, domain experts need assistance in checking the partial ontology declarations against FCA interpretations added to the context. To make FCA more accessible in such applications, we explore the use of types similar to those available in object-oriented design and programming, for which methods, tools, training and skills are widely available. We present typed FCA and report about supporting tools. We also introduce typed priming and show that it is consistent with conceptual scaling without requiring the generation of binary lattices.
منابع مشابه
Concepts and Types - An Application to Formal Language Theory
We investigate how formal concept analysis can be applied in a type-theoretic context, namely the context of λ-terms typed à la Curry. We first show some general results, which reveal that concept lattices generally respect and reflect the type structure of terms. Then, we show an application of the results in formal language theory, where we vastly generalize existing approaches of capturing t...
متن کاملDesign by Contract for Python
The idea of design by contract (DBC), realized in the statically typed object-oriented programming language Eiffel, can be viewed as a systematic approach to specifying and implementing object-oriented software systems. We believe that a statically typed programming language is not suitable in the analysis and design phase of a prototyping-oriented software life cycle. For this purpose, dynamic...
متن کاملOverview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic concept where visual languages are defined by attributed type graphs only and model transformations by basic typed attributed graph transformation systems. We continue with different kinds of extensions of the basic concept...
متن کاملTwo Formal Representations of the Thematic-Rhematic Structure of Sentences
In this paper, we give two formal representations of the thematic-rhematic (T-R) structure of a natural language discourse. One is based on the concept of ontological promiscuity and the other based on a typed A-calculus.
متن کاملFixed points of adjoint functors enriched in a quantaloid
Representation theorems are established for fixed points of adjoint functors between categories enriched in a small quantaloid. In a very general setting these results set up a common framework for representation theorems of concept lattices in formal concept analysis (FCA) and rough set theory (RST), which not only extend the realm of formal contexts to multi-typed and multi-valued ones, but a...
متن کامل