Lindig’s Algorithm for Concept Lattices over Graded Attributes
From MaRDI portal
Publication:3603427
DOI10.1007/978-3-540-73729-2_15zbMath1181.68269OpenAlexW59195221MaRDI QIDQ3603427
Jan Outrata, Radim Bělohlávek, Bernard De Baets, Vilem Vychodil
Publication date: 17 February 2009
Published in: Modeling Decisions for Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73729-2_15
Related Items (6)
Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis ⋮ Multi-adjoint relation equations: definition, properties and solutions using concept lattices ⋮ On multi-adjoint concept lattices based on heterogeneous conjunctors ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts
This page was built for publication: Lindig’s Algorithm for Concept Lattices over Graded Attributes