Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vilem Vychodil / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FCALGS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AddIntent / 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.ins.2011.09.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047142510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk biclustering for microarray data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices of Fixed Points of Fuzzy Galois Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery of optimal factors in binary data via a novel method of matrix decomposition / 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: Efficient Algorithms for Listing Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithm for computing fixpoints of Galois connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of Data Structures for Computing Formal Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the size of a lattice and related decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing performance of algorithms for generating concept lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down mining of frequent closed patterns from very high dimensional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-adjoint t-concept lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concept Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical classification and clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952147 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
scientific article

    Statements

    Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (English)
    0 references
    0 references
    0 references
    8 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Galois connection
    0 references
    object-attribute data
    0 references
    formal concept analysis
    0 references
    frequent itemset mining
    0 references
    0 references
    0 references
    0 references
    0 references