Module 8: Miscellaneous Topics
  Lecture 37: Aggregation
 

                                            

 

 

Analysis
  • Correct
  • Any object not seen cannot be in top- list
  • Dominated by threshold score
  • Monotonicity property
  • Instance optimal
  • For any algorithm that does not make random guesses and any sorted list, cost of TA has the same order as the best algorithm
 
  • Best for any instance (any database, any , etc.)
  • FA is optimal with a high probability