866 search results - page 43 / 174 » Extension of the direct optimization algorithm for noisy fun... |
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
SIAMJO
2000
13 years 7 months ago
2000
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
CIKM
2004
Springer
14 years 25 days ago
2004
Springer
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster simil...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...