Enumerating all maximal biclusters in numerical datasets (Q2292925): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: In-Close / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964274578 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.3562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing functional dependencies in formal concept analysis with pattern structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration aspects of maximal cliques and bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclustering Numerical Data in Formal Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all connected maximal common subgraphs in two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical aspects of concept analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank

Latest revision as of 17:41, 21 July 2024

scientific article
Language Label Description Also known as
English
Enumerating all maximal biclusters in numerical datasets
scientific article

    Statements

    Enumerating all maximal biclusters in numerical datasets (English)
    0 references
    0 references
    0 references
    6 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    efficient enumeration
    0 references
    maximal biclusters
    0 references
    numerical datasets
    0 references
    multiple types of biclusters
    0 references
    perfect and perturbed biclusters
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references