Application of discrimination degree for attributes reduction in concept lattice

Authors:
Ming Li;De-San Yang
Affiliations:
School of Computer and Communication, Lanzhou University of Technology, Lanzhou, Gansu, P. R. China;School of Computer and Communication, Lanzhou University of Technology, Lanzhou, Gansu, P. R. China
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 4
Cited 0

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Galois connection, formal concepts and Galois lattice in real relations: application in a real classifier

Journal of Systems and Software - Special issue on artificial and computational intelligence for decisions, control, and automation in engineering and industrial applications
Mining formal concepts with a bounded number of exceptions from transactional data

KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Neighborhood systems and approximate retrieval

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new concept, discrimination degree theory, which is complementary of inclusion degree. Then the theoretical and practical significance of the discrimination degree is discussed, and the concept formation theorem of discrimination degree is given. The relationship between the discrimination degree and discernibility matrix is explained in attributes reduction of formal context. Finally, under a biology formal context, concept lattice is built after attributes reduced. By comparison with the lattice which didn't reduce attributes, it shows that reduction make the complexity of building lattice distinctly simplified while the key information is still retained.