Sciweavers

1923 search results - page 210 / 385
» Weighted Decision Trees
Sort
View
FUIN
2007
86views more  FUIN 2007»
15 years 6 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 6 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
DGO
2007
133views Education» more  DGO 2007»
15 years 8 months ago
A toolbox for the choice of indicator classes for ranking of watersheds
There has been considerable work on determining a suitable method to accomplish a satisfactory ordering of a group of objects, when there are multiple evaluation criteria. A weigh...
K. Sham Bhat
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 20 days ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
CIS
2004
Springer
15 years 12 months ago
Knowledge Maintenance on Data Streams with Concept Drifting
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
Juggapong Natwichai, Xue Li