Opened 17 years ago
Closed 15 years ago
#20 closed enhancement (fixed)
implement WilcoxonFoldChange
Reported by: | Peter | Owned by: | Peter |
---|---|---|---|
Priority: | minor | Milestone: | yat 0.5 |
Component: | statistics | Version: | trunk |
Keywords: | Cc: |
Description (last modified by )
At time being the non-weighted score is implemented in the naive way taking n_pos*n_neg time and using n_pos*n_neg memory. It is possible to do in n*log(n) time without any extra usage of memory.
implement weighted score (need weighted median ticket:366 )
Change History (10)
comment:1 Changed 17 years ago by
Type: | defect → enhancement |
---|
comment:2 Changed 17 years ago by
Status: | new → assigned |
---|
comment:3 Changed 17 years ago by
Description: | modified (diff) |
---|---|
Priority: | major → minor |
comment:4 Changed 17 years ago by
Milestone: | SVM extension → later |
---|
comment:5 Changed 17 years ago by
Milestone: | later → 0.2 |
---|
comment:6 Changed 17 years ago by
Milestone: | 0.2 → later |
---|
This fix is only important when the function is used with large group sizes. I therefore think this ticket belongs in milestone:later.
comment:7 Changed 17 years ago by
Status: | assigned → new |
---|
comment:8 Changed 15 years ago by
Milestone: | yat 0.x+ → yat 0.5 |
---|---|
Status: | new → assigned |
comment:9 Changed 15 years ago by
Description: | modified (diff) |
---|
comment:10 Changed 15 years ago by
Resolution: | → fixed |
---|---|
Status: | assigned → closed |
Note: See
TracTickets for help on using
tickets.
At time being the non-weighted score is implemented in the naive way taking n_pos*n_neg time and using n_pos*n_neg memory. It is possible to do in n*log(n) time without any extra usage of memory.
Implement weighted score - need