A Linear Delay Algorithm for Building Concept Lattices

DOI10.1007/978-3-540-69068-9_20MaRDI QIDQ3506954zbMATH OpenOpenAlexFDO

Authors Martin Farach-Colton, Yang Huang

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_20

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1898282
• A fast algorithm for building lattices
• Comparing performance of algorithms for generating concept lattices
• A partition-based approach towards constructing Galois (concept) lattices
• A fast incremental algorithm for building lattices

Cited in

(11)

• An incremental algorithm to construct a lattice of set intersections
• A fast algorithm for building lattices
• Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
• A partition-based approach towards constructing Galois (concept) lattices
• A convexity upper bound for the number of maximal bicliques of a bipartite graph
• Improving the performance of Lindig-style algorithms with empty intersections
• Hierarchic construction of concept lattices
• scientific article; zbMATH DE number 4160798 (Why is no real title available?)
• scientific article; zbMATH DE number 1898282 (Why is no real title available?)
• Formal Concept Analysis
• Concept Lattices

This page was built for publication: A Linear Delay Algorithm for Building Concept Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506954)