The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Mining navigation history for recommendation
Abstract
Although a user's navigation history contains a lot of hidden information about the relationship between web pages and between users, this information is usually not exploited. The information hidden in the history can be an invaluable source of knowledge in assisting a user to better surf the Web. We presented a system which actively monitors and tracks a user's navigation. Once a user's navigation history is captured, we apply data mining techniques to discover the hidden knowledge contained in the history. The knowledge is then used to suggest potentially interesting web pages to users.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 2×
“Especially in recent years, a number of efficient algorithms such as “a-priori”[1, 2] have been presented for fast discovery of associations in large databases.”
BackgroundMethodA vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521 · cited 1×
“For example, the system could keep a content representation for each of the documents encountered, and compute document similarity using the cosine measure [ 8 ].”
Method
Cited by
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602
Brusilovsky, P. (2001) · User Modeling and User-Adapted Interaction · doi:10.1023/a:1011143116306 · Cited by 2,057
Adaptive web search based on user profile constructed without any effort from users
Sugiyama, K., Hatano, K., & Yoshikawa, M. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988764 · Cited by 645
Personalized e-learning system using Item Response Theory
Chen, C.-M., Lee, H.-M., & Chen, Y.-H. (2005) · Computers & Education · doi:10.1016/j.compedu.2004.01.006 · Cited by 482
Effective personalization based on association rule discovery from web usage data
Mobasher, B., Dai, H., Luo, T., & Nakagawa, M. (2001) · Proceedings of the 3rd international workshop on Web information and data management · doi:10.1145/502932.502935 · Cited by 427
Metadata
- Authors
- Fu, X., Budzik, J., & Hammond, K. J.
- Venue
- Proceedings of the 5th international conference on Intelligent user interfaces
- Publisher
- ACM
- Published
- 2000-01-09
- Pages
- 106-112
- OpenAlex
- W2008889224
- Cited by
- 228
- References
- 2
- FWCI
- 12.61
- 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.