The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Matrix computations (3rd ed.)
Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
A personal news agent that talks, learns and explains
Proceedings of the third annual conference on Autonomous Agents
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Recommender systems in e-commerce
Proceedings of the 1st ACM conference on Electronic commerce
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
MovieLens unplugged: experiences with an occasionally connected recommender system
Proceedings of the 8th international conference on Intelligent user interfaces
Amazon.com Recommendations: Item-to-Item Collaborative Filtering
IEEE Internet Computing
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Unsupervised Learning: Self-aggregation in Scaled Principal Component Space
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Item-based top-N recommendation algorithms
ACM Transactions on Information Systems (TOIS)
An automatic weighting scheme for collaborative filtering
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Semi-supervised learning using randomized mincuts
ICML '04 Proceedings of the twenty-first international conference on Machine learning
IEEE Transactions on Knowledge and Data Engineering
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Distortion-Free Nonlinear Dimensionality Reduction
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Music recommendation based on acoustic features and user access patterns
IEEE Transactions on Audio, Speech, and Language Processing
Directed graph learning via high-order co-linkage analysis
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Image categorization using directed graphs
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
An enhanced semi-supervised recommendation model based on green's function
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
iDVS: an interactive multi-document visual summarization system
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Gaussian process for recommender systems
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Analyzing and predicting question quality in community question answering services
Proceedings of the 21st international conference companion on World Wide Web
Function-Function correlated multi-label protein function prediction over interaction networks
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Product recommendation with temporal dynamics
Expert Systems with Applications: An International Journal
MEET: a generalized framework for reciprocal recommender systems
Proceedings of the 21st ACM international conference on Information and knowledge management
Maximum consistency preferential random walks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Adaptive loss minimization for semi-supervised elastic embedding
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
International Journal of Business Information Systems
| Hi-index | 0.00 |
Green's function for the Laplace operator represents the propagation of influence of point sources and is the foundation for solving many physics problems. On a graph of pairwise similarities, the Green's function is the inverse of the combinatorial Laplacian; we resolve the zero-mode difficulty by showing its physical origin as the consequence of the Von Neumann boundary condition. We propose to use Green's function to propagate label information for both semi-supervised and unsupervised learning. We also derive this learning framework from the kernel regularization using Reproducing Kernel Hilbert Space theory at strong regularization limit. Green's function provides a well-defined distance metric on a generic weighted graph, either as the effective distance on the network of electric resistors, or the average commute time in random walks. We show that for unsupervised learning this approach is identical to Ratio Cut and Normalized Cut spectral clustering algorithms. Experiments on newsgroups and six UCI datasets illustrate the effectiveness of this approach. Finally, we propose a novel item-based recommender system using Green's function and show its effectiveness.