Listing closed sets of strongly accessible set systems with applications to data mining (Q844900): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tamás L. Horváth / rank
Normal rank
 
Property / author
 
Property / author: Tamás L. Horváth / rank
 
Normal rank
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.1016/j.tcs.2009.10.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084044979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all closed sets: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708328 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Listing closed sets of strongly accessible set systems with applications to data mining
scientific article

    Statements

    Listing closed sets of strongly accessible set systems with applications to data mining (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2010
    0 references
    algorithms
    0 references
    listing
    0 references
    closure operator
    0 references
    data mining
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references