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
- Library for machine learning stacking generalization.☆117Updated 5 years ago
- A simple, extensible library for developing AutoML systems☆175Updated last year
- ☆74Updated 6 years ago
- Public solution for AutoSeries competition☆72Updated 5 years ago
- Factorization Machine for regression and classification☆98Updated 7 years ago
- ☆70Updated 5 years ago
- Extension of the awesome XGBoost to linear models at the leaves☆78Updated 5 years ago
- An AutoML pipeline selection system to quickly select a promising pipeline for a new dataset.☆82Updated 3 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
- Solution to Corporación Favorita Grocery Sales Forecasting Competition☆28Updated 7 years ago
- Automated Machine Learning (AutoML) for Kaggle Competition☆32Updated last year
- Supporting code for the paper "Finding Influential Training Samples for Gradient Boosted Decision Trees"☆67Updated 10 months 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
- Discretization with Fayyad and Irani's minimum description length principle criterion (MDLPC)☆60Updated 6 years ago
- Kaggle Competition notebooks☆34Updated 6 years ago
- Gradient Boosting With Piece-Wise Linear Trees☆152Updated last year
- Uplift modeling and evaluation library. Actively maintained pypi version.☆75Updated last year
- Kaggle 8th place solution☆106Updated last year
- Tensorflow implementation of a Tree☆36Updated 5 years ago
- xgboost Extension for Easy Ranking & TreeFeature☆125Updated 5 years ago
- Code for WWW'19 "Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm", which is based on LightGBM☆225Updated 5 years ago
- TalkingData AdTracking Fraud Detection Challenge☆104Updated 6 years ago
- My solution to Web Traffic Predictions competition on Kaggle.☆153Updated 6 years ago
- Embed categorical variables via neural networks.☆59Updated 2 years ago
- ☆249Updated 3 years ago
- A Tiny, Pure Python implementation of Gradient Boosted Trees.☆255Updated 4 years ago
- 4th Place Solution for Kaggle Competition: Quora Insincere Questions Classification☆50Updated 6 years ago
- A memory efficient GBDT on adaptive distributions. Much faster than LightGBM with higher accuracy. Implicit merge operation.☆57Updated 5 years ago
- Python implementation of stacked generalization classifier. Plays nice with sklearn.☆71Updated 8 years ago
- XGBoost for label-imbalanced data: XGBoost with weighted and focal loss functions☆320Updated last year