Constructing and exploring composite items

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 843-854

  Basu Roy, Senjuti ^b   Amer Yahia, Sihem ^a   Chawla, Ashish ^a,b   Das, Gautam ^b   Yu, Cong ^a  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

composite item construction; e commerce application; np hard problems

Indexed keywords

DAILY ACTIVITY; DATA SETS; E-COMMERCE APPLICATIONS; EFFICIENT ALGORITHM; NP-HARD PROBLEM; NP-HARD PROBLEMS; ONLINE PRODUCTS; ONLINE SHOPPING; TWO STAGE; USB CABLES; VISUAL EFFECTS; WEB USERS;

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; OPTIMIZATION; PACKAGING; VISUAL COMMUNICATION;

PROBLEM SOLVING;

EID: 77954800656     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807258     Document Type: Conference Paper

References (14)

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.