Results 271 to 280 of about 9,334,973 (302)
Some of the next articles are maybe not open access.

Mining Top-K Multidimensional Gradients

2007
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing gradient data analysis one is able to identify trends, outliers and answering "what-if" questions over large databases. Gradient queries were first introduced by Imielinski et
Ronnie Alves, Orlando Belo, Joel Ribeiro
openaire   +3 more sources

Top-k-lists

Metrika, 2006
Top-k-lists are introduced as sequences of k-dimensional random vectors with ordered components being k largest observations from a sequence of independent identically distributed random variables. Such lists changing in time are natural stochastic models of ranking tables which appear in many situations in real life, when one wants to keep a track of ...
Fernando López-Blázquez   +1 more
openaire   +1 more source

Scalable top-k retrieval with Sparta

Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020
Many big data processing applications rely on a top-k retrieval building block, which selects (or approximates) the k highest-scoring data items based on an aggregation of features. In web search, for instance, a document's score is the sum of its scores for all query terms.
Gali Sheffi   +4 more
openaire   +1 more source

Top-k Algorithms and Applications

2009
In recent years, there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in relational databases, document and multimedia databases, scientific information systems, and so on. A popular paradigm for tackling this problem is top-k querying, i.e., the ranking of the results and returning the k results ...
openaire   +1 more source

Top-K oracle: A new way to present top-k tuples for uncertain data

2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013
Managing noisy and uncertain data is needed in a great number of modern applications. A major difficulty in managing such data is the sheer number of query result tuples with diverse probabilities. In many cases, users have a preference over the tuples in a deterministic world, determined by a scoring function.
Chunyao Song, Zheng Li, Tingjian Ge
openaire   +1 more source

Top-k queries

2012
Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring
Akrivi Vlachou   +3 more
openaire   +1 more source

Transparent wood-based functional materials via a top-down approach

Progress in Materials Science, 2023
Sailing Zhu   +2 more
exaly  

Identifying Top- k Nodes in Social Networks

ACM Computing Surveys, 2020
Ranran Bian   +2 more
exaly  

Single top-quark production at the Tevatron and the LHC

Reviews of Modern Physics, 2018
A Giammanco, R Schwienhorst
exaly  

A survey of top- k query processing techniques in relational database systems

ACM Computing Surveys, 2008
Ihab F Ilyas, Mohamed A Soliman
exaly  

Home - About - Disclaimer - Privacy