Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 38 for “"rank aggregation"”.

  1. Distributed content collection and rank aggregation

    … system with joint content collection and rank aggregation. In such a system, peers contact each other and exchange partial preference information about items, which, for example, could be videos. Peers use recommendation strategies to make decisions with limited knowledge and collect items …

    uiuc Repository record for Distributed content collection and rank aggregation (opens in a new tab)

  2. Listwise frameworks for ranking and rank aggregation

    The goal in Learning to Rank (LETOR) is to learn to order a novel set of items, given training data comprising sets of items and their orderings. There are three important problems in LETOR: capturing individual item relevance, using item interaction information to diversify rankings and …

    texas Repository record for Listwise frameworks for ranking and rank aggregation (opens in a new tab)

  3. Gene prioritization through hybrid distance-score rank aggregation

    This thesis is concerned with developing novel rank aggregation methods for gene prioritization. Gene prioritization refers to a family of computational techniques for inferring disease genes through a set of training genes and carefully chosen similarity criteria. Test genes are scored based on …

    uiuc Repository record for Gene prioritization through hybrid distance-score rank aggregation (opens in a new tab)

  4. A novel weighted rank aggregation algorithm with applications in gene prioritization

    … bounding/approximating the optimal solution of rank aggregation problems based on weighted Kendall distances. The algorithms represent linear programming relaxations of integer programs that involve variables reflecting partial orders of three or more candidates. Our simulation results indicate …

    uiuc Repository record for A novel weighted rank aggregation algorithm with applications in gene prioritization (opens in a new tab)

  5. An adaptive ensemble learner function via bagging and rank aggregation with applications to high dimensional data.

    … function is constructed by combining bagging and rank aggregation that is capable of changing its performance depending on the type of data that is being used. In the classification approach, the results can be optimized with respect to performance measures such as accuracy, sensitivity, …

    louisville Repository record for An adaptive ensemble learner function via bagging and rank aggregation with applications to high dimensional data. (opens in a new tab)

  6. God does not play dice... and neither should approximation algorithms

    … by Ailon, Charikar and Newman for several ranking and clustering problems. In addition to obtaining the same performance guarantees, the analysis of our algorithms is actually simpler than that of their randomized counterparts. Finally, we take a more practical approach to one of the …

    cornell Repository record for God does not play dice... and neither should approximation algorithms (opens in a new tab)

  7. Inferring regulation programs in a transcription regulatory module network

    … we select are union, intersection, and weighted rank aggregation. The experiments in a yeast dataset show that the union and weighted rank aggregation methods produce more accurate predictions than those given by individual algorithms, whereas the intersection method does not yield any …

    concordia Download PDF for Inferring regulation programs in a transcription regulatory module network (opens in a new tab)

  8. Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations

    … two related problems Neighbour String and Kemeny Rank Aggregation. In both problems, the goal is to find a solution that is as close as possible to a set of inputs (strings and total orders, respectively) according to some distance measure. We also introduce a notion of enumerative kernels for …

    waterloo Repository record for Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations (opens in a new tab)

  9. Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation

    … concise RTL assertions. We develop an assertion ranking methodology. We define assertion importance, complexity, rank and ideality and we detail methods to compute each of them. We present a case study and experimental results to demonstrate the effectiveness of assertion rank. We develop an …

    uiuc Repository record for Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation (opens in a new tab)

  10. Methods and algorithms for service selection and recommendation (preference and aggregation based)

    … non-functional attributes may result in a ranked list of services that partially meet their needs. When this happens, it is natural for users to submit other similar requests, with varying preferences on non-functional attributes, in an attempt to find services that fully meet their needs. …

    must-thes Repository record for Methods and algorithms for service selection and recommendation (preference and aggregation based) (opens in a new tab)

  11. Statistical analysis for modeling dyadic interactions using machine learning methods

    … data clustering, social network analysis and ranking. In this dissertation, we introduce several improved models for modeling dyadic interactions in machine learning by taking advantage of sophisticated information from different sources, such as prior structure, domain knowledge and side …

    texas Repository record for Statistical analysis for modeling dyadic interactions using machine learning methods (opens in a new tab)

  12. OptCluster : an R package for determining the optimal clustering algorithm and optimal number of clusters.

    … the final result is obtained through a weighted rank aggregation algorithm based on the calculated validation scores. Two examples using this package are presented, one with a microarray dataset and the other with an RNA-Seq dataset. These two examples highlight the capabilities the optCluster …

    louisville Repository record for OptCluster : an R package for determining the optimal clustering algorithm and optimal number of clusters. (opens in a new tab)

  13. ORBIT (Ordering Based Information Transfer): A Physics Guided Machine Learning Framework to Monitor the Dynamics of Water Bodies at a Global Scale

    … all the cases. This thesis introduces a new rank aggregation approach to infer the inherent ordering from the noisy labels. This thesis also introduces a new approach that makes use of this elevation constraint to enforce temporal consistency in surface area variations of water bodies. …

    umn Repository record for ORBIT (Ordering Based Information Transfer): A Physics Guided Machine Learning Framework to Monitor the Dynamics of Water Bodies at a Global Scale (opens in a new tab)

  14. A Combining Approach to Cover Song Identification

    … with standard metrics, such as the mean rank, the mean reciprocal rank and the mean average precision. Using our evaluation space, we present a comparative analysis of 10 systems. The results show that few systems are usable in a commercial system, as the most efficient is able to …

    liege Repository record for A Combining Approach to Cover Song Identification (opens in a new tab) Download PDF for A Combining Approach to Cover Song Identification (opens in a new tab)

  15. Engineering search algorithms for web data

    … on TZP, we introduce BM25TOPF, a probabilistic ranking function which in contrast to the existing probabilistic functions of the Okapi family, takes into consideration the word ordering in the query, and combines term proximity with zone scoring. Furthermore, we examine the essential problems …

    greece Repository record for Engineering search algorithms for web data (opens in a new tab)

  16. Improving Predictive Modeling in High Dimensional, Heterogeneous and Sparse Health Care Data

    … handling high-dimensional data a novel robust rank aggregation-based feature selection technique has been developed using exclusive rank aggregation strategies by Borda (1781) and Kemeny (1959). The concept of robustness of a feature selection algorithm has been introduced, which can be defined …

    umn Repository record for Improving Predictive Modeling in High Dimensional, Heterogeneous and Sparse Health Care Data (opens in a new tab)

  17. Investigating Comparison-based Evaluation for Sparse Data

    … (average ratings from the population) or true rankings (rankings based on true ratings). Based on the law of large numbers, average ratings from large samples can well serve the purpose. However, in practice evaluation data are typically extremely sparse and each entity would receive a very …

    texas-state Repository record for Investigating Comparison-based Evaluation for Sparse Data (opens in a new tab)

  18. Heuristic ensembles of filters for accurate and reliable feature selection

    … two types of filters: subset filters and ranking filters with a heuristic consensus algorithm in order to utilise the strength of each type. The ensemble is tested on ten benchmark datasets and its performance is evaluated by two stability measures and three classifiers. The experimental …

    east-anglia Download PDF for Heuristic ensembles of filters for accurate and reliable feature selection (opens in a new tab)

  19. Exploring Heuristics for Predicting Microbenchmark Stability and Code Coverage using Static Code Analysis

    … The second heuristic was designed using average rank aggregation and showed promising results. A balance was achieved where strengths in either stability or code coverage compensated for lesser performance in the other.

    chalmers Repository record for Exploring Heuristics for Predicting Microbenchmark Stability and Code Coverage using Static Code Analysis (opens in a new tab)

  20. Rankings: From similarity distances computation to interactive synchronization

    Two problems related to rankings are investigated in this thesis. We first address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, …

    uiuc Repository record for Rankings: From similarity distances computation to interactive synchronization (opens in a new tab)

Page 1 of 2