Randomized algorithms
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Discovering All Most Specific Sentences by Randomized Algorithms
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
MAFIA: A Maximal Frequent Itemset Algorithm
IEEE Transactions on Knowledge and Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient Computation of Diverse Query Results
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Summarizing relational databases
Proceedings of the VLDB Endowment
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Information seeking: convergence of search, recommendations, and advertising
Communications of the ACM
Multi-objective optimal combination queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Multi-objective optimal combination queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Evaluation of set-based queries with aggregation constraints
Proceedings of the 20th ACM international conference on Information and knowledge management
A parallel algorithm for computing borders
Proceedings of the 20th ACM international conference on Information and knowledge management
Improving the performance of recommender system by exploiting the categories of products
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Comprehension-based result snippets
Proceedings of the 21st ACM international conference on Information and knowledge management
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Shortlisting top-K assignments
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Aggregated search: A new information retrieval paradigm
ACM Computing Surveys (CSUR)
Composite retrieval of heterogeneous web search
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.02 |
Nowadays, online shopping has become a daily activity. Web users purchase a variety of items ranging from books to electronics. The large supply of online products calls for sophisticated techniques to help users explore available items. We propose to build composite items which associate a central item with a set of packages, formed by satellite items, and help users explore them. For example, a user shopping for an iPhone (i.e., the central item) with a price budget can be presented with both the iPhone and a package of other items that match well with the iPhone (e.g., {Belkin case, Bose sounddock, Kroo USB cable}) as a composite item, whose total price is within the user's budget. We define and study the problem of effective construction and exploration of large sets of packages associated with a central item, and design and implement efficient algorithms for solving the problem in two stages: summarization, a technique which picks k representative packages for each central item; and visual effect optimization, which helps the user find diverse composite items quickly by minimizing overlap between packages presented to the user in a ranked order. We conduct an extensive set of experiments on Yahoo! Shopping1 data sets to demonstrate the efficiency and effectiveness of our algorithms.