Extracting attribute implications from a formal context: unifying the basic approaches
From MaRDI portal
Publication:6658951
Recommendations
- Attribute reduction and rules extraction in decision formal context based on concept lattice
- Computing implications with negation from a formal context
- scientific article; zbMATH DE number 1163483
- Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts
- AI 2005: Advances in Artificial Intelligence
Cites work
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 43308 (Why is no real title available?)
- scientific article; zbMATH DE number 45267 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- A formal concept analysis approach to rough data tables
- A multiview approach for intelligent data analysis based on data operators
- Actionability and Formal Concepts: A Data Mining Perspective
- Canonical dichotomous direct bases
- Computing the Duquenne-Guigues basis: an algorithm for choosing the order
- Concept lattices with negative information: a characterization theorem
- Connecting concept lattices with bonds induced by external information
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- Data mining and machine learning. Fundamental concepts and algorithms
- Direct-optimal basis computation by means of the fusion of simplification rules
- Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts
- Formal concept analysis approach to understand digital evidence relationships
- Formal concept analysis via multi-adjoint concept lattices
- Functional Dependencies in a Relational Database and Propositional Logic
- Fuzzy Galois Connections
- Generating a condensed representation for association rules
- Leibniz's logic and the ``cube of opposition
- On heterogeneous formal contexts
- Preferences in discrete multi-adjoint formal concept analysis
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis
- Selection of appropriate bonds between \(\mathcal{L}\)-fuzzy formal contexts for recommendation tasks
- Simplification logic for the management of unknown information
- The multiple facets of the canonical direct unit implicational basis
- Theory and Applications of Relational Structures as Knowledge Instruments
- Two basic algorithms in concept analysis
- Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations
Cited in
(1)
This page was built for publication: Extracting attribute implications from a formal context: unifying the basic approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658951)
