• Corpus ID: 205355

How to select the largest k elements from evolving data?

  title={How to select the largest k elements from evolving data?},
  author={Qin Huang and Xingwu Liu and Xiaoming Sun and Jialin Zhang},
In this paper we investigate the top-$k$-selection problem, i.e. determine the largest, second largest, ..., and the $k$-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied[2]: finding the largest element and the median; and sorting all elements. This paper systematically deals with $k\in… 

Figures and Tables from this paper


Sort Me If You Can: How to Sort Dynamic Data
A new computational model for dynamic data is formed that focuses on the fundamental problems of sorting and selection, where the true ordering of the elements changes slowly, and provides algorithms with performance close to the optimal in expectation and with high probability.
Dynamic Data: Model, Sorting, Selection
This paper is intended as an introduction to and explanation of Sorting and Selection on Dynamic Data[1], a paper published by Anagnostopoulos et al. in an attempt to address the problems that the
Fast and Exact Top-k Algorithm for PageRank
F-Rank iteratively estimates lower/upper bounds of Page\-Rank scores and constructs subgraphs in each iteration by pruning unnecessary nodes and edges to identify top-k nodes without sacrificing accuracy.
PageRank on an evolving graph
Under a stylized model of graph evolution, an algorithm is proposed that achieves a provable performance guarantee that is significantly better than the naive algorithm that crawls the nodes in a round-robin fashion.
Algorithms for multi-armed bandit problems
The findings demonstrate that bandit algorithms are attractive alternatives to current adaptive treatment allocation strategies and may guide the design of subsequent empirical evaluations.
Sorting and Selection with Imprecise Comparisons
The model is inspired by both imprecision in human judgment of values and also by bounded but potentially adversarial errors in the outcomes of sporting tournaments, and the results provide strong lower bounds and close-to-optimal solutions for each of these problems.
Time Bounds for Selection
Scalable and Robust Management of Dynamic Graph Data
The classic challenges of data distribution and replication are imbued with renewed significance given continuously generated graph snapshots and the G* system is extended for highly scalable and robust operation.
Selecting the median
It is shown that the median of a set containing n elements can always be found using at most at most $c \cdot n$ comparisons, where c<2.95.