A fast attribute reduction method for large formal decision contexts
From MaRDI portal
Publication:1999570
DOI10.1016/j.ijar.2018.12.002zbMath1456.68189OpenAlexW2902288057WikidataQ128820726 ScholiaQ128820726MaRDI QIDQ1999570
Bin Xie, Jinkun Chen, Ju-Sheng Mi, Yao-Jin Lin
Publication date: 27 June 2019
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2018.12.002
Related Items
Dependence space models to construct concept lattices ⋮ An updated method of granular reduct based on cognitive operators in formal contexts ⋮ Value reducts and bireducts: A comparative study ⋮ Characterization of the infimum of classes induced by an attribute reduction in FCA ⋮ Reducing concept lattices by means of a weaker notion of congruence ⋮ Belief function of Pythagorean fuzzy rough approximation space and its applications ⋮ Three-way dual concept analysis ⋮ Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context ⋮ Optimal granule level selection: a granule description accuracy viewpoint ⋮ Quantitative three-way class-specific attribute reducts based on region preservations ⋮ Incremental concept-cognitive learning based on attribute topology ⋮ Impact of local congruences in variable selection from datasets ⋮ A model of three-way decisions for knowledge harnessing ⋮ A weakened notion of congruence to reduce concept lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block relations in formal fuzzy concept analysis
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Connections between covering-based rough sets and concept lattices
- Local multigranulation decision-theoretic rough sets
- Three-way concept learning based on cognitive operators: an information fusion viewpoint
- Relations of reduction between covering generalized rough sets and concept lattices
- A heuristic knowledge-reduction method for decision formal contexts
- Power contexts and their concept lattices
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
- Concept analysis via rough set and AFS algebra
- A fast algorithm for building lattices
- Matrix representations and interdependency on \(L\)-fuzzy covering-based approximation operators
- Closure structures parameterized by systems of isotone Galois connections
- Double-quantitative decision-theoretic rough set
- Knowledge reduction in formal contexts using non-negative matrix factorization
- Attribute reduction theory of concept lattice based on decision formal contexts
- Attribute reduction in generalized one-sided formal contexts
- Three-way decision approaches to conflict analysis using decision-theoretic rough set theory
- Rule acquisition and complexity reduction in formal decision contexts
- Comparison of reduction in formal decision contexts
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Approaches to knowledge reduction in generalized consistent decision formal context
- Variable threshold concept lattices
- Granular computing and dual Galois connection
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- Why can concept lattices support knowledge discovery in databases?
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Concept Lattices
This page was built for publication: A fast attribute reduction method for large formal decision contexts
