Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Generate (F, ε)-Dynamic Reduct Using Cascading Hashes
verfasst von : Pai-Chou Wang
Erschienen in: Rough Set and Knowledge Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Dynamic reducts with large stability coefficients are good candidates for decision rules generation but it is time consuming to generate them. This paper presents an algorithm
dReducts
using a cascading hash function to generate (
F
,
ε
)-dynamic reducts. With the cascading hash function, an
F
-dynamic reduct can be generated in O(
m
2
n
) time with O(
mn
) space where
m
and
n
are total number of attributes and total number of instances of the table. Empirical results of generating (
F
,
ε
)-dynamic reducts using five of ten most popular UCI datasets are presented and they are compared to the Rough Set Exploration System (
RSES
).