Sciweavers

712 search results - page 99 / 143
» On Spectral Graph Drawing
Sort
View
JMLR
2012
11 years 11 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
ATAL
2008
Springer
13 years 11 months ago
Graph Laplacian based transfer learning in reinforcement learning
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
Yi-Ting Tsao, Ke-Ting Xiao, Von-Wun Soo
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
14 years 3 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
14 years 2 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini