Skip to content

implement ranking method #158

Open
Open
implement ranking method#158
Labels
difficulty: lowenhancementpriority: high
Milestone
nice_to_have

Description

@gdementen
gdementen
opened on Mar 16, 2017

the usual way to implement it in numpy is a.argsort().argsort() which would translate to a.posargsort(axis).posargsort(axis) in larray

for large 1D arrays, another technique is faster, but not sure it's worth it for now:
https://gist.github.com/naught101/14042d91a2d0f18a6ae4#file-python_rank_benchmarking-py-L17

Activity

  1. gdementen
    added
    enhancement
    on Mar 16, 2017
  2. gdementen
    added
    priority: high
    on Oct 20, 2017
  3. alixdamman
    added this to the 0.29 milestone on Dec 18, 2017
  4. alixdamman
    modified the milestones: 0.29, 0.30 on Mar 16, 2018
  5. alixdamman
    modified the milestones: 0.30, 0.31 on Jul 18, 2018

  6. gdementen commented on Sep 19, 2018

    @gdementen
    gdementen
    on Sep 19, 2018
    ContributorAuthor

    See:
    https://docs.scipy.org/doc/scipy-0.16.0/reference/generated/scipy.stats.rankdata.html
    https://pandas.pydata.org/pandas-docs/stable/generated/pandas.DataFrame.rank.html#pandas.DataFrame.rank
    https://en.wikipedia.org/wiki/Ranking
    for some background.

  7. gdementen
    added
    difficulty: low
    on Jul 17, 2019
  8. gdementen
    removed this from the 0.31 milestone on Aug 1, 2019
  9. alixdamman
    added this to the nice_to_have milestone on Oct 10, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    difficulty: lowenhancementpriority: high

    Type

    No type

    Projects

    No projects

      Milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions