Positive approximation: An accelerator for attribute reduction in rough set theory

Artificial Intelligence 174 (9-10):597-618 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Rough concept lattices and domains.Yinbin Lei & Maokang Luo - 2009 - Annals of Pure and Applied Logic 159 (3):333-340.
A Philosophical Interpretation of Rough Set Theory.Chang Kyun Park - 2008 - Proceedings of the Xxii World Congress of Philosophy 13:23-29.
Rough approximation quality revisited.Günther Gediga & Ivo Düntsch - 2001 - Artificial Intelligence 132 (2):219-234.
Reductionism in Fallacy Theory.Christoph Lumer - 2000 - Argumentation 14 (4):405-423.
Reduction and genetics.David L. Hull - 1981 - Journal of Medicine and Philosophy 6 (2):125-144.

Analytics

Added to PP
2020-12-22

Downloads
3 (#1,725,832)

6 months
2 (#1,255,269)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Wrappers for feature subset selection.Ron Kohavi & George H. John - 1997 - Artificial Intelligence 97 (1-2):273-324.
Consistency-based search in feature selection.Manoranjan Dash & Huan Liu - 2003 - Artificial Intelligence 151 (1-2):155-176.
Rough approximation quality revisited.Günther Gediga & Ivo Düntsch - 2001 - Artificial Intelligence 132 (2):219-234.
Rough computational methods for information systems.J. W. Guan & D. A. Bell - 1998 - Artificial Intelligence 105 (1-2):77-103.
Uncertainty measures of rough set prediction.Ivo Düntsch & Günther Gediga - 1998 - Artificial Intelligence 106 (1):109-137.

Add more references