 |
Stochastic Models for Web Agents and the Web Environment
Web agents are complex software systems that operate in the world wide web, the Internet, and related corporate, government, or military intranets. They are designed to perform a variety of tasks from caching and routing to searching, categorizing, and filtering. Our goal is to develop a theoretically well-founded framework for the design and analysis of Web agents and agent systems based on mathematical models of their environment. Our approach has three major building blocks:- Stochastic models of the Web graph that take into account the distribution and connectivity of Web pages and provide important general guidelines for agent design by capturing unique properties of the environment in which these agents must operate.
- Statistical learning techniques to enable Web agents to learn about their environment by inferring stochastic models of Web page content and local link structure.
- Algorithms for autonomous planning and decision making in the Web environment to enable agents to pursue goals and adapt to their changing environment.
Project status: Complete
Research Areas
| Design and Analysis of Algorithms |
| Machine Learning |
| Artificial Intelligence |
Research Themes
| Statistical Approaches |
People
| Thomas Dean |
| Eli Upfal |
Publications
Pandurangan, G., Raghavan, P., and Upfal, E. Using PageRank to characterize web structure. Internet Mathematics 2 (2005), 217-236. [ pdf ]
Pandurangan, G., Raghavan, P., and Upfal, E. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communication 21 (2003), 995-1002. [ pdf ]
Young, J., and Dean, T. Exploiting Locality in Searching the Web. In Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (2003), pp. 608-615. [ pdf ]
Pandurangan, G., Raghavan, P., and Upfal, E. Using PageRank to characterize web structure. In Proceedings of the 8th Annual International Conference on Combinatorics and Computing (COCOON) (2002), pp. 330-339. [ pdf ]
Pandurangan, G., Raghavan, P., and Upfal, E. Building low-diameter P2P networks. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (2001), pp. 492-499. [ pdf ]
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. S., and Upfal, E. Stochastic models for the web graph. In Proceedings of the 41th IEEE Symposium on Foundations of Computer Science (2000), pp. 57-65. [ pdf ]
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. S., and Upfal, E. The web as a graph. In Proceedings of the 19th ACM Symposium on Principles of Database Systems (2000), pp. 1-10. [ pdf ]
| Page Owner: Webmaster | Last Modified: Mon Oct 23 14:57:09 2006 |