This paper extends standard help system technology to demonstrate the suitability of Formal Concept Analysis in displaying, searching and navigating help content. The paper introduces a method for building suitable scales directly from the help system index by computing a keyword extension set. The keyword extension technique is generalisable in any document collection where a hand-crafted inde...

In this talk I shall relate some of my experiences in teaching lattice theory and the theory of ordered sets to undergraduates since 1975. I will show how Formal Concept Analysis can be used as a unifying and motivating example in many parts of the theory.

We survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. The final version of this survey will appear in the Proceedings of the Int. Conf. Formal Concept Analysis, 2015.

We study similarity in formal concept analysis of data tables with graded attributes. We focus on similarity related to formal concepts and concept lattices, i.e. the outputs of formal concept analysis. We present several formulas for estimation of similarity of outputs in terms of similarity of inputs. The results answer some problems which arose in previous investigation as well as some natur...

Concealed question noun phrases headed by the definite article have been analysed as contributing the intension of the noun phrase –an individual concept– as semantic argument of the verb. Concealed questions with quantifiers challenge this analysis. Several empirical observations will be presented and an analysis will be sketched that treats this quantification as external to the concealed que...

In this paper we introduce a Web-based tool for the analysis of Genomic Expression (GE) data based in K-Formal Concept Analysis (KFCA). First we present the task of analysing GE data and then we describe the tool implementing KFCA. As a second contribution, we present a mechanism to visualise a sequence of concept lattices by fixing the intents against the concept lattice of the contranominal s...

An important goal in the fuzzy relation equations framework is to obtain the whole set of solutions. This paper introduces algebraic properties in the multi-adjoint concept lattice setting. Moreover, using the relationship between these concept lattices and multi-adjoint relation equations, the complete set of solutions of these general equations is characterized and computed, avoiding the nece...

An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of ...

This study discusses various theoretical perspectives on abstract concept formation. Students’ reasoning about abstract objects is described based on proposition that abstraction is a shift from abstract to concrete. Existing literature suggested a theoretical framework for the study. The framework describes process of abstraction through its elements: assembling, theoretical generalization int...

This paper proposes a new fuzzy FCA-based approach to conceptual clustering for automatic generation of concept hierarchy on uncertainty data. The proposed approach first incorporates fuzzy logic into Formal Concept Analysis (FCA) to form a fuzzy concept lattice. Next, a fuzzy conceptual clustering technique is proposed to cluster the fuzzy concept lattice into conceptual clusters. Then, hierar...