Formal Concept Analysis "FCA" is a data analysis method which enables to discover hidden knowledge existing in data. A kind of hidden knowledge extracted from data is association rules. Di erent Interestingness Measures "IMs" were reported in the literature to extract only relevant association rules. Given a dataset, the choice of a good interestingness measure remains a challenging task for a ...

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...

Identifying functions shared by genes responsible for cancer is a challenging task. This paper describes the preparation work for applying Formal Concept Analysis (FCA) to complex biological data. We present here a preliminary experiment using these data on a core context with the addition of domain knowledge. The resulting concept lattices are explored and some interesting concepts are discuss...

Propositional Dynamic Logic (PDL) has been introduced by M.J. Fischer and R.E. Ladner as an extension of the classical propositional logic and propositional modal logic K for reasoning about partial correctness of structured nondeterministic programs. Many variants of PDL have been studied extensively especially from viewpoint of decidability and axiomatizability. In particular, recently C. Lut...

To date, most of the XML native databases (DB) flexible querying systems are based on exploiting the tree structure of their semi structured data (SSD). However, it becomes important to test the efficiency of Formal Concept Analysis (FCA) formalism for this type of data since it has been proved a great performance in the field of information retrieval (IR). So, the IR in XML databases based on ...

Fuzzy Cellular Automata (FCA) are special couple map lattices that generalize Boolean cellular automata by allowing continuous values for the cell states. The local transition rule of a FCA is the “fuzzification" of the disjunctive normal form that describes the local function of the corresponding Boolean cellular automata. Recently there has been some interest in elementary Fuzzy cellular auto...

Business Intelligence solutions provide different means like OLAP, data mining or case based reasoning to explore data. Standard BI means are usually based on mathematical statistics and provide a quantitative analysis of the data. In this paper, a qualitative approach based on a mathematical theory called ”Formal Concept Analysis” (FCA) is used instead. FCA allows clustering a given set of obj...

Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (FCA) tools taking into account structured data. There are a few adaptations of the classical FCA methodology for handling contexts holding on complex data formats, e.g. graph-based or relational data. In this paper, relational concept analysis (RCA) is proposed, as an adaptation of FCA for an...

Development of immunity in cross-bred (Bos taurus x Bos indicus) calves against Hyalomma anatolicum anatolicum, vector of bovine tropical theileriosis, was studied using larval antigen (LS) in Freund's complete adjuvant (FCA). Calves immunized with LS + FCA showed significant rejection of larvae (57.25 +/- 6.8) and nymphs (45.75 +/- 5.16). Abnormally fed larvae (11.4 +/- 0.8) and nymphs (8.25 +...

This paper describes the evaluation of coursework set for final year degree students designed to teach Formal Concept Analysis (FCA). The usefulness of this approach is discussed with respect to its application in future iterations of the coursework. The source data was the result of a simulation between competing student teams undertaken on a mainstream ERP system provided by the business soft...