Anzeige
Erschienen in:
1998 | OriginalPaper | Buchkapitel
Discretization Problem for Rough Sets Methods
verfasst von : Hung Son Nguyen
Erschienen in: Rough Sets and Current Trends in Computing
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
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
We study the relationship between reduct problem in Rough Sets theory and the problem of real value attribute discretization. We consider the problem of searching for a minimal set of cuts on attribute domains that preserves discernibility of objects with respect to any chosen attributes subset of cardinality s (where s is a parameter given by a user). Such a discretization procedure assures that one can keep all reducts consisting of at least s attributes. We show that this optimization problem is NP-hard and it is interesting to find efficient heuristics for solving this problem.