ldv1 / LinXGBoostLinks
Extension of the awesome XGBoost to linear models at the leaves
☆78Updated 5 years ago
Alternatives and similar repositories for LinXGBoost
Users that are interested in LinXGBoost are comparing it to the libraries listed below
Sorting:
- Gradient Boosting With Piece-Wise Linear Trees☆152Updated last year
- Library for machine learning stacking generalization.☆117Updated 6 years ago
- Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"☆67Updated last year
- An implementation of Caruana et al's Ensemble Selection algorithm in Python, based on scikit-learn☆150Updated 4 years ago
- A memory efficient GBDT on adaptive distributions. Much faster than LightGBM with higher accuracy. Implicit merge operation.☆58Updated 5 years ago
- Scikit-learn API toy wrapper for Regularized Greedy Forests☆44Updated 9 years ago
- This is the official clone for the implementation of the NIPS18 paper Multi-Layered Gradient Boosting Decision Trees (mGBDT) .☆103Updated 6 years ago
- Python implementation of stacked generalization classifier. Plays nice with sklearn.☆71Updated 8 years ago
- a feature engineering wrapper for sklearn☆51Updated 4 years ago
- Home repository for the Regularized Greedy Forest (RGF) library. It includes original implementation from the paper and multithreaded one…☆381Updated 3 years ago
- Preparing continuous features for neural networks with GaussRank☆45Updated 7 years ago
- Factorization Machine for regression and classification☆98Updated 7 years ago
- ☆34Updated 8 years ago
- Context-sensitive ranking and choice in Python with PyTorch☆66Updated 2 years ago
- Time Series Forecasting Framework☆41Updated 2 years ago
- Experimental Gradient Boosting Machines in Python with numba.☆184Updated 6 years ago
- Remove Tomek Links from your data.☆30Updated 7 years ago
- Python code for tree ensemble interpretation☆84Updated 4 years ago
- Discretization with Fayyad and Irani's minimum description length principle criterion (MDLPC)☆60Updated 6 years ago
- Minimum description length principle algorithm in Python, for optimal binning of continuous variables☆60Updated 2 years ago
- Feature-Time Instability Metric☆43Updated 8 years ago
- InfiniteBoost: building infinite ensembles with gradient descent☆184Updated 6 years ago
- A library for factorization machines and polynomial networks for classification and regression in Python.☆245Updated 4 years ago
- AutoGBT is used for AutoML in a lifelong machine learning setting to classify large volume high cardinality data streams under concept-dr…☆114Updated 5 years ago
- A potential 22nd rank solution to Criteo Labs Display Advertising Challenge on Kaggle☆25Updated 7 years ago
- This notebook shows how to implement LibFM in Keras and how it was used in the Talking Data competition on Kaggle.☆189Updated 7 years ago
- A Tiny, Pure Python implementation of Gradient Boosted Trees.☆255Updated 4 years ago
- Public solution for AutoSeries competition☆72Updated 5 years ago
- An implementation of the minimum description length principal expert binning algorithm by Usama Fayyad☆105Updated 2 years ago
- ☆70Updated 5 years ago