Skip to main content
Article thumbnail
Location of Repository

Solving the Top-K Problem with Fixed-Memory Heuristic Search

By Keith Henderson and Tina Eliassi-rad

Abstract

The Top-K problem is defined as follows. Given L lists of real numbers, find the top K scoring L-tuples. A tuple is scored by the sum of its components. Rare event modeling and event ranking are often reduced to the Top-K problem. In this paper, we present the application of a fixedmemory heuristic search algorithm (namely, SMA*) and its distributed-memory extension to the Top-K problem. Our approach has efficient runtime complexity and super-linear speedup in distributed-memory setting. Experimental studies on both synthetic and real-world data sets show the effectiveness of our approach

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.8048
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://eliassi.org/papers/hend... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.