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 6435 for “"ranking"”.

  1. Integrating OLAP and Ranking: The Ranking-Cube Methodology

    … solution for OLAP, materializing dynamic ranking results is unrealistic because the ranking criteria are not known until the query time. To overcome such difficulty, we develop a new ranking cube method that performs semi on-line materialization and semi online computation in this thesis. …

    uiuc Repository record for Integrating OLAP and Ranking: The Ranking-Cube Methodology (opens in a new tab)

  2. Restrictive ranking

    … is a study of certain aspects of restricted ranking, a method intended for use by a panel of m judges evaluating the relative merits of N subjects, candidates tor scholarships, awards, etc. Each judge divides the N subjects into R classes, so that n₁ individuals receive a grade i (i = 1, 2, …

    vt Repository record for Restrictive ranking (opens in a new tab)

  3. Sequential ranking procedures

    Many statistical procedures used and studied today are sequential in nature. By this we mean that the time when a statistical decision is reached is random. In contrast to such procedures are the fixed sample size procedures. Best known perhaps is sequential analysis and the sequential probability …

    nps Repository record for Sequential ranking procedures (opens in a new tab)

  4. Ranking functions of data

    … cases, as multivariate data lacks a natural ranking. This complicates the analysis and limits the utility of such methods for multivariate data. In response to identified challenges, this work introduces an innovative approach to rank multivariate data through the concept of data depth. It …

    ubc Repository record for Ranking functions of data (opens in a new tab) Download PDF for Ranking functions of data (opens in a new tab)

  5. COMPUTING APPROXIMATE CUSTOMIZED RANKING

    … grows and as users become more sophisticated, ranking techniques become important building blocks to meet user needs when answering queries. PageRank is one of the most successful link-based ranking methods, which iteratively computes the importance scores for web pages based on the importance …

    maryland Repository record for COMPUTING APPROXIMATE CUSTOMIZED RANKING (opens in a new tab)

  6. Markov-based ranking methods

    Ranking methods are an essential tool to help make decisions. This dissertation document examines different aspects of the theory and application of pairwise comparison ranking methods, specifically those that use Markov chains. First, a new method is developed to solve a traditional recruiting …

    purdue-thes Repository record for Markov-based ranking methods (opens in a new tab)

  7. Modelling Partial Ranking Data

    Ranking is one of the most used methods in not only in statistics but also in other field such as computer science and psychology. This method helps us determine order of objects in a group such as preference of animal species, and has very broad applications. However, when the number of objects to …

    kent Download PDF for Modelling Partial Ranking Data (opens in a new tab)

  8. Ad-hoc Holistic Ranking Aggregation

    … relevant informa- tion needed. Aggregation and Ranking are two of the most frequently used tools in data exploration. The interaction between ranking and aggregation has been studied widely from different perspectives. In this thesis, a comprehensive survey about this interaction is studied. …

    waterloo Repository record for Ad-hoc Holistic Ranking Aggregation (opens in a new tab)

  9. Feature Ranking for Text Classifiers

    Feature selection based on feature ranking has received much attention by researchers in the field of text classification. The major reasons are their scalability, ease of use, and fast computation. %, However, compared to the search-based feature selection methods such as wrappers and filters, …

    waterloo Repository record for Feature Ranking for Text Classifiers (opens in a new tab)

  10. Saliency ranking using deep learning

    … refinement to address both of the saliency ranking and subitizing tasks. We also present methods for deriving suitable ranked salient object instances to generate a large scale dataset for saliency ranking, along with metrics suitable to measuring success in a relative object saliency …

    manitoba Repository record for Saliency ranking using deep learning (opens in a new tab)

  11. Kernelized Cost-Sensitive Listwise Ranking

    … machine learning, typically supervised, to build ranking models for Information Retrieval systems. The training data consists of lists of items with some partial order specified induced by an ordinal score or a binary judgment (relevant/not relevant). The model purpose is to produce a permutation …

    rit Repository record for Kernelized Cost-Sensitive Listwise Ranking (opens in a new tab)

  12. Full similarity-based page ranking

    … engine alleviate the problem to some extent by ranking the search results based on the relevancy of the Web pages to user's query. They aim to place the most prominent pages at high ranks. Most of current search engines work by first retrieving a set of Web pages based on traditional text-based …

    missouri Repository record for Full similarity-based page ranking (opens in a new tab)

  13. Document ranking with quantum probabilities

    … the use of quantum probability theory for ranking documents. Quantum probability theory is used to estimate the probability of relevance of a document given a user's query. We posit that quantum probability theory can lead to a better estimation of the probability of a document being …

    glasgow Repository record for Document ranking with quantum probabilities (opens in a new tab) Download PDF for Document ranking with quantum probabilities (opens in a new tab)

  14. Ranking Based on Triple Comparison

    … of them at the same time, or having noise in the ranking process), only noisy partial orders on smaller subsets with a specific cardinal of the items can be obtained. For example, 10 cyclists are going to race with speed, but the track only allows 3 of them to compete simultaneously. How to get a …

    tamu Repository record for Ranking Based on Triple Comparison (opens in a new tab)

  15. Characterization of DEA ranking models

    … have developed methods for using DEA as a ranking model. We classified DEA ranking models into two categories based on whether preferences (weights) are given or not.;Since the ranking result from each model is determined by the characteristics each model has, it is important to understand …

    iastate Repository record for Characterization of DEA ranking models (opens in a new tab)

  16. Reconsidering Ranking-and-Selection Guarantees

    … the various statistical guarantees delivered by ranking-and-selection (R&S) procedures: a class of methods designed for the problem of selecting the best from among a finite number of simulated systems. Examples of such guarantees include ensuring that an optimal or near-optimal system is …

    cornell Repository record for Reconsidering Ranking-and-Selection Guarantees (opens in a new tab)

  17. Supporting Ranking for Data Retrieval

    Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.

    uiuc Repository record for Supporting Ranking for Data Retrieval (opens in a new tab)

Page 1 of 322