Titlebook: Machine Learning: ECML 2004; 15th European Confer Jean-Fran?ois Boulicaut,Floriana Esposito,Dino Ped Conference proceedings 2004 Springer-V

咒語(yǔ)

Sensitivity Analysis of the Result in Binary Decision Trees we compute the distance of a case from the decision surface. This distance measures the sensitivity of the result to a change in the input data. With a different distance it is also possible to measure the sensitivity of the result to small changes in the tree. The distance from the decision surfac

衍生

暫停,間歇

An Experimental Study of Different Approaches to Reinforcement Learning in Common Interest Stochasti Interest Stochastic Games (CISG). CISGs form an interesting class of multi-agent settings where the distributed nature of the systems, rather than adverserial behavior, is the main challenge to efficient learning. In this paper we examine three different approaches to RL in CISGs, embedded in the F

摻和

Learning from Message Pairs for Automatic Email Answeringave been received and sent in the past. We formulate the problem setting, discuss appropriate performance metrics, develop a solution and describe two baseline methods for comparison. We present a case study based on emails received and answered by the service center of a large online store.

OGLE

Accommodation

骨

An Analysis of Stopping and Filtering Criteria for Rule Learningvariant of ROC-space, which is particularly suited for visualizing the behavior of rule learning and its heuristics. On the one hand, we think that our results lead to a better understanding of the effects of stopping and filtering criteria, and hence to a better understanding of rule learning algor

exclusice

nepotism

Model Approximation for HEXQ Hierarchical Reinforcement Learning different levels of abstraction. In this paper we extend HEXQ with heuristics that automatically approximate the structure of the task hierarchy. Construction, learning and execution time, as well as storage requirements of a task hierarchy may be significantly reduced and traded off against soluti

陶瓷

Iterative Ensemble Classification for Relational Data: A Case Study of Semantic Web Services show two extensions to existing approaches. First, we propose to use two separate classifiers for the intrinsic and the relational (extrinsic) attributes and vote their predictions. Second, we introduce a new way of exploiting the relational structure. When the extrinsic attributes alone are not su