The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fast online SVD revisions for lightweight recommender systems
Abstract
The singular value decomposition (svd) is fundamental to many data modeling/mining algorithms, but svd algorithms typically have quadratic complexity and require random access to complete data sets. This is problematic in most data mining settings. We detail a family of sequential update rules for adding data to a “thin” svd data model, revising or removing data already incorporated into the model, and adjusting the model when the data-generating process exhibits nonstationarity. We also leverage the svd to estimate the most probable completion of incomplete data. We use these methods to model data streams describing tables of consumer×product ratings, where fragments of rows and columns arrive in random order and individual table entries are arbitrarily added, revised, or retracted at any time. These purely online rules have very low time complexity and require a data stream cache no larger than a single user's ratings. We demonstrate this scheme in an interactive graphical movie recommender that predicts and displays ratings/rankings of thousands of movie titles in real-time as a user adjusts ratings of a small arbitrary set of probe movies. The system “learns” as it is used by revising the svd in response to user ratings. Users can asynchronously join, add ratings, add movies, revise ratings, get recommendations, and delete themselves from the model.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Cited by
Collaborative Filtering Recommender Systems
Ekstrand, M. D. (2011) · Foundations and Trends® in Human–Computer Interaction · doi:10.1561/1100000009 · Cited by 1,037
Fast low-rank modifications of the thin singular value decomposition
Brand, M. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.07.021 · Cited by 491
Self-citationA Scalable Collaborative Filtering Framework Based on Co-Clustering
George, T., & Merugu, S. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.14 · Cited by 407
Fast incremental and personalized PageRank
Bahmani, B., Chowdhury, A., & Goel, A. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1929861.1929864 · Cited by 327
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
Yang, D., Qu, B., Yang, J., & Cudre-Mauroux, P. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313635 · Cited by 299
Metadata
- Authors
- Brand, M.
- Venue
- Proceedings of the 2003 SIAM International Conference on Data Mining
- Published
- 2003-05
- Pages
- 37-46
- OpenAlex
- W2167680278
- Cited by
- 178
- References
- 1
- FWCI
- 4.01
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast online SVD revisions for lightweight recommender systems. https://app.cochat.ai/papers/10.1137/1.9781611972733.4
- The paper
- Brand, M. (2003). Fast online SVD revisions for lightweight recommender systems. Proceedings of the 2003 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972733.4
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.