Reduction method for concept lattices based on rough set theory and its application

DOI10.1016/j.camwa.2006.03.040zbMath1121.68113OpenAlexW1987334595MaRDI QIDQ2373828

Cheng Wu, Min Liu, Wen-Xiu Zhang, Ming-Wen Shao

Publication date: 16 July 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.03.040

zbMATH Keywords

schedulingrough setconcept latticeformal contextattribute reductionobject reduction

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (30)

Knowledge reduction in formal decision contexts based on an order-preserving mapping ⋮ Comparison of reduction in formal decision contexts ⋮ Granular matrix method of attribute reduction in formal contexts ⋮ Relating attribute reduction in formal, object-oriented and property-oriented concept lattices ⋮ An application of covering approximation spaces on network security ⋮ A new algebraic structure for formal concept analysis ⋮ Rule acquisition and attribute reduction in real decision formal contexts ⋮ A dynamic rule-based classification model via granular computing ⋮ Three-way reduction for formal decision contexts ⋮ Multi-adjoint property-oriented and object-oriented concept lattices ⋮ Knowledge reduction in real decision formal contexts ⋮ Attribute extended algorithm of lattice-valued concept lattice based on congener formal context ⋮ Connections between covering-based rough sets and concept lattices ⋮ Knowledge reduction in formal contexts using non-negative matrix factorization ⋮ OnL-fuzzy Chu correspondences ⋮ Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis ⋮ Fuzzy and rough formal concept analysis: a survey ⋮ On multi-adjoint concept lattices based on heterogeneous conjunctors ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices ⋮ A heuristic knowledge-reduction method for decision formal contexts ⋮ Attribute reduction in intuitionistic fuzzy concept lattices ⋮ Multi-adjoint t-concept lattices ⋮ Unnamed Item ⋮ Attribute reduction in generalized one-sided formal contexts ⋮ Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction ⋮ Characterizing reducts in multi-adjoint concept lattices ⋮ ATTRIBUTE REDUCTION OF CONCEPT LATTICE BASED ON IRREDUCIBLE ELEMENTS ⋮ Multi-adjoint fuzzy rough sets: definition, properties and attribute selection

Cites Work

• An incremental concept formation approach for learning from databases
• Monotone concepts for formal concept analysis
• Rough sets
• ROUGH SET THEORY AND ITS APPLICATIONS TO DATA ANALYSIS
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing
• Rough Set Approximations in Formal Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reduction method for concept lattices based on rough set theory and its application