A fast Learning to Rank library based on RankLib
Project description
rankY
A fast Learning to Rank library based on RankLib written in Cython.
Explore the docs »
Report Bug
·
Request Feature
Table of Contents
About The Project
rankY is a Learning to Rank library written in Cython and based on the famous RankLib library. The main goal of this project is to provide a simple, fast and memory safe wich implements a wide variety of LTR models.
Getting Started
pip install ltr
Roadmap
The project is in the early stages of development. Thus, feel free to contribute and help ltr++ to grow up!
See the open issues for a list of proposed features (and known issues).
OBS: To propose new features or report bugs, check out the correct templates.
Contributing
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
License
Distributed under the MIT License. See LICENSE for more information.
Contact
Marcos Pontes - mfprezende@gmail.com
Project Link: https://github.com/matchup-ir/ranky
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
Built Distribution
Hashes for ltr-0.0.2-cp38-cp38-manylinux_2_24_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | cf015c6f2b18999d365eced75e7a1299b0f577275e8ad436d9e7e15151e19e38 |
|
| MD5 | 3f48e191b6a43afeef3cef01eb33401d |
|
| BLAKE2b-256 | 9ad62b48e9c6c7aa87de1c52253ce49ebd165a7d6327dec5fcab95ff03b1358d |
