A novel approach to attribute reduction in formal concept lattices

Authors:
Jing Liu;Ju-Sheng Mi
Affiliations:
College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, Hebei, P.R. China;College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, Hebei, P.R. China
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 9
Cited 2

Knowledge acquisition by methods of formal concept analysis

Proceedings of the conference on Data analysis, learning symbolic and numeric knowledge
An incremental concept formation approach for learning from databases

Theoretical Computer Science - Special issue on formal methods in databases and software engineering
A lattice conceptual clustering system and its application to browsing retrieval

Machine Learning
Rough concept analysis: a synthesis of rough sets and formal concept analysis

Fundamenta Informaticae - Special issue: rough sets
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Sequential Association Rule Mining with Time Lags

Journal of Intelligent Information Systems
Development of a miniature self-stabilization jumping robot

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
A novel approach to attribute reduction in concept lattices

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Attribute reduction in concept lattice based on discernibility matrix

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II

A bit-chain based algorithm for problem of attribute reduction

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
Applying the JBOS reduction method for relevant knowledge extraction

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of concept lattice is an efficient tool for knowledge representation and knowledge discovery. One of the key problems of knowledge discovery is attribute reduction. This paper presents a novel approach to attribute reduction in formal concept lattices. The approach employs all the extents of the meet-irreducible elements in the lattice. Each of them determines a family of attribute sets common to the objects in the extent. By various combinations of minimal elements from each family we can produce reducts of the formal context. Furthermore, a related algorithm is developed, and an illustration example is employed to perform the reduction process of the proposed method.