Closed and noise-tolerant patterns in \(n\)-ary relations (Q2377278): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-Based Mining and Inductive Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining Constrained Cross-Graph Cliques in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-way set enumeration in weight tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767121 / 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 Efficient Algorithm for Enumerating Pseudo Cliques / rank
 
Normal rank

Latest revision as of 13:55, 6 July 2024

scientific article
Language Label Description Also known as
English
Closed and noise-tolerant patterns in \(n\)-ary relations
scientific article

    Statements

    Closed and noise-tolerant patterns in \(n\)-ary relations (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    Boolean tensor
    0 references
    multi-way set
    0 references
    fault-tolerance
    0 references
    cross-graph quasi-clique
    0 references

    Identifiers