Connections between covering-based rough sets and concept lattices
Authors:
- Anhui TanATAnhui Tan
- Jinjin LiJLJinjin Li
- Guoping LinGLGuoping Lin
- 1 January 2015
- journal article
- research article
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 56, 43-58
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61379021, 11301367, 11061004, 61305057, 61303131)
- Department of Education, Fujian Province (JA13202, JK2013027)
This publication has 30 references indexed in Scilit:
- Covering based rough set approximationsInformation Sciences, 2012
- A comparison of two kinds of definitions of rough approximations based on a similarity relationInformation Sciences, 2011
- Reduction about approximation spaces of covering generalized rough setsInternational Journal of Approximate Reasoning, 2010
- Relations of attribute reduction between object and property oriented concept latticesKnowledge-Based Systems, 2008
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough setsInformation Sciences, 2007
- Attribute reduction theory and approach to concept latticeScience China Information Sciences, 2005
- Reduction and axiomization of covering generalized rough setsInformation Sciences, 2003
- Comparing performance of algorithms for generating concept latticesJournal of Experimental & Theoretical Artificial Intelligence, 2002
- Relational interpretations of neighborhood operators and rough set approximation operatorsInformation Sciences, 1998
- Extensions and intentions in the rough set theoryInformation Sciences, 1998