An incremental algorithm to construct a lattice of set intersections
From MaRDI portal
Publication:1001808
DOI10.1016/j.scico.2008.09.015zbMath1156.68056WikidataQ62046328 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
Related Items
An entropy-based weighted concept lattice for merging multi-source geo-ontologies, Constructing three-way concept lattice based on the composite of classical lattices, Contribution to attributive and object subcontexts in inferring good maximally redundant tests, Rules acquisition of formal decision contexts based on three-way concept lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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