An incremental algorithm to construct a lattice of set intersections

DOI10.1016/j.scico.2008.09.015zbMath1156.68056OpenAlexW2027893444WikidataQ62046328 ScholiaQ62046328MaRDI QIDQ1001808

Derrick G. Kourie, Bruce W. Watson, Sergei Obiedkov, Dean van der Merwe

Publication date: 19 February 2009

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2008.09.015

zbMATH Keywords

concept latticeclosure systemincremental algorithmcorrectness by construction

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Lattices (06B99)

Related Items (4)

Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ Constructing three-way concept lattice based on the composite of classical lattices ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ An entropy-based weighted concept lattice for merging multi-source geo-ontologies

Uses Software

• AddIntent
• UCI-ml

Cites Work

• A fast algorithm for building lattices
• Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
• Compressed pseudo-lattices
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• Comparing performance of algorithms for generating concept lattices
• Towards Concise Representation for Taxonomies of Epistemic Communities
• Concept Lattices
• Concept Lattices
• Concept Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An incremental algorithm to construct a lattice of set intersections