Concept lattices with negative information: A characterization theorem-Reference-Cited by-同舟云学术

Concept lattices with negative information: A characterization theorem

Published:2016-11 Issue: Volume:369 Page:51-62
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Rodriguez-Jimenez J.M.^ORCID,Cordero P.,Enciso M.,Rudolph S.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference22 articles.

1. Algorithms for k-meet-semidistributive lattices;Beaudou,2016

2. The multiple facets of the canonical direct unit implicational basis;Bertet;Theor. Comput. Sci.,2010

3. Towards the tractable discovery of association rules with negations;Boulicaut;Adv. Soft Comput.,2001

4. Two basic algorithms in concept analysis;Ganter;Lect. Notes Comput. Sci.,2010

5. Finite distributive concept algebras;Ganter;Order,2006

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extracting attribute implications from a formal context: Unifying the basic approaches;Information Sciences;2025-01

2. Methods for concept analysis and multi-relational data mining: a systematic literature review;Knowledge and Information Systems;2024-05-30

3. Mining for Unknown Unknowns;Electronic Proceedings in Theoretical Computer Science;2023-07-11

4. Simplification logic for the management of unknown information;Information Sciences;2023-07

5. Research on mixed decision implications based on formal concept analysis;International Journal of Cognitive Computing in Engineering;2023-06