Baselines for On-Line Search Methods

Joseph C. Pemberton

On-line search algorithms have become increasingly important in a wide variety of application domains. Our position is that research in on-line search algorithms should at a minimum include experimental resuits that compare the algorithm’s performance to a reasonable set of baselines. We suggest a general approach to baselines, and then present examples for a particular domain of on-line search problems.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.