Relational Markov models and their application to adaptive web navigation

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 143-152

  Anderson, Corin R ^a   Domingos, Pedro ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

Markov models; Personalization; Relational probabilistic models; Shrinkage; Web mining

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS; ELECTRONIC COMMERCE; MATHEMATICAL MODELS; ONLINE SEARCHING; PROBABILITY; WEBSITES;

ADAPTIVE WEB NAVIGATION; RELATIONAL MARKOV MODELS; WEB MINING;

MARKOV PROCESSES;

EID: 0242456818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775047.775068     Document Type: Conference Paper

References (30)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 207-216, 1993.
2. C. R. Anderson, P. Domingos and D. S. Weld. Adaptive web navigation for wireless devices. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001.
3. C. R. Anderson, P. Domingos, and D. S. Weld. Personalizing web sites for mobile users. In Proceedings of the Tenth International World Wide Web Conference, 2001.
4. I. V. Cadez, D. Heckerman, C. Meek, P. Smyth, and S. White. Visualization of navigation patterns on a web site using model based clustering. In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining, 2000.
5. M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery. Learning to construct knowledge bases from the World Wide Web. Artificial Intelligence Journal, 118(1-2):69-113, 2000.
6. T. Dean and K. Kanazawa. Probabilistic Temporal Reasoning. In Proceedings of the Seventh National Conference on Artificial Intelligence, 1988.
7. T. Dean, and K. Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5:142-150, 1989.
8. T. G. Dietterich. State abstraction in MAXQ hierarchical reinforcement learning. In S. A. Solla, T. K. Leen, and K.-R. Muller, editors, Advances in Neural Information Processing Systems 12, pages 994-1000. MIT Press, Cambridge, MA, 2000.
9. S. Dzeroski and L. de Raedt. Relational reinforcement learning. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 136-143, Madison, WI, 1998. Morgan Kaufmann.
10. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1300-1307, Stockholm, Sweden, 1999. Morgan Kaufmann.
11. X. Fu, J. Budzik, and K. J. Hammond. Mining navigation history for recommendation. In Proceedings of the 2000 Conference on Intelligent User Interfaces, 2000.
12. L. Getoor, D. Koller, and N. Friedman. From instances to classes in probabilistic relational models. In Proceedings of the ICML-2000 Workshop on Attribute-Value and Relational Learning, Stanford, CA, 2000.
13. Z. Ghahramani and M. Jordan. Factorial hidden Markov models. Machine Learning, 29:245-273, 1997.
14. I. J. Good. The Estimation of Probabilities: An Essay on Modern Bayesian Methods. MIT Press, Cambridge, MA, 1965.
15. T. Joachims, D. Freitag, and T. Mitchell. WebWatcher: A tour guide for the World Wide Web. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997.
16. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98, 2000. http://www.ecn.purdue.edu/KDDCUP.
17. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling data. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 282-289, Williamstown, MA, 2001. Morgan Kaufmann.
18. H. Lieberman. Letizia: An agent that assists web browsing. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995.
19. A. McCallum, R. Rosenfeld, T. Mitchel, and A. Y. Ng. Improving text classification by shrinkage in a hierarchy of classes. In Proceedings of the Fifteenth International Conference on Machine Learning, 1998.
20. S. Muggleton. Stochastic logic programs. In L. de Raedt, editor, Advances in Inductive Logic Programming, pages 254-264. IOS Press, Amsterdam, The Netherlands, 1996.
21. L. Ngo and P. Haddawy. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171:147-177, 1997.
22. M. Pazzani, J. Muramatsu, and D. Billsus. Syskill & Webert: Identifying interesting Web sites. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1996.
23. M. J. Pazzani and D. Billsus. Adaptive web site agents. In Proceedings of the Third International Conference on Autonomous Agents, 1999.
24. M. Perkowitz and O. Etzioni. Adaptive web sites: an AI challenge. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997.
25. M. Perkowitz and O. Etzioni. Towards adaptive web sites: Conceptual framework and case study. Artificial Intelligence Journal, 118(1-2), 2000.
26. F. Provost and P. Domingos. Tree induction for probability-based ranking. Machine Learning. To appear.
27. L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77:257-286, 1989.
28. R. R. Sarukkai. Link prediction and path analysis using Markov chains. In Proceedings of the Ninth International World Wide Web Conference, 2000.
29. P. Smyth. Clustering sequences with hidden Markov models. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing 9, 1996.
30. P. Smyth, D. Heckerman, and M. I. Jordan. Probabilistic independence networks for hidden Markov probability models. Neural Computation, 9:227-269, 1997.