ML Anthology

The COMPSET Algorithm for Subset Selection

Yaniv Hamo, Shaul Markovitch
IJCAI 2005 pp. 728-733
/ijcai/2005/hamo2005ijcai-compset/

Abstract

Subset selection problems are relevant in many domains. Unfortunately, their combinatorial nature prohibits solving them optimally in most cases. Local search algorithms have been applied to subset selection with varying degrees of success. This work presents COMPSET, a general algorithm for subset selection that invokes an existing local search algorithm from a random subset and its complementary set, exchanging information between the two runs to help identify wrong moves. Preliminary

PDF Semantic Scholar

Cite

Text

Hamo and Markovitch. "The COMPSET Algorithm for Subset Selection." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Hamo and Markovitch. "The COMPSET Algorithm for Subset Selection." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/hamo2005ijcai-compset/)

BibTeX

@inproceedings{hamo2005ijcai-compset,
  title     = {{The COMPSET Algorithm for Subset Selection}},
  author    = {Hamo, Yaniv and Markovitch, Shaul},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {728-733},
  url       = {https://mlanthology.org/ijcai/2005/hamo2005ijcai-compset/}
}