论文信息 - Graph Embeddings for Movie Visualization and Recommendation

Graph Embeddings for Movie Visualization and Recommendation

In this work we showcase how graph-embeddings can be used as a movie visualization and recommendation interface. The proposed low-dimensional embedding carefully preserves both local and global graph connectivity structure. The approach additionally offers: a) recommendations based on a pivot movie, b) interactive deep graph exploration of the movie connectivity graph, c) automatic movie trailer retrieval.

Michail Vlachos | Daniel Svonava

[1] Tao Mei,et al. VideoReach: an online video recommendation system , 2007, SIGIR.

[2] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.

[3] George Kollios,et al. BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4] Bradley N. Miller,et al. MovieLens unplugged: experiences with an occasionally connected recommender system , 2003, IUI '03.

[5] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[6] James Bennett,et al. The Netflix Prize , 2007 .

[7] Yu He,et al. The YouTube video recommendation system , 2010, RecSys '10.

[8] Nikhil Gupta,et al. Shiniphy-Visual Data Mining of movie recommendations , 2009 .

[9] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[10] J. Tenenbaum,et al. A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[11] Michail Vlachos,et al. Visualizing Graphs Using Minimum Spanning Dendrograms , 2010, 2010 IEEE International Conference on Data Mining.

[12] Nan Li,et al. MovieGEN : A Movie Recommendation System , 2008 .