Approximating Concept Stability

DOI10.1007/978-3-642-29892-9_7zbMath1360.68798OpenAlexW148682849MaRDI QIDQ2907456

Mikhail A. Babin, Sergei O. Kuznetsov

Publication date: 10 September 2012

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29892-9_7

zbMATH Keywords

computational complexityapproximate countingconcept stability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (12)

Cloud data processing using granular based weighted concept lattice and Hamming distance ⋮ Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Fuzzy concept lattice reduction using Shannon entropy and Huffman coding ⋮ On interestingness measures of formal concepts ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ On the efficient stability computation for the selection of interesting formal concepts ⋮ Approximating concept stability using variance reduction techniques ⋮ A methodology for analysis of concept lattice reduction ⋮ On the calculation of formal concept stability ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis ⋮ An Efficient Approximation of Concept Stability Using Low-Discrepancy Sampling

This page was built for publication: Approximating Concept Stability