Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de febrero de 2014.Complete dioids are already complete residuated lattices. Formal contexts with entries in them generate Concept Lattices with the help of the polar maps. Previous work has already established the spectral nature of some formal concepts for contexts over certain kinds of dioids. This paper tries to raise the awareness that linear algebra over exotic semirings should be one place to look to understand the properties of FCA over L-lattices.FJVA was partially supported by EU FP7 project LiMoSINe (contract 288024) for this research. CPM was partially supported by the Spanish Government-Comisión Interministerial de Ciencia y Tecnología...
Abstract. In this paper we justify the need for a generalisation of For-mal Concept Analysis for the...
Formal Concept Analysis (FCA) is an exploratory data analysis technique for boolean relations based ...
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in ...
Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de feb...
Proceedings of: 10th International Conference on Concept Lattices and Their Applications. (CLA 2013)...
We report on progress in characterizing K-valued FCA in algebraic terms, where K is an idempotent se...
Motivated by some spectral results in the characterization of concept lattices we investigate the sp...
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lat...
In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose o...
In this paper we try to extend the Galois connection construction of K-Formal Concept Analysis to ha...
Previous work has shown a relation between L-valued extensions of Formal Concept Analysis and the sp...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value...
Abstract. In this paper we justify the need for a generalisation of For-mal Concept Analysis for the...
Formal Concept Analysis (FCA) is an exploratory data analysis technique for boolean relations based ...
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in ...
Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de feb...
Proceedings of: 10th International Conference on Concept Lattices and Their Applications. (CLA 2013)...
We report on progress in characterizing K-valued FCA in algebraic terms, where K is an idempotent se...
Motivated by some spectral results in the characterization of concept lattices we investigate the sp...
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lat...
In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose o...
In this paper we try to extend the Galois connection construction of K-Formal Concept Analysis to ha...
Previous work has shown a relation between L-valued extensions of Formal Concept Analysis and the sp...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value...
Abstract. In this paper we justify the need for a generalisation of For-mal Concept Analysis for the...
Formal Concept Analysis (FCA) is an exploratory data analysis technique for boolean relations based ...
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in ...