arrow
返回

ALORS: An algorithm recommender system

delete2017-03-01
delete50
delete
OA
AI
M
Mustafa Mısır *
M
Michèle Sébag
DOI:10.1016/j.artint.2016.12.001delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Algorithm selection (AS), selecting the algorithm best suited for a particular problem instance, is acknowledged to be a key issue to make the best out of algorithm portfolios. This paper presents a collaborative filtering approach to AS. Collaborative filtering, popularized by the Netflix challenge, aims to recommend the items that a user will most probably like, based on the previous items she liked, and the items that have been liked by other users. As first noted by Stern et al. [47], algorithm selection can be formalized as a collaborative filtering problem, by considering that a problem instance likes better the algorithms that achieve better performance on this particular instance. Two merits of collaborative filtering (CF) compared to the mainstream algorithm selection (AS) approaches are the following. Firstly, mainstream AS requires extensive and computationally expensive experiments to learn a performance model, with all algorithms launched on all problem instances, whereas CF can exploit a sparse matrix, with a few algorithms launched on each problem instance. Secondly, AS learns a performance model as a function of the initial instance representation, whereas CF builds latent factors to describe algorithms and instances, and uses the associated latent metrics to recommend algorithms for a specific problem instance. A main contribution of the proposed algorithm recommender ALORS system is to handle the cold start problem emitting recommendations for a new problem instance - through the non-linear modeling of the latent factors based on the initial instance representation, extending the linear approach proposed by Stern et al. [47]. The merits and generality of ALORS are empirically demonstrated on the ASLib [6] and OpenML [53] benchmarks. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Algorithm selection
Constraint satisfaction
Constraint programming
Collaborative filtering
Meta-learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

U
Universite Paris Saclay
学者数:
7.3W
论文数: 5.3W
被引数: 540
引用论文

引用论文

err分享
err收藏
Simple algorithm portfolio for SAT
err2011-12-21
err16
errOAAI
errNikolic, Mladen; Maric, Filip; Janicic, Predrag
err分享
err收藏
Effect of the electrical double layer on voltammetry at microelectrodes
err2002-05-01
err0
PREAI
errJohn D. Norton; Henry S. White; Stephen W. Feldberg
err分享
err收藏
Structure of the oncoprotein Rcl bound to three nucleotide analogues
err2013-01-19
err0
errOAAI
errAndré Padilla; Claire Amiable; Sylvie Pochet; Pierre-Alexandre Kaminski; Gilles Labesse
err分享
err收藏
学者 查看更多内容