Sciweavers

75 search results - page 11 / 15
» Independent component analysis by entropy bound minimization
Sort
View
TNN
2008
128views more  TNN 2008»
14 years 9 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
ICA
2007
Springer
15 years 3 months ago
Pivot Selection Strategies in Jacobi Joint Block-Diagonalization
A common problem in independent component analysis after prewhitening is to optimize some contrast on the orthogonal or unitary group. A popular approach is to optimize the contras...
Cédric Févotte, Fabian J. Theis
DIS
2007
Springer
15 years 3 months ago
A Hilbert Space Embedding for Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...
122
Voted
IPCO
2001
184views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
TALG
2010
158views more  TALG 2010»
14 years 4 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...