The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Temporal recommendation on graphs via long- and short-term preference fusion
Abstract
Accurately capturing user preferences over time is a great practical challenge in recommender systems. Simple correlation over time is typically not meaningful, since users change their preferences due to different external events. User behavior can often be determined by individual's long-term and short-term preferences. How to represent users' long-term and short-term preferences? How to leverage them for temporal recommendation? To address these challenges, we propose Session-based Temporal Graph (STG) which simultaneously models users' long-term and short-term preferences over time. Based on the STG model framework, we propose a novel recommendation algorithm Injected Preference Fusion (IPF) and extend the personalized Random Walk for temporal recommendation. Finally, we evaluate the effectiveness of our method using two real datasets on citations and social bookmarking, in which our proposed method IPF gives 15%-34% improvement over the previous state-of-the-art.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1999) · Cited by 12,854
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
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
Learning in the Presence of Concept Drift and Hidden Contexts
Widmer, G., & Kubat, M. (1996) · Machine Learning · doi:10.1023/a:1018046501280 · Cited by 1,857
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Collaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Jamali, M., & Ester, M. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557067 · Cited by 771
Evaluation of Item-Based Top- N Recommendation Algorithms
Karypis, G. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502627 · Cited by 576
GraphScope: parameter-free mining of large time-evolving graphs
Sun, J., Faloutsos, C., Papadimitriou, S., & Yu, P. S. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281266 · Cited by 532
Self-citationBeyond streams and graphs: dynamic tensor analysis
Sun, J., Tao, D., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150445 · Cited by 462
Self-citationTime weight collaborative filtering
Ding, Y., & Li, X. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099689 · Cited by 454
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
Implicit Feedback for Recommender Systems
Oard, D. W., & Kim, J. (1998) · Scholar Commons (University of South Carolina) · Cited by 371
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
Self-citationA graph model for E‐commerce recommender systems
Huang, Z., Chung, W., & Chen, H. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.10372 · Cited by 222
Beyond incremental processing: tracking concept drift
Schlimmer, J. C., & Granger, R. (1986) · National Conference on Artificial Intelligence · Cited by 207
Tag recommendations in social bookmarking systems
Jäschke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., & Stumme, G. (2008) · AI Communications · doi:10.3233/aic-2008-0438 · Cited by 201
Acquiring and Revising Preferences in a Critique-Based Mobile Recommender System
Ricci, F., & Nguyen, Q. N. (2007) · IEEE Intelligent Systems · doi:10.1109/mis.2007.43 · Cited by 175
Research Paper Recommender Systems: A Random-Walk Based Approach
Gori, M., & Pucci, A. (2006) · 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06) · doi:10.1109/wi.2006.149 · Cited by 172
Using Temporal Data for Making RecommendationsPreprint
Zimdars, A. L., Chickering, D. M., & Meek, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2320 · Cited by 116
Grocery shopping recommendations based on basket-sensitive random walk
Li, M., Dias, B., Jarman, I. H., El‐Deredy, W., & Lisboa, P. J. G. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557150 · Cited by 56
The BigChaos Solution to the Netflix Prize 2008
Töscher, A. (2008) · Cited by 27
Expertise Search in a Time-Varying Social Network
Li, Y., & Tang, J. (2008) · Web-Age Information Management · doi:10.1109/waim.2008.100 · Cited by 22
Cited by
Lü, L., Medo, M., Yeung, C. H., Zhang, Y.-C., Zhang, Z.-K., & Zhou, T. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.02.006 · Cited by 995
Shi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
Time-aware point-of-interest recommendation
Yuan, Q., Cong, G., Ma, Z., Sun, A., & Thalmann, N. M. (2013) · Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2484028.2484030 · Cited by 754
Self-citationFrom amateurs to connoisseurs: modeling the evolution of user expertise through online reviews
McAuley, J. J., & Leskovec, J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488466 · Cited by 525
Sequence-Aware Recommender Systems
Quadrana, M., Cremonesi, P., & Jannach, D. (2019) · ACM Computing Surveys · doi:10.1145/3190616 · Cited by 504
Metadata
- Authors
- Xiang, L., Yuan, Q., Zhao, S., Chen, L., Zhang, X., Yang, Q., & Sun, J.
- Venue
- Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2010-07-25
- Pages
- 723-732
- OpenAlex
- W2146456494
- Cited by
- 374
- References
- 24
- FWCI
- 13.49
- 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.