Sciweavers

593 search results - page 22 / 119
» Dealing with different distributions in learning from
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...
CIKM
2005
Springer
14 years 29 days ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia
CCGRID
2010
IEEE
13 years 8 months ago
The Failure Trace Archive: Enabling Comparative Analysis of Failures in Diverse Distributed Systems
With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, th...
Derrick Kondo, Bahman Javadi, Alexandru Iosup, Dic...
IJET
2007
99views more  IJET 2007»
13 years 7 months ago
Treating metadata as annotations: separating the content markup from the content
— The use of digital learning resources creates an increasing need for semantic metadata, describing the whole resource, as well as parts of resources. Traditionally, schemas suc...
Fredrik Paulsson, Jonas Engman
DMIN
2007
186views Data Mining» more  DMIN 2007»
13 years 8 months ago
Cost-Sensitive Learning vs. Sampling: Which is Best for Handling Unbalanced Classes with Unequal Error Costs?
- The classifier built from a data set with a highly skewed class distribution generally predicts the more frequently occurring classes much more often than the infrequently occurr...
Gary M. Weiss, Kate McCarthy, Bibi Zabar