Sciweavers

474 search results - page 10 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 9 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
MICCAI
2008
Springer
14 years 9 months ago
Joint Segmentation of Thalamic Nuclei from a Population of Diffusion Tensor MR Images
Abstract. Several recent studies explored the use of unsupervised segmentation methods for segmenting thalamic nuclei from diffusion tensor images. These methods provide a plausibl...
Ulas Ziyan, Carl-Fredrik Westin
TITB
2010
148views Education» more  TITB 2010»
13 years 2 months ago
Coclustering for cross-subject fiber tract analysis through diffusion tensor imaging
Abstract--One of the fundamental goals of computational neuroscience is the study of anatomical features that reflect the functional organization of the brain. The study of physica...
Cui Lin, Darshan Pai, Shiyong Lu, Otto Muzik, Jing...
ICONIP
2007
13 years 9 months ago
Sparse Super Symmetric Tensor Factorization
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...
Andrzej Cichocki, Marko Jankovic, Rafal Zdunek, Sh...