Fast computing an ensemble of rank-based trees via boosting or random forest on binary and multi-class problems. It converts continuous gene expression profiles into ranked gene pairs, for which the variable importance indices are computed and adopted for dimension reduction.
Project description
Fast computing an ensemble of rank-based trees via boosting or random forest on binary and multi-class problems. It converts continuous gene expression profiles into ranked gene pairs, for which the variable importance indices are computed and adopted for dimension reduction.
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
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file ranktreeEnsemble-0.1.3-py3-none-any.whl.
File metadata
- Download URL: ranktreeEnsemble-0.1.3-py3-none-any.whl
- Upload date:
- Size: 8.4 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.10.8
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
560b906f97caf5715b30319e7c924797cd90831c850f6924eb62099880aa1440
|
|
| MD5 |
8b45b8edae9442e8563b4fa2e19ff9d3
|
|
| BLAKE2b-256 |
b287eb11448f4c5dfdfd3b5ca021eaba4b380d3300accf806752892eaf747cbb
|
