The DOI matches its Crossref record; 125 of the 125 references it cites were found in a registry or an index.
Data Mining for Web Personalization
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
Hanley, J. A., & McNeil, B. J. (1982) · Radiology · doi:10.1148/radiology.143.1.7063747 · Cited by 21,856
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
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
Cited by
Collaborative Filtering Recommender Systems
Schafer, J. B., Frankowski, D., Herlocker, J., & Sen, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_9 · Cited by 2,120
User Models for Adaptive Hypermedia and Adaptive Educational Systems
Brusilovsky, P., & Millán, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_1 · Cited by 988
User Profiles for Personalized Information Access
Gauch, S., Speretta, M., Chandramouli, A., & Micarelli, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_2 · Cited by 509
Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness
Mobasher, B., Burke, R., Bhaumik, R., & Williams, C. (2007) · ACM Transactions on Internet Technology · doi:10.1145/1278366.1278372 · Cited by 458
Self-citationLayered 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
Metadata
- Authors
- Mobasher, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-05-14
- Pages
- 90-135
- OpenAlex
- W2134834365
- Cited by
- 318
- References
- 125
- FWCI
- 13.57
- 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: Data Mining for Web Personalization. https://app.cochat.ai/papers/10.1007/978-3-540-72079-9_3
- The paper
- Mobasher, B. (2007). Data Mining for Web Personalization. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-72079-9_3
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.