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

DOI10.1016/J.INS.2017.11.028MaRDI QIDQ781866zbMATH OpenOpenAlexFDO

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

Publication date 20 July 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2017.11.028

zbMATH Keywords

high dimensionalityformal concept analysisbinary decision diagramsNextClosure

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Handling Large Formal Context Using BDD – Perspectives and Limitations
• Complex data analytics with formal concept analysis
• Knowledge representation using interval-valued fuzzy formal concept lattice
• Property-oriented concept lattice construction through the combination of formal contexts
• Concept lattice based knowledge discovery and its application to analysis of employment data in universities

Cites work

• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 4160798 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 3332577 (Why is no real title available?)
• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• A fast algorithm for building lattices
• Binary Decision Diagrams
• Comparing performance of algorithms for generating concept lattices
• Formal concept analysis as mathematical theory of concepts and concept hierarchies
• Formal concept analysis. Foundations and applications.
• Graph-Based Algorithms for Boolean Function Manipulation
• On computing the size of a lattice and related decision problems
• On the irredundant generation of knowledge spaces
• RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
• Two basic algorithms in concept analysis

Cited in

(8)

• Generalized decision directed acyclic graphs for classification tasks
• Triadic concept approximation
• Using fringes for minimal conceptual decomposition of binary contexts
• Variable-precision three-way concepts in \textbf{L}-contexts
• Describing hierarchy of concept lattice by using matrix
• Analysis of correlation and compressibility of high-dimensional categorical data
• Handling Large Formal Context Using BDD – Perspectives and Limitations
• A comparative study of decision implication, concept rule and granular rule

Describes a project that uses

Uses Software

• CUDD
• In-Close
• FCALGS

This page was built for publication: Handling high dimensionality contexts in formal concept analysis via binary decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781866)