Speeding Up and Boosting Diverse Density Learning

Abstract. In multi-instance learning, each example is described by a bag of instances instead of a single feature vector. In this paper, we revisit the idea of performing multi-instance classification based on a point-and-scaling concept by searching for the point in instance space with the highest diverse density. This is a computationally expensive process, and we describe several heuristics designed to improve runtime. Our results show that simple variants of existing algorithms can be used to find diverse density maxima more efficiently. We also show how significant increases in accuracy can be obtained by applying a boosting algorithm with a modified version of the diverse density algorithm as the weak learner.

• Type: Journal
• Year: 2010
• Where: DIS
• Authors: James R. Foulds, Eibe Frank
• Keywords: DIS 2010, Diverse Density, Diverse Density Maxima, Single Feature Vector, Theoretical Computer Science