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 14 of 14 for “"Rank Aggregation"”.
-
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 …
-
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 …
-
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 …
-
Graduate admissions at MIT & comparison-based rank aggregation : a case study
Admission to the Graduate program in EECS at MIT is done via an all-electronic system. Applicants submit materials through a web interface and faculty "reviewers" read the applications and make notes via a different interface. Among other comments, reviewers provide a numerical score between 1 and …
-
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 …
-
Search using social networks
… information from different sources using Rank Aggregation techniques. Our search system, implemented using Java and Python, covers all the events and web pages present on MIT owned websites. We discuss the theory, design,and implementation of this system in details.
-
Ensemble Methods for Anomaly Detection
… ensemble strategies using score normalization, rank aggregation and majority voting, to combine the results from six well-known base algorithms. We propose a bootstrapping algorithm in which anomalies are evaluated from multiple subsets of the data. Results show that our independent ensemble …
-
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 …
-
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, …
-
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 …
-
Distances on rankings: from social choice to flash memories
… social choice to statistics to coding theory, rankings are found to be a useful vehicle for storing and presenting information in modern data systems. Often, in order to process the information, an appropriately defined distance on rankings is required or at least helpful. For example, in …
-
Assortment and inventory optimization : from predictive choice models to near-optimal algorithms
… of standard nonparametric estimation methods (rank aggregation) can be solved in polynomial time in settings of interest, contrary to general nonparametric models. Predictive experiments on a large purchase panel dataset show significant improvements against common benchmarks. Third, we turn …
-
Ranked personalized recommendations using discrete choice models
… problem of providing such recommendations using ranked data, both as system input and output . In particular, we consider two concrete, and interrelated, scenarios, that capture a large number of applications in a variety of domains. In the first scenario, we consider a set-up where the desired …
-
Vergleichen und Aggregieren von partiellen Ordnungen
Das Vergleichen und Aggregieren von Informationen ist ein zentraler Bereich in der Analyse von Wahlsystemen. In diesen müssen die verschiedenen Meinungen von Wählern über eine Menge von Kandidaten zu einem möglichst gerechten Wahlergebnis aggregiert werden. In den meisten politischen Wahlen …