A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation

Proceedings - 2005 IEEE/WIC/ACM InternationalConference on Web Intelligence, WI 2005

Volumn 2005, Issue , 2005, Pages 550-556

  Fouss, Francois ^a   Pirotte, Alain ^a   Saerens, Marco ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; INFORMATION ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; WORLD WIDE WEB;

COLLABORATIVE RECOMMENDATION; MARKOV-CHAIN MODELS; STATISTICAL RELATIONAL LEARNING;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 33748869142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2005.9     Document Type: Conference Paper

References (15)

1. F. Buckley and F. Harary. Distance in graphs. Addison-Wesley Publishing Company, 1990.
2. S. Dzeroski. Multi-relational data mining: an introduction. ACM SIGKDD Explorations Newsletter, 5(1):1-16, 2003.
3. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Markovchain computation of similarities between nodes of a graph, with application to collaborative filtering. Submitted for publication, http://www.isys.ucl.ac.be/ staff/francois/Articles/Saerens2005a.pdf, 2005.
4. F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311-336, 1974.
5. Z. Huang, H. Chen, and D. Zeng. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Transactions on Information Systems, 22(1):116-142, 2004.
6. R. Johnson and D. Wiehern. Applied Multivariate Statistical Analysis, 5th Ed. Prentice Hall, 2002.
7. L. Katz. A new status index derived from sociometric analysis. Psychmetrika, 18(1):39-43, 1953.
8. D. J. Klein and M. Randic. Resistance distance. Journal of Mathematical Chemistry, 12:81-95, 1993.
9. A. Langville and C. D. Meyer. A survey of eigenvector methods for web information retrieval. SIAM Review, 47:135-161, 2005.
10. J. Norris. Markov Chains. Cambridge University Press, 1997.
11. M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. Proceedings of the 15th European Conference on Machine Learning (ECML 2004). Lecture Notes in Artificial Intelligence, Vol. 3201, Springer-Verlag, Berlin, pages 371-383, 2004.
12. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. Proceedings of the Fifth International Conference on Computer and Information Technology, 2002.
13. B. Scholkopf and A. Smola. Learning with kernels. The MIT Press, 2002.
14. S. Siegel and J. Castellan. Nonparametric Statistics for the Behavioral Sciences, 2nd Ed. McGraw-Hill, 1988.
15. S. White and P. Smyth. Algorithms for estimating relative importance in networks. Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 266-275, 2003.