Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Engineering a multi-purpose test collection for web retrieval experiments
Information Processing and Management: an International Journal
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
Distance-function design and fusion for sequence data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Application of kernels to link analysis
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
IEEE Transactions on Knowledge and Data Engineering
The slashdot zoo: mining a social network with negative edges
Proceedings of the 18th international conference on World wide web
Boosting social network connectivity with link revival
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Network growth and the spectral evolution model
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
The link prediction problem in bipartite networks
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
A correlation analysis of web social media
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Kernels for link prediction with latent feature models
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Link prediction: the power of maximal entropy random walk
Proceedings of the 20th ACM international conference on Information and knowledge management
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Generalized framework for personalized recommendations in agent networks
Autonomous Agents and Multi-Agent Systems
Online dating recommender systems: the split-complex number approach
Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web
Match graph construction for large image databases
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Co-occurrence prediction in a large location-based social network
Frontiers of Computer Science: Selected Publications from Chinese Universities
From biological to social networks: Link prediction based on multi-way spectral clustering
Data & Knowledge Engineering
Prediction in a microblog hybrid network using bonacich potential
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectrum. Our approach generalizes several graph kernels and dimensionality reduction methods and provides a method to estimate their parameters efficiently. We show how the parameters of these prediction functions can be learned by reducing the problem to a one-dimensional regression problem whose runtime only depends on the method's reduced rank and that can be inspected visually. We derive variants that apply to undirected, weighted, unweighted, unipartite and bipartite graphs. We evaluate our method experimentally using examples from social networks, collaborative filtering, trust networks, citation networks, authorship graphs and hyperlink networks.