litlas
ログインアカウント作成

Gradient Boosted Feature Selection

著者: Zhixiang Eddie Xu, Gao Huang, Kilian Q. Weinberger, Alice X. Zheng - ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2014 被引用: 195

A feature selection algorithm should ideally satisfy four conditions: reliably extract relevant features; be able to identify non-linear feature interactions; scale linearly with the number of features and dimensions; allow the incorporation of known sparsity structure. In this work we propose a novel feature selection algorithm, Gradient Boosted Feature Selection (GBFS), which satisfies all four of these requirements. The algorithm is flexible, scalable, and surprisingly straight-forward to implement as it is based on a modification of Gradient Boosted Trees. We evaluate GBFS on several real world data sets and show that it matches or out-performs other state of the art feature selection algorithms. Yet it scales to larger data set sizes and naturally allows for domain-specific side information.

Classification andRegression Trees.Classification and Regression Trees.Regression Shrinkage andSelection Via the LassoRegression Shrinkage and Selection Via the LassoGreedy functionapproximation: A…Greedy function approximation: A gradient boosting machine.The Elements ofStatistical Learning…The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd EditionHistograms of OrientedGradients for Human…Histograms of Oriented Gradients for Human DetectionAdvances in NeuralInformation Processing…Advances in Neural Information Processing Systems 19The Group Lasso forLogistic RegressionThe Group Lasso for Logistic RegressionFeature selection forranking using boosted…Feature selection for ranking using boosted treesBoosted multi-tasklearningBoosted multi-task learningCost-Sensitive Tree ofClassifiersCost-Sensitive Tree of ClassifiersThe Greedy Miser:Learning under Test-tim…The Greedy Miser: Learning under Test-time BudgetsHigh-Dimensional FeatureSelection by…High-Dimensional Feature Selection by Feature-Wise Kernelized LassoSparse PerceptronDecision Tree for…Sparse Perceptron Decision Tree for Millions of DimensionsDeep Neural Networks forHigh Dimension, Low…Deep Neural Networks for High Dimension, Low Sample Size DataFeature Selection: AData PerspectiveFeature Selection: A Data PerspectiveA CBR framework withgradient boosting based…A CBR framework with gradient boosting based feature selection for lung cancer subtype classificationFeature selection basedon artificial bee colon…Feature selection based on artificial bee colony and gradient boosting decision treeComparison of variableselection methods for…Comparison of variable selection methods for clinical predictive modelingEmbedded featureselection using…Embedded feature selection using probabilistic model-based optimizationGradient BoostingFeature Selection With…Gradient Boosting Feature Selection With Machine Learning Classifiers for Intrusion Detection on Power GridsAn Investigation ofCredit Card Default…An Investigation of Credit Card Default Prediction in the Imbalanced DatasetsInterpretation ofDepression Detection…Interpretation of Depression Detection Models via Feature Selection MethodsIntrusion Detection inSCADA Based Power Grids…Intrusion Detection in SCADA Based Power Grids: Recursive Feature Elimination Model With Majority Vote Ensemble AlgorithmDeep learning-basedidentification of…Deep learning-based identification of genetic variants: application to Alzheimer's disease classificationGradient Boosted FeatureSelectionGradient Boosted Feature Selection過去の参考文献中心の論文この論文を引用する論文古い新しい

ノードをクリックするとフォーカスを固定、空白をクリックすると本論文に戻ります。ホバーで一時的にプレビューできます。各ノードのページはタイトルから開けます。