Sciweavers

3 search results - page 1 / 1
» On the pseudo-inverse of the Laplacian of a bipartite graph
Sort
View
APPML
2005
80views more  APPML 2005»
13 years 3 months ago
On the pseudo-inverse of the Laplacian of a bipartite graph
1 We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is2 based on the pseudo-inverse of the normalized Laplacian.3
Ngoc-Diep Ho, Paul Van Dooren
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 5 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
ECAI
2008
Springer
13 years 5 months ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
Jérôme Kunegis, Stephan Schmidt, Sahi...