Nie jesteś zalogowany | Zaloguj się

Extensions of Dynamic Programming as a New Tool for Rough Sets

Prelegent(ci)
Mikhail Moshkov
Afiliacja
KAUST, Saudi Arabia
Termin
29 października 2010 14:15
Pokój
p. 5820
Seminarium
Research Seminar of the Logic Group: Approximate reasoning in data mining

We consider extensions of Dynamic Programming which can work with problems containing exponential number of subproblems, and allow sequential optimization relative to different criteria and inference of relationships among these criteria. We use these extensions to study and optimize exact and approximate decision trees and rules.