Concept lattices with negative information: a characterization theorem. (English) Zbl 1428.68290

Summary: Classical Formal Concept Analysis (FCA) extracts, represents and manages knowledge from positive information, i.e., its fundamental data model is a binary relation between a set of objects and attributes indicating the presence of a property in an object. However, some applications require to treat the absence of some property in an object as a negative information to be explicitly represented and managed, too. Although mixed (positive and negative) information has been addressed in the past in FCA, such approaches maintain the standard framework, which hides the specific semantics and avoids the further use of direct techniques and methods for mixed information. In this work, the foundations of FCA are extended and, in particular, mixed concept lattices are studied in depth. The main result of this work is a characterization theorem specifying in lattice-theoretic terms which lattices are isomorphic to a mixed concept lattice.


68T30 Knowledge representation
06A15 Galois correspondences, closure operators (in relation to ordered sets)
06B23 Complete lattices, completions
Full Text: DOI


[1] Beaudou, L.; Mary, A.; Nourine, L., Algorithms for k-meet-semidistributive lattices, Theoretical Computer Science (2016) · Zbl 1357.68287
[2] Bertet, K.; Monjardet, B., The multiple facets of the canonical direct unit implicational basis, Theor. Comput. Sci., 411, 22-24, 2155-2166 (2010) · Zbl 1209.68187
[3] Boulicaut, J.; Bykowski, A.; Jeudy, B., Towards the tractable discovery of association rules with negations, Adv. Soft Comput., 425-434 (2001)
[4] Ganter, B., Two basic algorithms in concept analysis, Lect. Notes Comput. Sci., 5986, 312-340 (2010) · Zbl 1274.68484
[5] Ganter, B.; Kwuida, L., Finite distributive concept algebras, Order, 23, 2-3, 235-248 (2006) · Zbl 1108.03060
[6] Ganter, B.; Kwuida, L., Which concept lattices are pseudocomplemented?, Lect. Notes Comput Sci, 3403, 408-416 (2005) · Zbl 1078.06006
[7] Ganter, B.; Wille, R., Formal Concept Analysis: Mathematical Foundations (1997), Springer
[8] Gasmi, G.; Yahia, S. B.; Nguifo, E. M.; Bouker, S., Extraction of association rules based on literalsets, Lect Notes Comput Sci, 4654, 293-302 (2007)
[9] Grätzer, G., General lattice theory, Birkhäuser Verlag (1998) · Zbl 0385.06015
[10] Guigues, J. L.; Duquenne, V., Familles minimales d’implications informatives résultant d’un tableau de données binaires, Mathématiques et Sciences Humaines, 95, 5-18 (1986)
[11] Kuznetsov, S. O., Machine learning and formal concept analysis, Lect. Notes Comput. Sci., 2961, 287-312 (2004) · Zbl 1198.68194
[12] Kuznetsov, S. O.; Revenko, A., Interactive error correction in implicative theories, Int. J. Approx. Reason., 63, 89-100 (2015) · Zbl 1346.68192
[13] Kwuida, L.; Tepavcevic, A.; Seselja, B., Negation in contextual logic, Lect. Notes Comput. Sci., 3127, 227-241 (2004) · Zbl 1104.68730
[14] Missaoui, R.; Nourine, L.; Renaud, Y., Generating positive and negative exact rules using formal concept analysis: problems and solutions, Lect. Notes Comput. Sci., 4933, 169-181 (2008) · Zbl 1131.68541
[15] Missaoui, R.; Nourine, L.; Renaud, Y., An inference system for exhaustive generation of mixed and purely negative implications from purely positive ones, CEUR Workshop Proc., 672, 271-282 (2010)
[16] Missaoui, R.; Nourine, L.; Renaud, Y., Computing implications with negation from a formal context, Fundam. Inform., 115, 4, 357-375 (2012) · Zbl 1241.68112
[17] Revenko, A.; Kuznetsov, S. O., Finding errors in new object intents, CEUR Workshop Proc., 972, 151-162 (2012)
[18] Rodríguez-Jiménez, J. M.; Cordero, P.; Enciso, M.; Mora, A., Negative attributes and implications in formal concept analysis, Procedia Comput. Sci., 31, 758-765 (2014)
[19] Rodríguez-Jiménez, J. M.; Cordero, P.; Enciso, M.; Mora, A., A generalized framework to consider positive and negative attributes in formal concept analysis, CEUR Workshop Proc., 1252, 267-278 (2014)
[20] Rodriguez-Jimenez, J. M.; Cordero, P.; Enciso, M.; Mora, A., Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis, Math. Methods. Appl. Sci. (2016) · Zbl 1392.68398
[21] Wild, M., The joy of implications, aka pure horn functions: mainly a survey, Theor. Comput. Sci. (2016)
[22] Wille, R., Boolean concept logic, Lect. Notes Comput. Sci., 1867, 317-331 (2000) · Zbl 0973.03035
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.