MOO: A Methodology for Online Optimization through Mining the Offline Optimum
<|reference_start|>MOO: A Methodology for Online Optimization through Mining the Offline Optimum: Ports, warehouses and courier services have to decide online how an arriving task is to be served in order that cost is minimized (or profit maximized). These operators have a wealth of historical data on task assignments; can these data be mined for knowledge or rules that can help the decision-making?   MOO is a novel application of data mining to online optimization. The idea is to mine (logged) expert decisions or the offline optimum for rules that can be used for online decisions. It requires little knowledge about the task distribution and cost structure, and is applicable to a wide range of problems.   This paper presents a feasibility study of the methodology for the well-known k-server problem. Experiments with synthetic data show that optimization can be recast as classification of the optimum decisions; the resulting heuristic can achieve the optimum for strong request patterns, consistently outperforms other heuristics for weak patterns, and is robust despite changes in cost model.<|reference_end|>
@article{lee2000moo:,
    title={MOO: A Methodology for Online Optimization through Mining the Offline
  Optimum},
    author={Jason W.H. Lee, Y.C. Tay, Anthony K.H. Tung (National University of
  Singapore)},
    journal={arXiv preprint arXiv:cs/0003072},
    year={2000},
    number={Research Report No. 743},
    archivePrefix={arXiv},
    eprint={cs/0003072},
    primaryClass={cs.DS cs.LG}
}