Comparing genetic algortihms and matrix factorization for learning heuristics in constraint solving

Seda Polat Erdeniz, Andrei Popescu*

*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beitrag in einer FachzeitschriftKonferenzartikelBegutachtung

Abstract

Knowledge-based recommender systems assist users in the active configuration of complex products. These systems rely on solving Constraint Satisfaction Problems (CSP). In constraint solving, variable and value ordering heuristics help to increase efficiency. Applying such heuristics can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics to similar CSPs, CSP solver performance could be further improved. In previous work, we have proposed novel approaches to learn such heuristics, however, an evaluation in terms of consistency and prediction quality is still lacking. In this paper, we evaluate an compare two proposed approaches to learn heuristics, one relying on Genetic Algorithms and Clustering, and one on Matrix Factorization, on the same problem. Our results provide valuable insights for future research in this domain.

Originalspracheenglisch
Seiten (von - bis)21-23
Seitenumfang3
FachzeitschriftCEUR Workshop Proceedings
Jahrgang2945
PublikationsstatusVeröffentlicht - Sept. 2021
Veranstaltung23rd International Configuration Workshop: ConfWS 2021 - Conference Center of Siemens City Vienna (Siemensstraße 90, 1210 Wien), Vienna, Österreich
Dauer: 16 Sept. 202117 Sept. 2021
https://confws21.ist.tugraz.at

ASJC Scopus subject areas

  • Informatik (insg.)

Fingerprint

Untersuchen Sie die Forschungsthemen von „Comparing genetic algortihms and matrix factorization for learning heuristics in constraint solving“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren