Learning from Polyhedral Sets
Abstract
Parameterized linear systems allow for modelling and reasoning over classes of polyhedra. Collections of squares, rectangles, polytopes, and so on, can readily be defined by means of linear systems with parameters. In this paper, we investigate the problem of learning a parameterized linear system whose class of polyhedra includes a given set of example polyhedral sets and it is minimal.
Cite
Text
Ruggieri. "Learning from Polyhedral Sets." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Ruggieri. "Learning from Polyhedral Sets." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/ruggieri2013ijcai-learning/)BibTeX
@inproceedings{ruggieri2013ijcai-learning,
title = {{Learning from Polyhedral Sets}},
author = {Ruggieri, Salvatore},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {1069-1075},
url = {https://mlanthology.org/ijcai/2013/ruggieri2013ijcai-learning/}
}