Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 866

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 872

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 1183

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 1961

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 3027

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 3592

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 3667

Deprecated: Assigning the return value of new by reference is deprecated in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/adodb.inc.php on line 3687

Deprecated: mysql_connect(): The mysql extension is deprecated and will be removed in the future: use mysqli or PDO instead in /home/benjaminarai/benjaminarai.com/3.91/.html/benjamin_arai/adodb/drivers/adodb-mysql.inc.php on line 339
On Burstiness-Aware Search for Document Sequences - Publications :: Benjamin Arai

Benjamin Arai Graduate Student About Benjamin Arai
Reasearch
Teaching
Contact






Main Menu

 
View Benjamin Arai's LinkedIn profileView my profile



Publications


Title: Anytime measures for top-k algorithms on exact and fuzzy data sets

Abstract:Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime behavior of top-k algorithms on exact and fuzzy data. In particular, given specific top-k algorithms (TA and TA-Sorted) we are interested in studying their progress toward identification of the correct result at any point during the algorithmsí execution. We adopt a probabilistic approach where we seek to report at any point of operation of the algorithm the confidence that the top-k result has been identified. Such a functionality can be a valuable asset when one is interested in reducing the runtime cost of top-k computations. We present a thorough experimental evaluation to validate our techniques using both synthetic and real data sets.

[Download full paper from SpringerLink]