pecking identifies the set of lowest-ranked groups and set of highest-ranked groups in a dataset using nonparametric statistical tests
Project description
pecking identifies the set of lowest-ranked groups and set of highest-ranked groups in a dataset using nonparametric statistical tests.
- Free software: MIT license
- Repository: https://github.com/mmore500/pecking
Install
python3 -m pip install pecking
Example Usage
>>> import pecking
>>> samples = [[1, 2, 3, 4, 5], [2, 3, 4, 4, 4], [8, 9, 7, 6, 4]]
>>> labels = ['Group 1', 'Group 2', 'Group 3']
>>> pecking.skim_highest(samples, labels)
['Group 1']
## API
```python3
def skim_highest(
samples: typing.Sequence[typing.Sequence[float]],
labels: typing.Optional[typing.Sequence[typing.Union[str, int]]] = None,
alpha: float = 0.05,
) -> typing.List[typing.Union[str, int]]:
"""Identify the set of highest-ranked groups that are statistically
indistinguishable amongst themselves based on a Kruskal-Wallis H-test
followed by multiple Mann-Whitney U-tests."""
def skim_highest(
samples: typing.Sequence[typing.Sequence[float]],
labels: typing.Optional[typing.Sequence[typing.Union[str, int]]] = None,
alpha: float = 0.05,
) -> typing.List[typing.Union[str, int]]:
"""Identify the set of lowest-ranked groups that are statistically
indistinguishable amongst themselves based on a Kruskal-Wallis H-test
followed by multiple Mann-Whitney U-tests."""
See function docstrings for full parameter and return value descriptions.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
pecking-0.1.0.tar.gz
(4.8 kB
view hashes)
Built Distribution
Close
Hashes for pecking-0.1.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 22f40c312c0bf5263fd5d75dd5fa372fea8737c0cb2bdf93ad7c242304732b03 |
|
MD5 | 351a4a7006c416880b9f548b6e8a1dc4 |
|
BLAKE2b-256 | 44ca6481a8037ede9030e1fe0efdc93eb8b49ef554f719d5a01f8487745eac34 |