Selective Markov Models for Predicting Web-Page Accesses
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
The problem of predicting a user's behavior on a web-site has gained importance due to the rapid growth of the world-wide-web and the need to personalize and influence a user's browsing experience. Markov models and their variations have been found well suited for addressing this problem. Of the different variations or Markov models it is generally found that higher-order Markov models display high predictive accuracies. However higher order models are also extremely complicated due to their large number of states that increases their space and runtime requirements. In this paper we present different techniques for intelligently selecting parts of different order Markov models so that the resulting model has a reduced state complexity and improved prediction accuracy. We have tested our models on various datasets and have found that their performance is consistently superior to that obtained by higher-order Markov models.
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
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
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Random variables and stochastic processes
Larson, H. J., & Shubert, B. O. (1979) · Wiley eBooks · Cited by 4,640
A re-examination of text categorization methods
Yang, Y., & Liu, X. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312647 · Cited by 2,652
Web usage mining: discovery and applications of usage patterns from Web data
Srivastava, J., Cooley, R., Deshpande, M., & Tan, P.-N. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846188 · Cited by 2,105
Self-citationApplied Statistics and Probability for Engineers
Alexander, M. T. (1995) · Technometrics · doi:10.1080/00401706.1995.10484379 · Cited by 1,042
Microbial gene identification using interpolated Markov models
Salzberg, S. L., Delcher, A. L., Kasif, S., & White, O. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.2.544 · Cited by 996
Using predictive prefetching to improve World Wide Web latency
Padmanabhan, V. N., & Mogul, J. C. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235164 · Cited by 628
Link prediction and path analysis using Markov chains
Sarukkai, R. R. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00044-x · Cited by 511
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 447
Silk from a sow's ear: extracting usable structures from the Web
Pirolli, P., Pitkow, J., & Rao, R. (1996) · Proceedings of the SIGCHI conference on Human factors in computing systems common ground - CHI '96 · doi:10.1145/238386.238450 · Cited by 378
KDD-Cup 2000 organizers' report: peeling the onion
Kohavi, R., Brodley, C. E., Frasca, B., Mason, L., & Zheng, Z. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381033 · Cited by 256
Chi, E. H., Pirolli, P., & Pitkow, J. (2000) · Proceedings of the SIGCHI conference on Human Factors in Computing Systems · doi:10.1145/332040.332423 · Cited by 181
Variable n-grams and extensions for conversational speech language modeling
Siu, M.-H., & Mari Ostendorf, E. (2000) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.817454 · Cited by 100
(2000) · Cited by 89
Cited by
Recurrent Recommender Networks
Wu, C.-Y., Ahmed, A., Beutel, A., Smola, A. J., & Jing, H. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018689 · Cited by 713
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
Recommender Systems in Technology Enhanced Learning
Manouselis, N., Drachsler, H., Vuorikari, R., Hummel, H., & Koper, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_12 · Cited by 367
Data Mining for Web Personalization
Mobasher, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_3 · Cited by 318
Representing higher-order dependencies in networks
Xu, J., Wickramarathne, T. L., & Chawla, N. V. (2016) · Science Advances · doi:10.1126/sciadv.1600028 · Cited by 208
Metadata
- Authors
- Deshpande, M., & Karypis, G.
- Venue
- Proceedings of the 2001 SIAM International Conference on Data Mining
- Published
- 2001-04-05
- Volume
- 4
- Issue
- 2
- Pages
- 1-15
- OpenAlex
- W1605694005
- Cited by
- 459
- References
- 18
- FWCI
- 10.01
- Type
- conference paper
- Language
- en
- Open access
- green
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.