Sciweavers

474 search results - page 7 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
SDM
2007
SIAM
96views Data Mining» more  SDM 2007»
13 years 9 months ago
Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM
This paper presents a unified view of a number of dimension reduction techniques under the common framework of tensors. Specifically, it is established that PCA, and the recentl...
Bernard N. Sheehan, Yousef Saad
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
14 years 8 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
ICASSP
2011
IEEE
12 years 11 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
CVPR
2008
IEEE
14 years 10 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal