When knowledge is obtained from a database, it is only possible to deduce confidence intervals for probability values. With confidence intervals replacing point values, the results in the set covering model include interval constraints for the probabilities of mutually exclusive and exhaustive explanations. The Principle of Interval Constraints ranks these explanations by determining the expect...

We consider discretization of the ‘geometric cover problem’ in the plane: Given a set P of n points in the plane and a compact planar object T0, find a minimum cardinality collection of planar translates of T0 such that the union of the translates in the collection contains all the points in P . We show that the geometric cover problem can be converted to a form of the geometric set cover, whic...

We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we show that this bound is tight by providing a lower bound in the form of a family of graphs. This improves the previously known upper and lower bound of 11n−18 and 3n respectively by Grigoriev and Sitters. Our proof is val...

The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover problem, and it naturally arises in certain data mining applications.

We present an improved inductive learning method to derive classification rules that correctly describe most of the examples belonging to a class and do not describe most of the examples not belonging to this class. The problem is represented as a modification of the set covering problems solved by a genetic algorithm. Its is employed to medical data on coronary disease, and the results seem to...

The study of algorithms that handle imprecise input data for which precise data can be requested is an interesting area. In the verification under uncertainty setting, which is the focus of this paper, an algorithm is also given an assumed set of precise input data. The aim of the algorithm is to update the smallest set of input data such that if the updated input data is the same as the corres...

Despite the key role played by political payoffs in theory, very little is known empirically about the types of payoffs that motivate politicians. The purpose of this paper is to bring some light into this. I estimate causal effects of being elected in a local election on monetary returns. The claim for causality, I argue, can be made thanks to a research design where the income of some candida...

Suppose we are given a finite set of points P in R 3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection T such that their union covers all input points P. The second problem that we consider is finding a hitting set for...

A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two...

The paper examines the effect of exchange rate changes on consumer prices in Ghana using vector autoregression (VAR) models. Using a data set covering the period 1990M01–2009M02, we find that the exchange rate pass-through to inflation is ‘incomplete’ and decreasing in Ghana. Our empirical results indicate a low but significant pass-through in the short run. We argue that the findings reflect t...