The DOI matches its Crossref record.
Improving recommendation lists through topic diversification
Abstract
In this work we present topic diversification, a novel method designed to balance and diversify personalized recommendation lists in order to reflect the user's complete spectrum of interests. Though being detrimental to average accuracy, we show that our method improves user satisfaction with recommendation lists, in particular for lists generated using the common item-based collaborative filtering algorithm.Our work builds upon prior research on recommender systems, looking at properties of recommendation lists as entities in their own right rather than specifically focusing on the accuracy of individual recommendations. We introduce the intra-list similarity metric to assess the topical diversity of recommendation lists and the topic diversification approach for decreasing the intra-list similarity. We evaluate our method using book recommendation data, including offline analysis on 361, !, 349 ratings and an online study involving more than 2, !, 100 subjects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Introduction to Recommender Systems Handbook
Ricci, F., Rokach, L., & Shapira, B. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_1 · Cited by 2,378
Explaining machine learning classifiers through diverse counterfactual explanations
Mothilal, R. K., Sharma, A., & Tan, C. (2020) · Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency · doi:10.1145/3351095.3372850 · Cited by 1,233
Context-Aware Recommender Systems
Adomavicius, G., & Tuzhilin, A. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_7 · Cited by 1,102
Bao, K., Zhang, J., Zhang, Y., Wang, W., Feng, F., & He, X. (2023) · Proceedings of the 17th ACM Conference on Recommender Systems · doi:10.1145/3604915.3608857 · Cited by 469
Kaminskas, M., & Bridge, D. (2017) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2926720 · Cited by 465
Möller, J., Trilling, D., Helberger, N., & van Es, B. (2018) · Information, Communication & Society · doi:10.1080/1369118x.2018.1444076 · Cited by 387
Trust building with explanation interfaces
Pu, P., & Chen, L. (2006) · Proceedings of the 11th international conference on Intelligent user interfaces · doi:10.1145/1111449.1111475 · Cited by 300
Understanding choice overload in recommender systems
Bollen, D., Knijnenburg, B. P., Willemsen, M. C., & Graus, M. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864724 · Cited by 232
Layered evaluation of interactive adaptive systems: framework and formative methods
Paramythis, A., Weibelzahl, S., & Masthoff, J. (2010) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-010-9082-4 · Cited by 145
Diversity in Big Data: A Review
Drosou, M., Jagadish, H. V., Pitoura, E., & Stoyanovich, J. (2017) · Big Data · doi:10.1089/big.2016.0054 · Cited by 140
Evolution and impact of bias in human and machine learning algorithm interaction
Sun, W., Nasraoui, O., & Shafto, P. (2020) · PLOS ONE · doi:10.1371/journal.pone.0235502 · Cited by 116
Fairness in package-to-group recommendations
Serbos, D., Qi, S., Mamoulis, N., Pitoura, E., & Tsaparas, P. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052612 · Cited by 107
Behaviorism is Not Enough: Better Recommendations through Listening to Users
Ekstrand, M. D., & Willemsen, M. C. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959179 · Cited by 101
Privacy-Aware Recommendation with Private-Attribute Protection using Adversarial Learning
Beigi, G., Mosallanezhad, A., Guo, R., Alvari, H., Nou, A., & Liu, H. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371832 · Cited by 80
Composite Retrieval of Diverse and Complementary Bundles
Amer-Yahia, S., Bonchi, F., Castillo, C., Feuerstein, E., Mendez-Diaz, I., & Zabala, P. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2306678 · Cited by 42
Deep Learning Models for Serendipity Recommendations: A Survey and New Perspectives
Fu, Z., Niu, X., & Maher, M. L. (2024) · ACM Computing Surveys · doi:10.1145/3605145 · Cited by 30
Misztal-Radecka, J., & Indurkhya, B. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102519 · Cited by 29
Decentralized Graph Neural Network for Privacy-Preserving Recommendation
Zheng, X., Wang, Z., Chen, C., Qian, J., & Yang, Y. (2023) · Proceedings of the 32nd ACM International Conference on Information and Knowledge Management · doi:10.1145/3583780.3614834 · Cited by 10
Metadata
- Authors
- Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G.
- Venue
- Proceedings of the 14th international conference on World Wide Web - WWW '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 22
- OpenAlex
- W2155912844
- Cited by
- 1,892
- References
- 0
- Type
- conference abstract
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
