Constructing and exploring composite items

Constructing and exploring composite items
复制标题

构建和探索复合项目

DOI:
10.1145/1807167.1807258
复制
发表时间:
2010
期刊:
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
影响因子:
--
通讯作者:
Cong Yu
Cong Yu
中科院分区:
--
文献类型:
--
作者:
Senjuti Basu Roy;S. Amer;Ashish Chawla;Gautam Das;Cong Yu

文献摘要

被引文献

相似文献

如今,网上购物已经成为一种日常活动。网络用户购买各种各样的物品,从书籍到电子产品。在线产品的大量供应需要复杂的技术来帮助用户探索可用的项目。我们建议建立一个中心项目相关联的一组包,卫星项目形成的复合项目,并帮助用户探索它们。例如,用户购买iPhone(即,具有价格预算的中心项目)可以与iPhone和与iPhone匹配良好的其他项目的包一起呈现(例如,{Belkin外壳、Bose sounddock、Kroo USB线缆})作为复合物品,其总价在用户的预算范围内。我们定义并研究了与中心项目相关的大集合包的有效构造和探索问题,并设计和实现了两个阶段解决问题的有效算法:摘要,为每个中心项目选择k个代表性包的技术;和视觉效果优化,这通过最小化以分级顺序呈现给用户的包之间的重叠来帮助用户快速找到不同的复合项目。我们在Yahoo!Shopping 1数据集来证明我们的算法的效率和有效性。
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.