This paper explores a relationship between parameters for the context tree weighting and weights for a general model weighting technique. In particular, an algorithm is proposed that approximately computes the parameters from the weights, and a condition under which no error for the approximation occurs is derived. key words: model weighting technique, tree source, context tree weighting.

Proper scoring rules are scoring methods that incentivize honest reporting of subjective probabilities, where an agent strictly maximizes his expected score by reporting his true belief. The implicit assumption behind proper scoring rules is that agents are risk neutral. Such an assumption is often unrealistic when agents are human beings. Modern theories of choice under uncertainty based on ra...

In this article we report on a study of how to use the context tree weight-ing (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modiica-tions of the bas...

Modeling unknown opponents is known as a key factor for the efficiency of automated negotiations. The learning processes are however challenging because of (1) the indirect way the target function can be observed, and (2) the limited amount of experience available to learn from an unknown opponent at a single session. To address these difficulties we propose to adopt two approaches from transfe...

As an attempt to solve some contemporary web information retrieval problems, a construction of a cooperative multiagent system is proposed. This paper introduces the system and presents the use of a unique aggregation and fusion technique that is employed to attain reliable delivery performance. The intelligent methodology to fuse agents’ decisions, the team consensus approach, models the inter...

The context-tree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byte-oriented tree sources. This paper describes the context-tree branch-weighting algorithm, which can reduce the number of parameters for such sources, without increasing the complexity significantly.

We investigate trust propagation in delegation situations, which often occur in hierarchical organisations and coalition structures. In doing so we define a delegation chain representing the sub-delegation process. Such delegation chains present a problem for current trust evaluation mechanisms, which are unable to accurately divide trust among the chain members, resulting in degraded system pe...

In this paper, we propose a novel intensity-based similarity measure for medical image registration. Traditional intensity-based methods are sensitive to intensity distortions, contrast agent and noise. Although residual complexity can solve this problem in certain situations, relative modification of the parameter can generate dramatically different results. By introducing a specifically desig...