A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2767121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing iceberg concept lattices with Titanic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental concept formation approach for learning from databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-Based Mining and Inductive Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice / rank
 
Normal rank

Latest revision as of 17:04, 8 July 2024

scientific article
Language Label Description Also known as
English
A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
scientific article

    Statements

    A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2014
    0 references
    0 references
    pattern mining
    0 references
    formal concept analysis
    0 references
    frequent itemset
    0 references
    frequent generator
    0 references
    hypergraph
    0 references
    compound algorithm
    0 references
    0 references
    0 references
    0 references