We extend a newly developed formal system for the description of astrophysical maps. In this formalism, we consider the difference between maps to be the distance between elements of a pseudometric space (the space of all such maps). This ansatz allows us to measure quantitatively the difference between any two maps and to order the space of all maps. For each physical characteristic of interes...

Increasingly, researchers and developers of knowledge based systems (KBS) have been incorporating the notion of context. For instance, Repertory Grids, Formal Concept Analysis (FCA) and Ripple-Down Rules (RDR) all integrate either implicit or explicit contextual information. However, these methodologies treat context as a static entity, neglecting many connectionists’ work in learning hidden an...

In this paper, some fixed and periodic point theorems are established in fuzzy cone metric space for generalized contraction mappings and the main theorem is justified by a counter example. 2010 AMS Classification: : 54A40, 03E72

Level-of-detail is a concept well-known in computer graphics to reduce the number of rendered polygons. Depending on the distance to the subject (viewer), the objects' representation is changed. A similar concept is the clustering of sound sources for sound spatialization. Clusters can be used to hierarchically organize mixels and to optimize the use of resources, by grouping multiple sources t...

Goals. Probabilistic model checking has matured immensely in the past decade [1,2,3,4]. Applications and uses go far beyond the standard algorithms and objectives. We therefore developed an extensible toolbox for probabilistic model checking that offers reusable modules to quickly implement new functionality. The rise of more and more specialized tools witnesses that a single tool is rarely sui...

The existence of a compression scheme for every concept class with bounded VC-dimension is one of the oldest open problems in statistical learning theory. Here we demonstrate the existence of such compression schemes under stronger assumptions than finite VCdimension. Specifically, for each concept class we associate a family of concept classes that we call the alternating concept classes. Unde...

This paper aims at comparing transformation-based approaches built to deal with relational data, and in particular two approaches which have emerged in two different communities: Relational Concept Analysis (RCA), based on an iterative use of the classical Formal Concept Analysis (FCA) approach, and Propositionalisation coming from the Inductive Logic Programming community. Both approaches work...

Concept lattices can significantly improve machine translation systems when applied as filters to their results. We have developed a rule-based machine translator from Turkish to English in a unification-based programming paradigm and supplemented it with an automatically constructed concept lattice. The test results achieved by applying this translation system to a Turkish child story reveals ...

In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois Lattice as classifier. The structural signatures are based on topological graphs computed from segments which are extracted from the symbol images by using an adapted Hough transform. These structural signatures, which can be seen as dynamic paths which carry high level information, are robu...

With the increase in Web of Data (WOD) many new challenges regarding exploration, interaction, analysis and discovery have surfaced. One of the basic building blocks of data analysis is classification. Many studies have been conducted concerning Formal Concept Analysis (FCA) and its variants over WOD. But one fundamental question is, after these concept lattices are obtained on top of WOD, how ...