Rare Feature Selection in High Dimensions
원문 초록
It is common in modern prediction problems for many predictor variables to be counts of rarely occurring events. This leads to design matrices in which many columns are highly sparse. The challenge posed by such "rare features" has received little attention despite its prevalence in diverse areas, ranging from natural language processing (e.g., rare words) to biology (e.g., rare species). We show, both theoretically and empirically, that not explicitly accounting for the rareness of features can greatly reduce the effectiveness of an analysis. We next propose a framework for aggregating rare features into denser features in a flexible manner that creates better predictors of the response. Our strategy leverages side information in the form of a tree that encodes feature similarity. We apply our method to data from TripAdvisor, in which we predict the numerical rating of a hotel based on the text of the associated review. Our method achieves high accuracy by making effective use of rare words; by contrast, the lasso is unable to identify highly predictive words if they are too rare. A companion R package, called rare, implements our new estimator, using the alternating direction method of multipliers.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Simple is what you need for efficient and accurate medical image segmentation
Permutation-Free High-Order Interaction Tests
Scalable unsupervised feature selection via weight stability
토론
이 논문과 연결된 포럼 글이 아직 없습니다.