Sciweavers

171 search results - page 11 / 35
» Convex Sparse Matrix Factorizations
Sort
View
ICONIP
2007
14 years 11 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...
IPPS
2000
IEEE
15 years 2 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
BMCBI
2007
143views more  BMCBI 2007»
14 years 9 months ago
Factor analysis for gene regulatory networks and transcription factor activity profiles
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...
Iosifina Pournara, Lorenz Wernisch
TIT
2010
130views Education» more  TIT 2010»
14 years 4 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
99
Voted
SIGIR
2012
ACM
13 years 4 days ago
Inferring missing relevance judgments from crowd workers via probabilistic matrix factorization
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
Hyun Joon Jung, Matthew Lease