Results 61 to 70 of about 1,381,457 (160)
Sliding Window Top-K Monitoring over Distributed Data Streams
Data Science and Engineering, 2017 Most of the traditional top-k algorithms are based on a single-server setting. They may be highly inefficient and/or cause huge communication overhead when applied to a distributed system environment.
Ben Chen +3 more
doaj +1 more source
An Efficient Method for Mining Top-
IEEE Access, 2020 The problem of exploiting Closed Sequential Patterns (CSPs) is an essential task in data mining, with many different applications. It is used to resolve the situations of huge databases or low minimum support (minsup) thresholds in mining sequential ...
Thi-Thiet Pham +4 more
doaj +1 more source
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 The objective of top-k planning is to determine a set of k different plans with lowest cost for a given planning task. In practice, such a set of best plans can be preferred to a single best plan generated by ordinary optimal planners, as it allows the user to choose between different alternatives and thus take into account preferences that may be ...
David Speck +2 more
openaire +2 more sources
Evaluación eficiente de consultas Top-k Skyline Efficient evaluation of Top-k Skyline queries
Revista Técnica de la Facultad de Ingeniería, 2009 Tecnologías emergentes permiten el acceso a grandes repositorios de datos, mucho de los cuales pueden publicar datos pocos confiables. Los usuarios que acceden independientemente a estos repositorios deben ser capaces de identificar y descartar ...
Marlene Goncalves, María-Esther Vidal
doaj
Fully Dynamic Algorithm for Top-$k$ Densest Subgraphs
, 2017 Given a large graph, the densest-subgraph problem asks to find a subgraph with maximum average degree. When considering the top-$k$ version of this problem, a na\"ive solution is to iteratively find the densest subgraph and remove it in each iteration ...
Gionis, Aristides +3 more
core +1 more source
Recurrent Neural Networks with Top-k Gains for Session-based Recommendations
, 2018 RNNs have been shown to be excellent models for sequential data and in particular for data that is generated by users in an session-based manner.
Al-Rfou Rami +5 more
core +1 more source
Top-k Spatial Preference Queries in Directed Road Networks
ISPRS International Journal of Geo-Information, 2016 Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching.
Muhammad Attique +3 more
doaj +1 more source
Distributed top-k monitoring [PDF]
Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03, 2003 The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumentation, telecommunications, and others. Many of these applications involve monitoring answers to continuous queries over data streams produced at physically distributed ...
Brian Babcock, Chris Olston
openaire +1 more source
, 2020 Assessors make preference judgments faster and more consistently than graded judgments. Preference judgments can also recognize distinctions between items that appear equivalent under graded judgments. Unfortunately, preference judgments can require more than linear effort to fully order a pool of items, and evaluation measures for preference judgments
Clarke, Charles L. A. +2 more
openaire +2 more sources
Finding Top- $k$ Dominance on Incomplete Big Data Using MapReduce Framework
IEEE Access, 2018 Incomplete data is one major kind of multi-dimensional dataset that has random-distributed missing nodes in its dimensions. It is very difficult to retrieve information from this type of dataset when it becomes large.
Payam Ezatpoor +3 more
doaj +1 more source