Dual-tree method Assume: K(·) parameterized by a distance function: K(x, y) = K (δ(x, y)). Main idea: build a spatial access tree on the source and target points, and use this to bound the value of the maximum influence and prune candidate nodes which cannot contain a particle that exceeds this bound. The bound tightens as we expand the tree, allowing more nodes to be pruned and leaving but a f...

We investigate in this paper the problem of model collisions in the Dissimilarity Self Organizing Map (SOM). This extension of the SOM to dissimilarity data suffers from constraints imposed on the model representation, that lead to some strong map folding: several units share a common prototype. We propose in this paper an efficient way to address this problem via a branch and bound approach.

OPUS is a branch and bound search algorithm that enables efficient admissible search through spaces for which the order of search operator application is not significant. The algorithm’s search efficiency is demonstrated with respect to very large machine learning search spaces. The use of admissible search is of potential value to the machine learning community as it means that the exact learn...

In this paper, we present and evaluate a novel method for feature selection for Multiclass Support Vector Machines (MSVM). It consists in determining the relevant features using an upper bound of generalization error proper to the multiclass case called the multiclass radius margin bound. A score derived from this bound will rank the variables in order of relevance, then, forward method will be...

We present a simple result in single-machine scheduling theory. Namely, the number of tardy jobs in a sequence which is optimal with respect to total tardiness is no greater than the number of tardy jobs in the earliest due date sequence. This provides a bound for solutions to the total tardiness problem on a single machine found using branch and bound, dynamic programming or the decomposition ...

This paper focuses on single machine scheduling subject to inventory constraints. Jobs add or remove items to or from the inventory, respectively. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine where the objective is to minimize the total weighted completion time. We develop properties of optimal s...