A supervised weeding method to cluster high dimensional predictors with application to job market analysis
© 2024 Informa UK Limited, trading as Taylor & Francis Group.
| Veröffentlicht in: | Journal of applied statistics. - 1991. - 51(2024), 16 vom: 03., Seite 3350-3365 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2024
|
| Zugriff auf das übergeordnete Werk: | Journal of applied statistics |
| Schlagworte: | Journal Article Data analysis Supervised clustering big data clustering predictors feature screening high dimensional data high dimensional data analysis text mining |
| Zusammenfassung: | © 2024 Informa UK Limited, trading as Taylor & Francis Group. The clustering of high-dimensional predictors draws increasing attention in various scientific areas, such as text mining and biological data analysis. In standard clustering procedures, when predictors are clustered, they only showcase the inherent patterns within the predictor set, lacking the capacity to predict the response variable. To this end, a new supervised weeding algorithm is advocated to address the dual requirement of detecting sparse clusters and capturing the prediction effects. The proposed algorithm is based on an iterative feature screening and coherence evaluation procedure. It iteratively weeds off the unimportant predictors in a backward fashion, forming sequences of nested sets to determine data-driven optimal cut-offs. This study uses Monte Carlo simulation to assess the finite-sample performance of the proposed method. The findings demonstrate that both the clustering and prediction performance of the proposed method are comparable to existing methods that concentrate solely on one aspect of the dual targets. An analysis of a job description dataset is conducted to explore significant groups of keywords that affect employees' salaries |
|---|---|
| Beschreibung: | Date Revised 05.12.2024 published: Electronic-eCollection Citation Status PubMed-not-MEDLINE |
| ISSN: | 0266-4763 |
| DOI: | 10.1080/02664763.2024.2348634 |