On pruning techniques in map-reduce style CbO algorithms (Q2107482): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MapReduce / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Twister / 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.1007/s10472-022-09787-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210581435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making use of empty intersections to improve the performance of CbO-type algorithms / 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: Q4230685 / 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: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework / rank
 
Normal rank

Latest revision as of 23:30, 30 July 2024

scientific article
Language Label Description Also known as
English
On pruning techniques in map-reduce style CbO algorithms
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references