0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices

DOI10.1007/s00500-018-3352-1zbMath1415.68225OpenAlexW2810355536MaRDI QIDQ2001133

Dongxiao Zhang, Lifeng Li

Publication date: 2 July 2019

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-018-3352-1

zbMATH Keywords

concept latticeattribute reduction0-1 linear integer programminggranule knowledge reduction

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Knowledge representation (68T30)

Related Items (3)

Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ Granular matrix method of attribute reduction in formal contexts ⋮ Three-way reduction for formal decision contexts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knowledge reduction in real decision formal contexts
• Attribute and size reduction mechanisms in multi-adjoint concept lattices
• Attribute reduction in multi-adjoint concept lattices
• Concept learning via granular computing: a cognitive viewpoint
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. I.
• Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II.
• Fuzzy inference based on fuzzy concept lattice
• Treatment of L-fuzzy contexts with absent values
• Formal concept analysis via multi-adjoint concept lattices
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• Concept lattices and order in fuzzy logic
• Monotone concepts for formal concept analysis
• Attribute reduction theory of concept lattice based on decision formal contexts
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• Multi-adjoint t-concept lattices
• Attribute reduction in generalized one-sided formal contexts
• Rule acquisition and complexity reduction in formal decision contexts
• Reduction method for concept lattices based on rough set theory and its application
• Variable threshold concept lattices
• On the use of thresholds in multi-adjoint concept lattices
• Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Formal Concept Analysis
• A Generalized Concept Lattice

This page was built for publication: 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices