Ensemble selection with joint spectral clustering and structural sparsity
•First unsupervised ensemble selection method with joint clustering and sparsity.•A prediction space leveraging the prediction power of an ensemble is the basis of the method.•The data in the prediction space, which globally describe the prediction distribution of the ensemble, are unlabeled.•Method...
Gespeichert in:
Veröffentlicht in: | Pattern recognition 2021-11, Vol.119, p.108061, Article 108061 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •First unsupervised ensemble selection method with joint clustering and sparsity.•A prediction space leveraging the prediction power of an ensemble is the basis of the method.•The data in the prediction space, which globally describe the prediction distribution of the ensemble, are unlabeled.•Method’s ensemble results are robust to test instances and uses less space.
Generally, ensemble selection techniques are split into two categories: dynamic and static. Static ensemble selection selects a fixed subset of the original ensemble which improves the space complexity but is not flexible to each test instance. Dynamic ensemble selection selects base learners on-the-fly according to each test instance but it does not significantly improve the complexity. Currently, there is no ensemble selection technique that is robust to the test instances as well as improves space complexity. To narrow this gap, we propose a novel static ensemble selection method, called Ensemble Selection with Joint Spectral Clustering and Structural Sparsity. This method integrates spectral clustering and structural sparsity into a joint framework whose ensemble selection result is robust to test instances and consumes less space. Using 25 datasets from KEEL and UCI, we demonstrate the effectiveness of our proposed algorithm and its promising performance compared to that of other state-of-the-art algorithms. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/j.patcog.2021.108061 |