The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
TriRank: Review-aware Explainable Recommendation by Modeling Aspects
Abstract
Most existing collaborative filtering techniques have focused on modeling the binary relation of users to items by extracting from user ratings. Aside from users' ratings, their affiliated reviews often provide the rationale for their ratings and identify what aspects of the item they cared most about. We explore the rich evidence source of aspects in user reviews to improve top-N recommendation. By extracting aspects (i.e., the specific properties of items) from textual reviews, we enrich the user--item binary relation to a user--item--aspect ternary relation. We model the ternary relation as a heterogeneous tripartite graph, casting the recommendation task as one of vertex ranking. We devise a generic algorithm for ranking on tripartite graphs -- TriRank -- and specialize it for personalized recommendation. Experiments on two public review datasets show that it consistently outperforms state-of-the-art methods. Most importantly, TriRank endows the recommender system with a higher degree of explainability and transparency by modeling aspects in reviews. It allows users to interact with the system through their aspect preferences, assisting users in making informed decisions.
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
Cites
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135
Mining and summarizing customer reviews
Hu, M., & Liu, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014073 · Cited by 7,793
Amazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Hidden factors and hidden topics: understanding rating dimensions with review text
McAuley, J., & Leskovec, J. (2013) · Proceedings of the 7th ACM conference on Recommender systems · doi:10.1145/2507157.2507163 · Cited by 1,564
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Explicit factor models for explainable recommendation based on phrase-level sentiment analysis
Zhang, Y., Lai, G., Zhang, M., Zhang, Y., Liu, Y., & Ma, S. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609579 · Cited by 791
Advances in Collaborative Filtering
Koren, Y., & Bell, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_5 · Cited by 745
Beyond the Stars: Improving Rating Predictions using Review Text Content.
Ganu, G., Elhadad, N., & Marian, A. (2009) · International Workshop on the Web and Databases · Cited by 498
WTF: the who to follow service at Twitter
Gupta, P., Goel, A., Lin, J., Sharma, A., Wang, D., & Zadeh, R. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488433 · Cited by 461
Jointly modeling aspects, ratings and sentiments for movie recommendation (JMARS)
Diao, Q., Qiu, M., Wu, C.-Y., Smola, A. J., Jiang, J., & Wang, C. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623758 · Cited by 447
Video suggestion and discovery for youtube: taking random walks through the view graph
Baluja, S., Seth, R., Sivakumar, D., Jing, Y., Yagnik, J., Kumar, S., Ravichandran, D., & Aly, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367618 · Cited by 443
Temporal recommendation on graphs via long- and short-term preference fusion
Xiang, L., Yuan, Q., Zhao, S., Chen, L., Zhang, X., Yang, Q., & Sun, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835896 · Cited by 374
Ratings meet reviews, a combined approach to recommend
Ling, G., Lyu, M. R., & King, I. (2014) · Proceedings of the 8th ACM Conference on Recommender systems · doi:10.1145/2645710.2645728 · Cited by 348
Designing and Evaluating Explanations for Recommender Systems
Tintarev, N., & Masthoff, J. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_15 · Cited by 322
Tagsplanations: explaining recommendations using tags
Vig, J., Sen, S., & Riedl, J. (2009) · Proceedings of the 14th international conference on Intelligent user interfaces · doi:10.1145/1502650.1502661 · Cited by 303
ItemRank: a random-walk based scoring algorithm for recommender engines
Gori, M., & Pucci, A. (2007) · Use Siena air (University of Siena) · Cited by 277
Extracting and Ranking Product Features in Opinion Documents
Zhang, L., Liu, B., Lim, S., & O’Brien-Strain, E. (2010) · Cited by 264
EigenRank: a ranking-oriented approach to collaborative filtering
Liu, N. N., & Yang, Q. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390351 · Cited by 249
Aspect and Entity Extraction for Opinion Mining
Zhang, L., & Liu, B. (2013) · Studies in big data · doi:10.1007/978-3-642-40837-3_1 · Cited by 164
Beyond the stars: exploiting free-text user reviews to improve the accuracy of movie recommendations
Jakob, N., Weber, S. H., Müller, M. C., & Gurevych, I. (2009) · Proceedings of the 1st international CIKM workshop on Topic-sentiment analysis for mass opinion · doi:10.1145/1651461.1651473 · Cited by 158
Your neighbors affect your ratings: on geographical neighborhood influence to rating prediction
Hu, L., Sun, A., & Liu, Y. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609593 · Cited by 141
Predicting the popularity of web 2.0 items based on user comments
He, X., Gao, M. Z., Kan, M., Liu, Y., & Sugiyama, K. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609558 · Cited by 109
Self-citationRandom walk based entity ranking on graph for multidimensional recommendation
Lee, S., Song, S.-I., Kahng, M., Lee, D., & Lee, S. (2011) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2043932.2043952 · Cited by 102
Comment-based multi-view clustering of web 2.0 items
He, X., Kan, M., Xie, P., & Chen, X. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2567975 · Cited by 100
Self-citationZhang, Y., Zhang, H., Zhang, M., Liu, Y., & Ma, S. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609501 · Cited by 94
Sentiment analysis of user comments for one-class collaborative filtering over ted talks
Pappas, N., & Popescu-Belis, A. (2013) · Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2484028.2484116 · Cited by 81
Opinion-Driven Matrix Factorization for Rating Prediction
Pero, Š., & Horváth, T. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38844-6_1 · Cited by 57
A Random Walk Model for Item Recommendation in Social Tagging Systems
Zhang, Z., Zeng, D. D., Abbasi, A., Peng, J., & Zheng, X. (2013) · ACM Transactions on Management Information Systems · doi:10.1145/2490860 · Cited by 48
Xu, Y., Lam, W. P., & Lin, T. (2014) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2661829.2662059 · Cited by 34
Text-Based User-kNN: Measuring User Similarity Based on Text Reviews
Terzi, M., Rowe, M., Ferrario, M. A., & Whittle, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08786-3_17 · Cited by 18
Cited by
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Self-citationA Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., et al. (2023) · ACM Transactions on Recommender Systems · doi:10.1145/3568022 · Cited by 1,082
Self-citationFast Matrix Factorization for Online Recommendation with Implicit Feedback
He, X., Zhang, H., Kan, M.-Y., & Chua, T.-S. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911489 · Cited by 988
Self-citationDeep Matrix Factorization Models for Recommender Systems
Xue, H.-J., Dai, X., Zhang, J., Huang, S., & Chen, J. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/447 · Cited by 926
Neural Attentional Rating Regression with Review-level Explanations
Chen, C., Zhang, M., Liu, Y., & Ma, S. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186070 · Cited by 622
Metadata
- Authors
- He, X., Chen, T., Kan, M.-Y., & Chen, X.
- Venue
- Proceedings of the 24th ACM International on Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2015-10-17
- Pages
- 1661-1670
- OpenAlex
- W2028988057
- Cited by
- 456
- References
- 35
- FWCI
- 19.59
- Type
- conference paper
- 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.