Sciweavers

561 search results - page 63 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ICDM
2010
IEEE
166views Data Mining» more  ICDM 2010»
13 years 5 months ago
Exponential Family Tensor Factorization for Missing-Values Prediction and Anomaly Detection
In this paper, we study probabilistic modeling of heterogeneously attributed multi-dimensional arrays. The model can manage the heterogeneity by employing an individual exponential...
Kohei Hayashi, Takashi Takenouchi, Tomohiro Shibat...
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 7 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
ACCV
2006
Springer
14 years 1 months ago
Occlusion Invariant Face Recognition Using Selective LNMF Basis Images
In this paper, we propose a novel occlusion invariant face recognition algorithm based on Selective Local Nonnegative Matrix Factorization (S-LNMF) technique. The proposed algorith...
Hyun Jun Oh, Kyoung Mu Lee, Sang Uk Lee, Chung-Hyu...
JMLR
2012
11 years 10 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...