Francois Fouss, Stephane Faulkner, Manuel Kolp, Alain Pirotte, Marco Saerens


This work presents some general procedures for computing dissimilarities between nodes of a weighted, undirected, graph. It is based on a Markov-chain model of random walk through the graph. This method is applied on the architecture of a Multi Agent System (MAS), in which each agent can be considered as a node and each interaction between two agents as a link. The model assigns transition probabilities to the links between agents, so that a random walker can jump from agent to agent. A quantity, called the average first-passage time, computes the average number of steps needed by a random walker for reaching agent k for the first time, when starting from agent i. A closely related quantity, called the average commute time, provides a distance measure between any pair of agents. Yet another quantity of interest, closely related to the average commute time, is the pseudoinverse of the Laplacian matrix of the graph, which represents a similarity measure between the nodes of the graph. These quantities, representing dissimilarities (similarities) between any two agents, have the nice property of decreasing (increasing) when the number of paths connecting two agents increases and when the “length” of any path decreases. The model is applied on a collaborative filtering task where suggestions are made about which movies people should watch based upon what they watched in the past. For the experiments, we build a MAS architecture and we instantiated the agents belief-set from a real movie database. Experimental results show that the Laplacian-pseudoinverse based similarity outperforms all the other methods.


  1. Breese, J., Heckerman, D., and Kadie, C. (1998). Empirical analysis of predictive algorithms for collaborative filtering. Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence.
  2. Dunham, M. (2003). Data Mining: Introductory and Advanced Topics. Prentice Hall.
  3. Gobel, F. and Jagers, A. (1974). Random walks on graphs. Stochastic Processes and their Applications, 2:311- 336.
  4. Johnson, R. and Wichern, D. (2002). Applied Multivariate Statistical Analysis, 5th Ed. Prentice Hall.
  5. Katz, L. (1953). A new status index derived from sociometric analysis. Psychmetrika, 18(1):39-43.
  6. Kemeny, J. G. and Snell, J. L. (1976). Chains. Springer-Verlag.
  7. Klein, D. J. and Randic, M. (1993). Resistance distance. Journal of Mathematical Chemistry, 12:81-95.
  8. Konstan, J., Miller, B., Maltz, D., Herlocker, J., Gordon, L., and Riedl, J. (1997). Grouplens: Applying collaborative filtering to usenet news. Communications of the ACM, 40(3):77-87.
  9. Norris, J. (1997). Markov Chains. Cambridge University Press.
  10. Resnick, P., Neophytos, I., Mitesh, S., Bergstrom, P., and Riedl, J. (1994). Grouplens: An open architecture for collaborative filtering of netnews. Proceedings of the Conference on Computer Supported Cooperative Work, pages 175-186.
  11. Sarwar, B., Karypis, G., Konstan, J., and Riedl, J. (2001). Item-based collaborative filtering recommendation algorithms. Proceedings of the International World Wide Web Conference, pages 285-295.
  12. Sarwar, B., Karypis, G., Konstan, J., and Riedl, J. (2002). Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. Proceedings of the Fifth International Conference on Computer and Information Technology.
  13. Shardanand, U. and Maes, P. (1995). Social information filtering: Algorithms for automating 'word of mouth'. Proceedings of the Conference on Human Factors in Computing Systems, pages 210-217.
  14. Siegel, S. and Castellan, J. (1988). Nonparametric Statistics for the Behavioral Sciences, 2nd Ed. McGraw-Hill.
  15. White, S. and Smyth, P. (2003). Algorithms for estimating relative importance in networks. Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 266- 275.
  16. Wooldridge, M. and Jennings, N. R. (1994). Intelligent agents: Theory and practice. Knowledge Engineering Review paper, 2:115-152.

Paper Citation

in Harvard Style

Fouss F., Faulkner S., Kolp M., Pirotte A. and Saerens M. (2005). WEB RECOMMENDATION SYSTEM BASED ON A MARKOV-CHAIN MODEL . In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 4: ICEIS, ISBN 972-8865-19-8, pages 56-63. DOI: 10.5220/0002550700560063

in Bibtex Style

author={Francois Fouss and Stephane Faulkner and Manuel Kolp and Alain Pirotte and Marco Saerens},
booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 4: ICEIS,},

in EndNote Style

JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 4: ICEIS,
SN - 972-8865-19-8
AU - Fouss F.
AU - Faulkner S.
AU - Kolp M.
AU - Pirotte A.
AU - Saerens M.
PY - 2005
SP - 56
EP - 63
DO - 10.5220/0002550700560063