Abstract
This chapter studies the general subset selection problem that is involved in various learning problems. Based on Pareto optimization, we present the POSS algorithm that achieves equal or better performance than the greedy algorithm. The advantage is also supported by the experiment results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Zhou, ZH., Yu, Y., Qian, C. (2019). Subset Selection. In: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-13-5956-9_14
Download citation
DOI: https://doi.org/10.1007/978-981-13-5956-9_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5955-2
Online ISBN: 978-981-13-5956-9
eBook Packages: Computer ScienceComputer Science (R0)