In this paper we try to extend the Galois connection construction of K-Formal Concept Analysis to handle semifields which are not idempotent. Important examples of such algebras are the extended non-negative reals and the extended non-negative rationals, but we provide a construction that suggests that such semifields are much more abundant than suspected. This would broaden enormously the scope and applications of K-Formal Concept Analysis.CPM & FVA have been partially supported by the Spanish Government-MinECo projects TEC2014-53390-P and TEC2014-61729-EX
Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de feb...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value...
The word contributions of the title implies a full description of the algebraic structure of the sem...
In this paper we try to extend the Galois connection construction of K-Formal Concept Analysis to ha...
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in m...
We report on progress in characterizing K-valued FCA in algebraic terms, where K is an idempotent se...
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lat...
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We...
In Formal Concept Analysis the classical formal context is analized taking into account only the po...
Abstract. In this paper we justify the need for a generalisation of For-mal Concept Analysis for the...
In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose of...
This book presents the main ideas of General Galois Theory as a generalization of Classical Galois T...
In this chapter we give an overview of the aspects of the theory of finite semifields related to Gal...
AbstractFour levels of Galois connections are exhibited, starting with the classical one and going v...
This thesis examines two approaches to Galois correspondences in formal logic. A standard result of ...
Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de feb...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value...
The word contributions of the title implies a full description of the algebraic structure of the sem...
In this paper we try to extend the Galois connection construction of K-Formal Concept Analysis to ha...
In [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in m...
We report on progress in characterizing K-valued FCA in algebraic terms, where K is an idempotent se...
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lat...
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We...
In Formal Concept Analysis the classical formal context is analized taking into account only the po...
Abstract. In this paper we justify the need for a generalisation of For-mal Concept Analysis for the...
In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose of...
This book presents the main ideas of General Galois Theory as a generalization of Classical Galois T...
In this chapter we give an overview of the aspects of the theory of finite semifields related to Gal...
AbstractFour levels of Galois connections are exhibited, starting with the classical one and going v...
This thesis examines two approaches to Galois correspondences in formal logic. A standard result of ...
Actas de: XVII Congreso Español sobre Tecnologías y Lógica Fuzzy (ESTYLF 2014). Zaragoza, 5-7 de feb...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value...
The word contributions of the title implies a full description of the algebraic structure of the sem...