# LightGBM **Repository Path**: linius/LightGBM ## Basic Information - **Project Name**: LightGBM - **Description**: No description available - **Primary Language**: Unknown - **License**: MIT - **Default Branch**: master - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2017-03-11 - **Last Updated**: 2020-12-18 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README LightGBM, Light Gradient Boosting Machine ========================================= [![Build Status](https://travis-ci.org/Microsoft/LightGBM.svg?branch=master)](https://travis-ci.org/Microsoft/LightGBM) LightGBM is a gradient boosting framework that uses tree based learning algorithms. It is designed to be distributed and efficient with the following advantages: - Faster training speed and higher efficiency - Lower memory usage - Better accuracy - Parallel learning supported - Capable of handling large-scale data For more details, please refer to [Features](https://github.com/Microsoft/LightGBM/wiki/Features). [Experiments](https://github.com/Microsoft/LightGBM/wiki/Experiments#comparison-experiment) on public datasets show that LightGBM can outperform existing boosting frameworks on both efficiency and accuracy, with significantly lower memory consumption. What's more, the [experiments](https://github.com/Microsoft/LightGBM/wiki/Experiments#parallel-experiment) show that LightGBM can achieve a linear speed-up by using multiple machines for training in specific settings. News ---- 02/20/2017 : Update to LightGBM v2. 01/08/2017 : Release [**R-package**](./R-package) beta version, welcome to have a try and provide feedback. 12/05/2016 : **Categorical Features as input directly**(without one-hot coding). Experiment on [Expo data](http://stat-computing.org/dataexpo/2009/) shows about 8x speed-up with same accuracy compared with one-hot coding. 12/02/2016 : Release [**python-package**](./python-package) beta version, welcome to have a try and provide feedback. Get Started And Documents ------------------------- To get started, please follow the [Installation Guide](https://github.com/Microsoft/LightGBM/wiki/Installation-Guide) and [Quick Start](https://github.com/Microsoft/LightGBM/wiki/Quick-Start). * [**Wiki**](https://github.com/Microsoft/LightGBM/wiki) * [**Installation Guide**](https://github.com/Microsoft/LightGBM/wiki/Installation-Guide) * [**Quick Start**](https://github.com/Microsoft/LightGBM/wiki/Quick-Start) * [**Examples**](https://github.com/Microsoft/LightGBM/tree/master/examples) * [**Features**](https://github.com/Microsoft/LightGBM/wiki/Features) * [**Parallel Learning Guide**](https://github.com/Microsoft/LightGBM/wiki/Parallel-Learning-Guide) * [**Configuration**](https://github.com/Microsoft/LightGBM/wiki/Configuration) * [**Document Indexer**](https://github.com/Microsoft/LightGBM/blob/master/docs/Readme.md) How to Contribute ----------------- LightGBM has been developed and used by many active community members. Your help is very valuable to make it better for everyone. - Check out [call for contributions](https://github.com/Microsoft/LightGBM/issues?q=is%3Aissue+is%3Aopen+label%3Acall-for-contribution) to see what can be improved, or open an issue if you want something. - Contribute to the [tests](https://github.com/Microsoft/LightGBM/tree/master/tests) to make it more reliable. - Contribute to the [documents](https://github.com/Microsoft/LightGBM/tree/master/docs) to make it clearer for everyone. - Contribute to the [examples](https://github.com/Microsoft/LightGBM/tree/master/examples) to share your experience with other users. - Check out [Development Guide](./docs/development.md). - Open issue if you met problems during development. Microsoft Open Source Code of Conduct ------------ This project has adopted the [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/). For more information see the [Code of Conduct FAQ](https://opensource.microsoft.com/codeofconduct/faq/) or contact [opencode@microsoft.com](mailto:opencode@microsoft.com) with any additional questions or comments.