Cost-Sensitive Learning

Abstract

A pairwise constraint between two items indicating that they should be placed into diierent clusters in the enal partition. Candidate-Elimination Algorithm Mitchell's, (,) candidate-elimination algorithm performs a bidirectional search in the hypothesis space. It maintains a set, S, of most speciic hypotheses that are consistent with the training data and a set, G, of most general hypotheses consistent with the training data. ese two sets form two boundaries on the version space. See Learning as Search.