A computational procedure for variable selection preserving different initial conditions
From MaRDI portal
Publication:5030589
DOI10.1080/00207160.2019.1613530zbMath1484.68239OpenAlexW2943684925MaRDI QIDQ5030589
Dominik Ślęzak, Jesús Medina, Eloísa Ramírez-Poussa, M. José Benítez-Caballero
Publication date: 17 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2019.1613530
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (9)
Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ Value reducts and bireducts: A comparative study ⋮ Characterization of the infimum of classes induced by an attribute reduction in FCA ⋮ Rough sets based on Galois connections ⋮ Reducing concept lattices by means of a weaker notion of congruence ⋮ Impact of local congruences in variable selection from datasets ⋮ Generalized quantifiers in formal concept analysis ⋮ Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute ⋮ A weakened notion of congruence to reduce concept lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Multi-adjoint property-oriented and object-oriented concept lattices
- Multi-adjoint relation equations: definition, properties and solutions using concept lattices
- Attribute and size reduction mechanisms in multi-adjoint concept lattices
- Attribute reduction in multi-adjoint concept lattices
- Relations of reduction between covering generalized rough sets and concept lattices
- Attribute reduction based on generalized fuzzy evidence theory in fuzzy decision systems
- Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
- Characterizing reducts in multi-adjoint concept lattices
- Handbook of philosophical logic. Vol. I: Elements of classical logic
- Attribute selection with fuzzy decision reducts
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Variable precision rough set model
- A multi-level conceptual data reduction approach based on the Lukasiewicz implication
- Bireducts with tolerance relations
- Multi-adjoint fuzzy rough sets: definition, properties and attribute selection
- Comparison of reduction in formal decision contexts
- Data analysis based on discernibility and indiscernibility
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- On the use of thresholds in multi-adjoint concept lattices
- Rough sets
- Similarity relations in concept lattices
- Granular information retrieval using neighborhood systems
- Attribute Reduction in Rough Set Theory and Formal Concept Analysis
- Improved roughk-means clustering algorithm based on weighted distance measure with Gaussian function
- Thresholds and Shifted Attributes in Formal Concept Analysis of Data with Fuzzy Attributes
- Automated prover for attribute dependencies in data with grades
This page was built for publication: A computational procedure for variable selection preserving different initial conditions
