Clustering-and-selection model for classifier combination
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A simple clustering-and-selection algorithm based on a probabilistic interpretation of classifier selection, where the most successful classifier for a given cluster is nominated to label the inputs in the Voronoi cell of the cluster centroid.
Abstract
We devise a simple clustering-and-selection algorithm based on a probabilistic interpretation of classifier selection. First, the data set is clustered into K clusters, and then the most successful classifier for a given cluster is nominated to label the inputs in the Voronoi cell of the cluster centroid. The proposed method is compared experimentally with the minimum, maximum, product and average. Also given are the results from the naive Bayes method, the behaviour-knowledge space (BKS) method, the best individual and the oracle.
