An incremental algorithm to construct a lattice of set intersections
type: Item
instance of: scholarly article
title: An incremental algorithm to construct a lattice of set intersections
zbMATH Open document ID: 1156.68056
author: Derrick Kourie
author: Sergei Obiedkov
author: B. W. Watson
author: Dean van der Merwe
published in: Science of Computer Programming
publication date: 2009-02-19T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 06B99
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5509475
zbMATH Keywords: concept lattice
zbMATH Keywords: closure system
zbMATH Keywords: incremental algorithm
zbMATH Keywords: correctness by construction
describes a project that uses: UCI-ml
describes a project that uses: AddIntent
MaRDI profile type: Publication
full work available at URL: j.scico.2008.09.015
OpenAlex ID: W2027893444
Wikidata QID: Q62046328
cites work: Q3952147
cites work: Q4230685
cites work: Q4674794
cites work: Q5493141
cites work: Towards Concise Representation for Taxonomies of Epistemic Communities
cites work: Concept Lattices
cites work: Galois lattice as a framework to specify building class hierarchies algorithms
cites work: Q5493146
cites work: Comparing performance of algorithms for generating concept lattices
cites work: Q5841991
cites work: Q4530231
cites work: Q4781231
cites work: A fast algorithm for building lattices
cites work: Q4170725
cites work: Compressed pseudo-lattices
cites work: Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
DOI: 10.1016/J.SCICO.2008.09.015
description: scientific article; zbMATH DE number 5509475