\textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
From MaRDI portal
Publication:2279533
DOI10.1016/j.ins.2016.03.009zbMath1427.68303OpenAlexW2306890891MaRDI QIDQ2279533
Amira Mouakher, Sadok Ben Yahia
Publication date: 13 December 2019
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.03.009
Related Items (2)
On the efficient stability computation for the selection of interesting formal concepts ⋮ A methodology for analysis of concept lattice reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Formal context coverage based on isolated labels: an efficient solution for text feature extraction
- From-below approximations in Boolean matrix factorization: geometry and new algorithm
- Concept learning via granular computing: a cognitive viewpoint
- Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
- Theory of capacities
- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
- Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires
- Towards Concise Representation for Taxonomies of Epistemic Communities
- Discovery Science
- Relations binaires, fermetures, correspondances de Galois
- Using difunctional relations in information organization
This page was built for publication: \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
