scholarly journals Partition-Mallows Model and Its Inference for Rank Aggregation

Author(s):  
Wanchuang Zhu ◽  
Yingkai Jiang ◽  
Jun S. Liu ◽  
Ke Deng
Cancers ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 917
Author(s):  
Jun A ◽  
Baotong Zhang ◽  
Zhiqian Zhang ◽  
Hailiang Hu ◽  
Jin-Tang Dong

Molecular signatures predictive of recurrence-free survival (RFS) and castration resistance are critical for treatment decision-making in prostate cancer (PCa), but the robustness of current signatures is limited. Here, we applied the Robust Rank Aggregation (RRA) method to PCa transcriptome profiles and identified 287 genes differentially expressed between localized castration-resistant PCa (CRPC) and hormone-sensitive PCa (HSPC). Least absolute shrinkage and selection operator (LASSO) and stepwise Cox regression analyses of the 287 genes developed a 6-gene signature predictive of RFS in PCa. This signature included NPEPL1, VWF, LMO7, ALDH2, NUAK1, and TPT1, and was named CRPC-derived prognosis signature (CRPCPS). Interestingly, three of these 6 genes constituted another signature capable of distinguishing CRPC from HSPC. The CRPCPS predicted RFS in 5/9 cohorts in the multivariate analysis and remained valid in patients stratified by tumor stage, Gleason score, and lymph node status. The signature also predicted overall survival and metastasis-free survival. The signature’s robustness was demonstrated by the C-index (0.55–0.74) and the calibration plot in all nine cohorts and the 3-, 5-, and 8-year area under the receiver operating characteristic curve (0.67–0.77) in three cohorts. The nomogram analyses demonstrated CRPCPS’ clinical applicability. The CRPCPS thus appears useful for RFS prediction in PCa.


2011 ◽  
Vol 84 (1) ◽  
pp. 130-143 ◽  
Author(s):  
Leonidas Akritidis ◽  
Dimitrios Katsaros ◽  
Panayiotis Bozanis

2017 ◽  
Vol 78 ◽  
pp. 103-109 ◽  
Author(s):  
Esther Dopazo ◽  
María L. Martínez-Céspedes

2012 ◽  
Vol 9 (1) ◽  
pp. 32-43 ◽  
Author(s):  
Jinlu Cai ◽  
Henry L. Keen ◽  
Curt D. Sigmund ◽  
Thomas L. Casavant

Summary Microarrays have been widely used to study differential gene expression at the genomic level. They can also provide genome-wide co-expression information. Biologically related datasets from independent studies are publicly available, which requires robust combined approaches for integration and validation. Previously, meta-analysis has been adopted to solve this problem.As an alternative to meta-analysis, for microarray data with high similarity in biological experimental design, a more direct combined approach is possible. Gene-level normalization across datasets is motivated by the different scale and distribution of data due to separate origins. However, there has been limited discussion about this point in the past. Here we describe a combined approach for microarray analysis, including gene-level normalization and Coex-Rank approach. After normalization, a linear modeling process is used to identify lists of differentially expressed genes. The Coex-Rank approach incorporates co-expression information into a rank-aggregation procedure. We applied this computational approach to our data, which illustrated an improvement in statistical power and a complementary advantage of the Coex-Rank approach from a biological perspective.Our combined approach for microarray data analysis (Coex-rank) is based on normalization, which is naturally driven. The Coex-rank process not only takes advantage of merging the power of multiple methods regarding normalization but also assists in the discovery of functional clusters of genes.


2018 ◽  
Vol 29 (1) ◽  
pp. 653-663 ◽  
Author(s):  
Ritu Meena ◽  
Kamal K. Bharadwaj

Abstract Many recommender systems frequently make suggestions for group consumable items to the individual users. There has been much work done in group recommender systems (GRSs) with full ranking, but partial ranking (PR) where items are partially ranked still remains a challenge. The ultimate objective of this work is to propose rank aggregation technique for effectively handling the PR problem. Additionally, in real applications, most of the studies have focused on PR without ties (PRWOT). However, the rankings may have ties where some items are placed in the same position, but where some items are partially ranked to be aggregated may not be permutations. In this work, in order to handle problem of PR in GRS for PRWOT and PR with ties (PRWT), we propose a novel approach to GRS based on genetic algorithm (GA) where for PRWOT Spearman foot rule distance and for PRWT Kendall tau distance with bucket order are used as fitness functions. Experimental results are presented that clearly demonstrate that our proposed GRS based on GA for PRWOT (GRS-GA-PRWOT) and PRWT (GRS-GA-PRWT) outperforms well-known baseline GRS techniques.


Sign in / Sign up

Export Citation Format

Share Document