Handling high dimensionality contexts in formal concept analysis via binary decision diagrams-Reference-Cited by-同舟云学术

Handling high dimensionality contexts in formal concept analysis via binary decision diagrams

Published:2018-03 Issue: Volume:429 Page:361-376
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Neto Sebastiao M.,Zárate Luis E.,Song Mark A.J.

Funder

FAPEMIG

CNPq

CAPES

Publisher

Elsevier BV

Subject

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

Reference50 articles.

1. Binary decision diagrams;Akers;Comput. IEEE Trans.,1978

2. S. Andrews, In-close, a fast algorithm for computing formal concepts (2009).

3. In-close2, A High Performance Formal Concept Miner;Andrews,2011

4. A partial-closure canonicity test to increase the efficiency of cbo-type algorithms;Andrews,2014

5. A best-of-breed approach for designing a fast algorithm for computing fixpoints of galois connections;Andrews;Inf. Sci.,2015

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

1. Securing the Future;Advances in IT Standards and Standardization Research;2024-05-31

2. Z-TCA: Fast Algorithm for Triadic Concept Analysis Using Zero-suppressed Decision Diagrams;Journal of Information Processing;2023

3. Dynamically constructing semantic topic hierarchy through formal concept analysis;Multimedia Tools and Applications;2022-08-18

4. Incremental method of generating decision implication canonical basis;Soft Computing;2021-11-22

5. Variable-precision three-way concepts in L-contexts;International Journal of Approximate Reasoning;2021-03