Relating attribute reduction in formal, object-oriented and property-oriented concept lattices

117Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Attribute reduction is an important step in reducing computational complexity in order to extract information from relational systems. Three of these systems are the formal, object-oriented and property oriented concept lattices. Attribute reduction in the last two concept lattices has recently been studied. The relation with the first concept lattice is very important since two important, independent tools to extract information from databases-the formal concept analysis and rough set theory-will be related. This paper studies attribute reduction in these three frameworks. The main results are that the classification of each attribute into absolutely necessary, relatively necessary and absolutely unnecessary attributes is independent of the framework considered and that an attribute reduct in one of these relational systems is also an attribute reduct in the others. © 2012 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Medina, J. (2012). Relating attribute reduction in formal, object-oriented and property-oriented concept lattices. Computers and Mathematics with Applications, 64(6), 1992–2002. https://doi.org/10.1016/j.camwa.2012.03.087

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free