2009
DOI: 10.1186/1471-2105-10-62
|View full text |Cite
|
Sign up to set email alerts
|

RankAggreg, an R package for weighted rank aggregation

Abstract: Background: Researchers in the field of bioinformatics often face a challenge of combining several ordered lists in a proper and efficient manner. Rank aggregation techniques offer a general and flexible framework that allows one to objectively perform the necessary aggregation. With the rapid growth of high-throughput genomic and proteomic studies, the potential utility of rank aggregation in the context of meta-analysis becomes even more apparent. One of the major strengths of rank-based aggregation is the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
260
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 285 publications
(270 citation statements)
references
References 10 publications
0
260
0
Order By: Relevance
“…In theory, it combines several individual ranked lists to produce a super list which will be as close as possible to all individual lists simultaneously. In our application, we use RankAggreg [17], an R package for weighted rank aggregation. It was illustrated by Lin et al [11] that the utility of ranking aggregation leads to satisfactory simulation results when combining miRNA target lists from different algorithms.…”
Section: Methodsmentioning
confidence: 99%
“…In theory, it combines several individual ranked lists to produce a super list which will be as close as possible to all individual lists simultaneously. In our application, we use RankAggreg [17], an R package for weighted rank aggregation. It was illustrated by Lin et al [11] that the utility of ranking aggregation leads to satisfactory simulation results when combining miRNA target lists from different algorithms.…”
Section: Methodsmentioning
confidence: 99%
“…The RankAggreg software package was used to analyze the four different sets of data and combine these four algorithms to establish a consensus ranking. Specifically, the brute force method (using the RankAggreg function) was used to enumerate all possible candidate lists and then the one with the minimum Spearman foot rule distance was selected (36). This method output results in the most stable and least stable reference genes on day 12, however, there may not be consistency in the expression levels of certain reference genes over time under certain conditions (22,37).…”
Section: A B Cmentioning
confidence: 99%
“…Computational implementations can include the representation of each input data set as a separate kernel and the weighted optimized combination of these kernels to reconstruct co-expression patterns [54], as well as Bayesian network-based functions [55], decision trees [56] and weighted rank aggregation [57]. In particular, we tested the RankAggreg R package [58], which exploits the rank aggregation method. This R package takes different lists of ranked elements as input.…”
Section: Comparative Meta-analysis Of Results From Different Platformsmentioning
confidence: 99%