Sciweavers

Share
13 search results - page 1 / 3
» Local Clustering of Large Graphs by Approximate Fiedler Vect...
Sort
View
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
9 years 3 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
CORR
2008
Springer
143views Education» more  CORR 2008»
8 years 10 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
AAAI
2015
3 years 6 months ago
Large-Scale Multi-View Spectral Clustering via Bipartite Graph
In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or ...
Yeqing Li, Feiping Nie, Heng Huang, Junzhou Huang
FOCS
2006
IEEE
9 years 4 months ago
Local Graph Partitioning using PageRank Vectors
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
9 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
books