Hierarchically penalized support vector machine with grouped variables
- Authors
- Bang, Sungwan; Kang, Jongkyeong; Jhun, Myoungshic; Kim, Eunkyung
- Issue Date
- 8월-2017
- Publisher
- SPRINGER HEIDELBERG
- Keywords
- Feature selection; Group selection; Infinite norm; Lasso; Regularization; Support vector machine
- Citation
- INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, v.8, no.4, pp.1211 - 1221
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
- Volume
- 8
- Number
- 4
- Start Page
- 1211
- End Page
- 1221
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/82719
- DOI
- 10.1007/s13042-016-0494-2
- ISSN
- 1868-8071
- Abstract
- When input features are naturally grouped or generated by factors in a linear classification problem, it is more meaningful to identify important groups or factors rather than individual features. The F (a)-norm support vector machine (SVM) and the group lasso penalized SVM have been developed to perform simultaneous classification and factor selection. However, these group-wise penalized SVM methods may suffer from estimation inefficiency and model selection inconsistency because they cannot perform feature selection within an identified group. To overcome this limitation, we propose the hierarchically penalized SVM (H-SVM) that not only effectively identifies important groups but also removes irrelevant features within an identified group. Numerical results are presented to demonstrate the competitive performance of the proposed H-SVM over existing SVM methods.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Political Science & Economics > Department of Statistics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.