Recognition of User Intentions for Interface Agents with Variable Order Markov Models

  • Marcelo G. Armentano
  • Analía A. Amandi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5535)


A key aspect to study in the field of interface agents is the need to detect as soon as possible the user intentions. User intentions have an important role for an interface agent because they serve as a context to define the way in which the agents can collaborate with users. Intention recognition can be used to infer the user’s intentions based on the observation of the tasks the user performs in a software application. In this work, we propose an approach to model the intentions the user can pursue in an application in a semi-automatic way, based on Variable-Order Markov models. We claim that with appropriate training from the user, an interface agent following our approach will be able both to detect the user intention and the most probable sequence of following tasks the user will perform to achieve his/her intention.


Markov Chain Model User Intention Interface Agent Plan Recognition Intention Recognition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Armentano, 2008]
    Armentano, M.G.: Recognition of User Intentions with Variable-Order Markov Models. Ph.D thesis, Universidad Nacional del Centro de la Provincia de Buenos Aires. Argentina (2008)Google Scholar
  2. [Bauer, 1999]
    Bauer, M.: From interaction data to plan libraries: A clustering approach. In: IJCAI 1999: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 962–967. Morgan Kaufmann Publishers Inc., San Francisco (1999)Google Scholar
  3. [Brown, 1998]
    Brown, S.: A Decision Theoretic Approach for Interface Agent Development. Ph.D thesis, Faculty of the Graduate School of Engineering of the Air Force Institute of Technology Air University (1998)Google Scholar
  4. [Charniak and Goldman, 1993]
    Charniak, E., Goldman, R.P.: A bayesian model of plan recognition. Artificial Intelligence 64(1), 53–79 (1993)CrossRefGoogle Scholar
  5. [Duong et al., 2006]
    Duong, T.V., Phung, D.Q., Bui, H.H., Venkatesh, S.: Human behavior recognition with generic exponential family duration modeling in the hidden semi-markov model. In: International Conference on Pattern Recognition, vol. 3, pp. 202–207 (2006)Google Scholar
  6. [Garland; and Lesh, 2002]
    Garland, A., Lesh, N.: Learning hierarchical task models by demonstration. Technical report, Mitsubishi Electric Research Laboratories (2002)Google Scholar
  7. [Gorniak and Poole, 2000]
    Gorniak, P., Poole, D.: Building a stochastic dynamic model of application. In: Boutilier, C., Goldszmidt, M. (eds.) Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI 2000), Stanford University, Stanford, California, USA, pp. 230–237. Morgan Kaufmann, San Francisco (2000)Google Scholar
  8. [Horvitz et al., 1998]
    Horvitz, E., Breese, J., Heckerman, D., Hovel, D., Rommelse, K.: The Lumière project: Bayesian user modeling for inferring the goals and needs of software users. In: Cooper, G.F., Moral, S. (eds.) Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp. 256–265. Morgan Kaufmann, San Mateo (1998)Google Scholar
  9. [Hunter, 1986]
    Hunter, J.S.: The exponentially weighted moving average. Journal of Quality Technology 18(4), 203–209 (1986)Google Scholar
  10. [Kautz, 1991]
    Kautz, H.: A formal theory of plan recognition and its implementation. In: Allen, J.F., Kautz, H.A., Pelavin, R., Tenenberg, J. (eds.) Reasoning About Plans, pp. 69–125. Morgan Kaufmann Publishers, San Mateo (1991)CrossRefGoogle Scholar
  11. [Lesh et al., 1999]
    Lesh, N., Rich, C., Sidner, A.L.: Using plan recognition in human-computer collaboration. In: International Conference on User Modeling (UM 1999), pp. 23–32. Mitsubishi Electric Research Laboratories (1999)Google Scholar
  12. [Liao et al., 2007]
    Liao, L., Patterson, D.J., Fox, D., Kautz, H.A.: Learning and inferring transportation routines. Artificial Intelligence 171(5-6), 311–331 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  13. [Lieberman, 2001]
    Lieberman, H.: Your Wish Is My Command: Programming by Example. Morgan Kaufmann, San Francisco (2001)Google Scholar
  14. [Maes, 1994]
    Maes, P.: Agents that reduce work and information overload. Communications of the ACM (1994)Google Scholar
  15. [Nguyen et al., 2005]
    Nguyen, N.T., Phung, D.Q., Venkatesh, S., Bui, H.H.: Learning and detecting activities from movement trajectories using the hierarchical hidden markov model. In: IEEE Computer Vision and Pattern Recognition or CVPR, pp. 955–960. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  16. [Ron et al., 1996]
    Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning 25(2-3), 117–149 (1996)CrossRefzbMATHGoogle Scholar
  17. [Whitworth, 2005]
    Whitworth, B.: Polite computing. Behaviour and Information Technology 24(5), 353–363 (2005)CrossRefGoogle Scholar
  18. [Wærn, 1996]
    Wærn, A.: Recognizing Human Plans: Issues for Plan Recognition in Human-Computer Interaction. Ph.D thesis, Royal Institute of Technology (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Marcelo G. Armentano
    • 1
  • Analía A. Amandi
    • 2
  1. 1.ISISTAN Research Institute, Fac. Cs. ExactasUNCPBA Campus UniversitarioTandilArgentina
  2. 2.CONICET, Consejo Nacional de Investigaciones Científicas y TécnicasArgentina

Personalised recommendations