Graph Matching for Shape Retrieval

We propose a new in-sample cross validation based method (randomized GACV) for choosing smoothing or bandwidth parameters that govern the bias-variance or fit-complexity tradeoff in 'soft' classification. Soft clas(cid: 173) sification refers to a learning procedure which estimates the probability that an example with a given attribute vector is in class 1 vs class O. The target for optimizing the the tradeoff is the Kullback-Liebler distance between the estimated probability distribution and the 'true' probabil(cid: 173) ity distribution, representing knowledge of an infinite population. The method uses a randomized estimate of the trace of a Hessian and mimics cross validation at the cost of a single relearning with perturbed outcome data.

Authors

• Benoit Huet
• Andrew Cross
• Edwin Hancock Department of Computer Science, University of York, York, United Kingdom

Keywords

No keywords are indexed for this paper.