COMPUTATION OF TOP-K PAIRWISE CO-OCCURRENCE STATISTICS

摘要

Various technologies described herein pertain to computing top-K pairwise co-occurrence statistics using an upper bounding heuristic. Upper bound values of a co-occurrence statistic for items in a set can be computed based on a query item, and items can be sorted into an order. The items and the query item are represented by respective portions of a tensor. An item from the order associated with a highest upper bound value can be selected, an actual value of the co-occurrence statistic can be computed for the selected item, the upper bound value for the selected item can be replaced with the actual value for the selected item, and the selected item can be repositioned in the order. When the top-K items in the order lack an item associated with an upper bound value, the top-K items and actual values of the co-occurrence statistic for the top-K items can be outputted.