skip to main content
10.1145/1807167.1807258acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Constructing and exploring composite items

Published: 06 June 2010 Publication History

Abstract

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.

References

[1]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB '94: Proceedings of the 20th International Conference on Very Large Data Bases, pages 487--499, San Francisco, CA, USA, 1994. Morgan Kaufmann Publishers Inc.
[2]
D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng., 17(11):1490--1504, 2005.
[3]
R. Fagin and et. al. Optimal Aggregation Algorithms for Middleware. In PODS, 2001.
[4]
R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614--656, 2003.
[5]
W. A. Gale and G. Sampson. Good-turing frequency estimation without tears. Journal of Quantitative Linguistics, 2(3):217--237, 1995.
[6]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
[7]
D. Gunopulos, H. Mannila, and S. Saluja. Discovering all most specific sentences by randomized algorithms. In F. N. Afrati and P. G. Kolaitis, editors, ICDT, volume 1186 of Lecture Notes in Computer Science, pages 215--229. Springer, 1997.
[8]
R. J. B. Jr. Efficiently mining long patterns from databases. In L. M. Haas and A. Tiwary, editors, SIGMOD Conference, pages 85--93. ACM Press, 1998.
[9]
X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skyline operator. In ICDE, pages 86--95, 2007.
[10]
M. Miah, G. Das, V. Hristidis, and H. Mannila. Standing out in a crowd: Selecting attributes for maximum visibility. In ICDE, pages 356--365, 2008.
[11]
R. Motowani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
[12]
E. Vee, U. Srivastava, J. Shanmugasundaram, P. Bhat, and S. Amer-Yahia. Efficient computation of diverse query results. In ICDE, pages 228--236, 2008.
[13]
X. Yang, C. M. Procopiuc, and D. Srivastava. Summarizing relational databases. PVLDB, 2(1):634--645, 2009.
[14]
C. Yu and H. V. Jagadish. Schema summarization. In U. Dayal, K.-Y. Whang, D. B. Lomet, G. Alonso, G. M. Lohman, M. L. Kersten, S. K. Cha, and Y.-K. Kim, editors, VLDB, pages 319--330. ACM, 2006.

Cited By

View all
  • (2024)A Model for Retrieving High-Utility Itemsets with Complementary and Substitute GoodsAdvances in Knowledge Discovery and Data Mining10.1007/978-981-97-2242-6_27(340-352)Online publication date: 25-Apr-2024
  • (2022)EDA4SUMProceedings of the VLDB Endowment10.14778/3554821.355485115:12(3590-3593)Online publication date: 1-Aug-2022
  • (2020)Package recommender systems: A systematic reviewIntelligent Decision Technologies10.3233/IDT-19014013:4(435-452)Online publication date: 10-Feb-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
June 2010
1286 pages
ISBN:9781450300322
DOI:10.1145/1807167
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. composite item construction
  2. e-commerce application
  3. np-hard problems

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '10
Sponsor:
SIGMOD/PODS '10: International Conference on Management of Data
June 6 - 10, 2010
Indiana, Indianapolis, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A Model for Retrieving High-Utility Itemsets with Complementary and Substitute GoodsAdvances in Knowledge Discovery and Data Mining10.1007/978-981-97-2242-6_27(340-352)Online publication date: 25-Apr-2024
  • (2022)EDA4SUMProceedings of the VLDB Endowment10.14778/3554821.355485115:12(3590-3593)Online publication date: 1-Aug-2022
  • (2020)Package recommender systems: A systematic reviewIntelligent Decision Technologies10.3233/IDT-19014013:4(435-452)Online publication date: 10-Feb-2020
  • (2018)Item Retrieval as Utility EstimationThe 41st International ACM SIGIR Conference on Research & Development in Information Retrieval10.1145/3209978.3210053(795-804)Online publication date: 27-Jun-2018
  • (2018)Package queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-017-0483-427:5(693-718)Online publication date: 1-Oct-2018
  • (2017)A Scalable Execution Engine for Package QueriesACM SIGMOD Record10.1145/3093754.309376146:1(24-31)Online publication date: 12-May-2017
  • (2017)Exploratory product search using top-k join queriesInformation Systems10.1016/j.is.2016.09.00464:C(75-92)Online publication date: 1-Mar-2017
  • (2017)Association Rule Based Approach to Improve Diversity of Query RecommendationsDatabase and Expert Systems Applications10.1007/978-3-319-64471-4_27(340-350)Online publication date: 2-Aug-2017
  • (2016)Scalable package queries in relational database systemsProceedings of the VLDB Endowment10.14778/2904483.29044899:7(576-587)Online publication date: 1-Mar-2016
  • (2016)Recommendations beyond the ratings matrixProceedings of the Workshop on Data-Driven Innovation on the Web10.1145/2911187.2914580(1-5)Online publication date: 22-May-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media