Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-013-9355-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980045446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute-incremental construction of the canonical implication basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for inferring functional dependencies from relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple facets of the canonical direct unit implicational basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Berge Multiplication for Monotone Boolean Dualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of enumerating pseudo-intents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Enumerating Pseudo-intents in the Lectic Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Basic Algorithms in Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5058462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5429564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute Exploration Using Implications with Proper Premises / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Notes on Pseudo-closed Sets / rank
 
Normal rank

Latest revision as of 17:04, 8 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for implication bases and attribute exploration using proper premises
scientific article

    Statements

    Fast algorithms for implication bases and attribute exploration using proper premises (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2014
    0 references
    formal concept analysis
    0 references
    proper premises
    0 references

    Identifiers