Sciweavers

474 search results - page 54 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
ICML
2008
IEEE
14 years 8 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ECCV
2002
Springer
14 years 9 months ago
On Affine Invariant Clustering and Automatic Cast Listing in Movies
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Andrew W. Fitzgibbon, Andrew Zisserman
ICASSP
2009
IEEE
14 years 2 months ago
Exploring functional connectivity in fMRI via clustering
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
Archana Venkataraman, Koene R. A. Van Dijk, Randy ...
KAIS
2006
126views more  KAIS 2006»
13 years 8 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal