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 199 for “"Top-k"”.

  1. Top-K Queries Over Digital Traces

    Recent advances in social and mobile technology have enabled an abundance of digital traces (in the form of mobile check-ins, WiFi hotspots handshaking, etc.) revealing the physical presence history of diverse sets of entities. One challenging, yet important, task is to identify k entities that are …

    york Repository record for Top-K Queries Over Digital Traces (opens in a new tab)

  2. Diversification and fairness in top-k ranking algorithms

    … the user. Hence, figuring out what would be the top-k results is an important task in information retrieval, as it helps to ensure that the most relevant results are presented to the user. There exists an extensive body of research that studies how to score the records and return top-k to the …

    njit Repository record for Diversification and fairness in top-k ranking algorithms (opens in a new tab)

  3. Top-k similarity join over multi-valued objects

    … etc. Given two sets of objects U and V, a top-k similarity join returns k pairs of most similar objects from U x V. The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and …

    unsw Repository record for Top-k similarity join over multi-valued objects (opens in a new tab)

  4. Top-K Query Processing in Edge-Labeled Graph Data

    … along with scalable algorithms to find the top-k answers via a suite of intelligent pruning techniques. The suggested models consist of a practically important subset of the SPARQL query language augmented with some additional useful features. The first model called Substitution Importance …

    maryland Repository record for Top-K Query Processing in Edge-Labeled Graph Data (opens in a new tab)

  5. Supporting top-K item exchange recommendations in large online communities

    Item exchange is becoming popular in many online community systems, e.g. online games and social network web sites. Traditional manual search for possible exchange pairs is neither efficient nor effective. Automatic exchange pairing is increasingly important in such community systems, and can …

    nus Repository record for Supporting top-K item exchange recommendations in large online communities (opens in a new tab) Download file for Supporting top-K item exchange recommendations in large online communities (opens in a new tab)

  6. Top-k Subset Retrieval on Multidimensional Data: Diversity and Fairness

    … attribute of each data point determines the top-k subset retrieval. In practice, multiple attributes are likely to be relevant, requiring top-k subset retrieval on multidimensional datasets. Only a few existing methods work on multidimensional data, and those that do are not efficient for …

    umn Repository record for Top-k Subset Retrieval on Multidimensional Data: Diversity and Fairness (opens in a new tab)

  7. Multicriteria Evaluation for Top-k and Sequence-based Recommender Systems

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Multicriteria Evaluation for Top-k and Sequence-based Recommender Systems (opens in a new tab)

  8. Lightweight Top-K Analysis in DBMSs Using Data Stream Analysis Techniques

    … and the discovery of solutions to resolve them. Top-k analysis is common task in problem determination in database management systems. It involves the identification of the set of most frequently occurring objects according to some criteria, such as the top-k most frequently used tables or most …

    queens Repository record for Lightweight Top-K Analysis in DBMSs Using Data Stream Analysis Techniques (opens in a new tab)

  9. Efficient processing of Top-k queries on spatial and temporal data

    … to users. Observed in real world scenario, top-k results are more interesting to users and a top-k query is a natural way to be asked to reflect a user s preference in terms of a user-defined scoring function. In this thesis, we provide efficient solutions for the top-k queries under various …

    unsw Repository record for Efficient processing of Top-k queries on spatial and temporal data (opens in a new tab)

  10. Portfolio Optimization Using Financial Chaos Index and Time-Homogeneous Top-K Ranking

    … us to tackle the problem of time-dependent top-K ranking. More specifically, given N items, all having positive latent strengths, top-K ranking problem aims to identify the K items receiving the highest ranks based on partially revealed comparisons among the items. This problem has been …

    york Repository record for Portfolio Optimization Using Financial Chaos Index and Time-Homogeneous Top-K Ranking (opens in a new tab)

  11. Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework

    … type of dataset when it becomes huge. Finding top-k dominant values in this type of dataset is a challenging procedure. Some algorithms are present to enhance this process but are mostly efficient only when dealing with a small-size incomplete data. One of the algorithms that make the …

    unlv Repository record for Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework (opens in a new tab) Download PDF for Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework (opens in a new tab)

  12. Top-K Nodes Identification in Big Networks Based on Topology and Activity Analysis

    Graphs and Networks have been the most researched topics with applications ranging from theoretical to practical fields, such as social media, genetics, and education. In many competitive environments, the most productive activities may be interacting with high-profile people, reading a much-cited …

    unlv Repository record for Top-K Nodes Identification in Big Networks Based on Topology and Activity Analysis (opens in a new tab) Download PDF for Top-K Nodes Identification in Big Networks Based on Topology and Activity Analysis (opens in a new tab)

  13. Parallel Processing of Top-K Trajectory Similarity Queries on Big Data Using GPUs

    … queries that can be issued is the top-K trajectory similarity query. This query finds many applications, such as bird migration analysis in ecology and trajectory sharing in social networks. However, the large volumes of the trajectory query sets and databases, along with their …

    oklahoma-thes Repository record for Parallel Processing of Top-K Trajectory Similarity Queries on Big Data Using GPUs (opens in a new tab)

  14. Finding Top-k Similar Document Pairs - speeding up a multi-document summarization approach

    … for similar problems, and found two useful ones: TOP-MATA and Topk Join. We have also created a new algorithm which we call the Segment Bounding Algorithm (SBA). The approaches were evaluated on two data sets - TREC and Opinosis - and the experimental results showed that SBA was the most efficient …

    chalmers Repository record for Finding Top-k Similar Document Pairs - speeding up a multi-document summarization approach (opens in a new tab)

  15. Intégration de Publish/Subscribe avec Top-k dans le système Real-Time Bidding

    … modèle Publish/Subscribe (Pub/Sub) avec filtrage Top-k dans RTB. En particulier, nous utilisons un système Pub/Sub basé sur le contenu afin d’exprimer les intérêts des DSPs, ce qui permet une diffusion sélective des requêtes d’enchères pour éliminer les réponses vides. Nous formulons également le …

    ets-quebec Download PDF for Intégration de Publish/Subscribe avec Top-k dans le système Real-Time Bidding (opens in a new tab)

  16. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems

    … the well-known problem of answering preference top-k queries, which arise in a wide range of applications in databases and computational geometry. Given a set of n points, each with d real-valued attributes, the goal is to organize the points into a suitable data structure so that user …

    umn Repository record for Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems (opens in a new tab)

Page 1 of 10