Sciweavers

115 search results - page 10 / 23
» Fast approximate spectral clustering
Sort
View
MOC
2002
135views more  MOC 2002»
13 years 7 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
CVPR
2005
IEEE
14 years 9 months ago
Beyond Pairwise Clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...
CVPR
2006
IEEE
14 years 9 months ago
Recursive estimation of generative models of video
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
Nemanja Petrovic, Aleksandar Ivanovic, Nebojsa Joj...
27
Voted
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 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
CVPR
2005
IEEE
14 years 9 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok