An incremental approach for attribute reduction in concept lattice

Authors:
Bin Yang;Baowen Xu;Yajun Li
Affiliations:
School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 10
Cited 0

Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods

International Journal of Man-Machine Studies
Rough concept analysis: a synthesis of rough sets and formal concept analysis

Fundamenta Informaticae - Special issue: rough sets
Reengineering class hierarchies using concept analysis

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Identifying Modules via Concept Analysis

IEEE Transactions on Software Engineering
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Locating Features in Source Code

IEEE Transactions on Software Engineering
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Reduction-Based approaches towards constructing galois (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

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the key problems of knowledge discovery is knowledge reduction. Concept lattice is an effective tool for data analysis and knowledge processing. The existing works on attribute reduction in concept lattice have mainly been focused on static database. This paper presents an incremental approach to identify reductions from dynamic database. The properties of attributes are discussed within the framework of equivalence classes and the determinant theorem of attribute reduction is presented. Based on the theorem, the reductions can be easily derived. The experimental results validate the effectiveness of the approach.