flytxtds / AutoGBT
AutoGBT is used for AutoML in a lifelong machine learning setting to classify large volume high cardinality data streams under concept-drift. AutoGBT was developed by a joint team ('autodidact.ai') from Flytxt, Indian Institute of Technology Delhi and CSIR-CEERI as a part of NIPS 2018 AutoML for Lifelong Machine Learning Challenge.
☆114Updated 5 years ago
Alternatives and similar repositories for AutoGBT:
Users that are interested in AutoGBT are comparing it to the libraries listed below
- Public solution for AutoSeries competition☆72Updated 5 years ago
- Factorization Machine for regression and classification☆98Updated 7 years ago
- The final code submission of Meta_Learners, which won the second place in NIPS 2018 AutoML Challenge☆17Updated 6 years ago
- Solution to Corporación Favorita Grocery Sales Forecasting Competition☆28Updated 7 years ago
- xgboost Extension for Easy Ranking & TreeFeature☆124Updated 5 years ago
- This notebook shows how to implement LibFM in Keras and how it was used in the Talking Data competition on Kaggle.☆189Updated 6 years ago
- A simple, extensible library for developing AutoML systems☆173Updated last year
- Winning Solution to the Kaggle Days Paris offline competition☆63Updated 6 years ago
- Extension of the awesome XGBoost to linear models at the leaves☆78Updated 5 years ago
- TalkingData AdTracking Fraud Detection Challenge☆104Updated 6 years ago
- 2nd Place Solution for Kaggle Porto Seguro's Safe Driver Prediction☆157Updated 5 years ago
- ☆74Updated 6 years ago
- Tensorflow implementation of a Tree☆36Updated 5 years ago
- Gradient Boosting With Piece-Wise Linear Trees☆152Updated 10 months ago
- This is the official clone for the implementation of the NIPS18 paper Multi-Layered Gradient Boosting Decision Trees (mGBDT) .☆102Updated 6 years ago
- Preparing continuous features for neural networks with GaussRank☆45Updated 7 years ago
- A prototype implementation of ClusChurn based on PyTorch.☆52Updated 7 years ago
- Library for machine learning stacking generalization.☆117Updated 5 years ago
- The 18th Place Solution to Avito Demand Prediction Challenge☆26Updated 5 years ago
- An AutoML pipeline selection system to quickly select a promising pipeline for a new dataset.☆82Updated 3 years ago
- Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"☆67Updated 8 months ago
- ☆94Updated last year
- Code for WWW'19 "Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm", which is based on LightGBM☆225Updated 5 years ago
- My solution to Web Traffic Predictions competition on Kaggle.☆153Updated 6 years ago
- Template for Stacking (Stacked Generalization) Ensemble Method☆37Updated 9 years ago
- A memory efficient GBDT on adaptive distributions. Much faster than LightGBM with higher accuracy. Implicit merge operation.☆57Updated 4 years ago
- Discretization with Fayyad and Irani's minimum description length principle criterion (MDLPC)☆60Updated 6 years ago
- ☆249Updated 3 years ago
- Kaggle Competition notebooks☆33Updated 5 years ago
- Home repository for the Regularized Greedy Forest (RGF) library. It includes original implementation from the paper and multithreaded one…☆380Updated 3 years ago