Standing Out in a Crowd: Selecting Attributes for Maximum Visibility

In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in databases (e.g., buyers searching for products in a catalog). In this paper we focus on a novel and complementary problem: how to guide a seller in selecting the best attributes of a new tuple (e.g., new product) to highlight such that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. We develop several interesting formulations of this problem. Although these problems are NPcomplete, we can give several exact algorithms as well as approximation heuristics that work well in practice. Our exact algorithms are based on Integer Programming (IP) formulations of the problems, as well as on adaptations of maximal frequent itemset mining algorithms, while our approximation algorithms are based on greedy heuristics. We conduct a performance study illustrat...

• Type: Conference
• Year: 2008
• Where: ICDE
• Authors: Muhammed Miah, Gautam Das, Vagelis Hristidis, Heikki Mannila
• Keywords: Approximation Algorithms, Database, Exact Algorithms, ICDE 2008, Top-k Retrieval Algorithms