Sciweavers

80 search results - page 4 / 16
» Spectral clustering based on matrix perturbation theory
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 6 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
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 1 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
12 years 9 months ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...
MVA
2007
159views Computer Vision» more  MVA 2007»
13 years 7 months ago
Action Recognition of Insects Using Spectral Clustering
We propose a technique to recognize actions of grasshoppers based on spectral clustering. We track the object in 3D and construct features using 3D object movement in segments of ...
Maryam Moslemi Naeini, Greg Dutton, Kristina Rothl...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 6 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...