MRI: Meaningful interpretations of collaborative ratings

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 1063-1074

  Das, Mahashweta ^a   Amer Yahia, Sihem ^b   Das, Gautam ^a   Yu, Cong ^c  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b QATAR COMPUTING RESEARCH INSTITUTE   (Qatar)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CUBE; EVALUA-TION; INFORMED DECISION; NP-HARD; PERFORMANCE; PURCHASING DECISIONS; RATING AGGREGATION; SIMPLE++; SUB-PROBLEMS; USER STUDY;

EID: 84863766926     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402742     Document Type: Conference Paper

References (15)

1. S. Acharya, P. B. Gibbons and V. Poosala. Congressional samples for approximate answering of group-by queries. In SIGMOD, 487-498, 2000.
2. R. Agrawal, J. Gehrke, D. Gunopulos and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD, 94-105, 1998.
3. M. Bilgic and R. J. Mooney. Explaining recommendations: Satisfaction vs. promotion. In Beyond Personalization (workshop at IUI), 13-18, 2005.
4. Y. Chen, F. M. Harper, J. A. Konstan and S. X. Li. Social comparisons and contributions to online communities: A field experiment on movielens. In Computational Social Systems and the Internet, 2007.
5. N. M. David, D. W. Cheung and W. Lian. Similarity search in sets and categorical data using the signature tree. In ICDE, 75-86, 2003.
6. J. Gray, A. Bosworth, A. Layman, D. Reichart and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In ICDE, 152-159, 1996.
7. J. L. Herlocker, J. A. Konstan and J. Riedl. Explaining collaborative filtering recommendations. In CSCW, 241-250, 2000.
8. L. Hyafil and R. L. Rives. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5: 15-17, 1976.
9. L. V. S. Lakshmanan, J. Pei and J. Han. Quotient cube: how to summarize the semantics of a data cube. In VLDB, 778-789, 2002.
10. R. Ramakrishnan and B.-C. Chen. Exploratory mining in cube space. Data Mining and Knowledge Discovery, 15(1): 29-54, 2007.
11. G. Sathe and S. Sarawagi. Intelligent rollups in multidimensional olap data. In VLDB, 531-540, 2001.
12. D. E. Vaughan, S. H. Jacobson and H. Kaul. Analyzing the performance of simultaneous generalized hill climbing algorithms. Computational Optimization and Applications, 37: 103-119, 2007.
13. P. Wu, Y. Sismanis and B. Reinwald. Towards keyword-driven analytical processing. In SIGMOD, 617-628, 2007.
14. T. Wu, D. Xin, Q. Mei and J. Han. Promotion analysis in multi-dimensional space. PVLDB, 2(1): 109-120, 2009.
15. C. Yu, L. V. S. Lakshmanan and S. Amer-Yahia. It takes variety to make a world: diversification in recommender systems. In EDBT, 368-378, 2009.