548 search results - page 5 / 110 » Iterated importance sampling in missing data problems |
EWCBR
2004
Springer
2004
Springer
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
14 years 24 days ago
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
BMCBI
2005
13 years 7 months ago
2005
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
AI
2010
Springer
13 years 7 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
WSCG
2004
13 years 8 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...