Abstract
Rights: UNKNOWN · Source: journal-auto-sync:external:CROSSREF_ISSN
Madeleine Udell, Corinne Horn, Reza Zadeh
Abstract
Rights: UNKNOWN · Source: journal-auto-sync:external:CROSSREF_ISSN
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
A new approach to collaborative filtering: Operator estimation with spectral regularization
2009
Learning sparsely used overcomplete dictionaries via alternating minimization
2013
Unresolved referenced work
2004
k-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
10.1109/tsp.2006.881199 · 2006
k-means++: The advantages of careful seeding
2007
Neural networks and principal component analysis: Learning from examples without local minima
10.1016/0893-6080(89)90014-2 · 1989
Algorithms and applications for approximate nonnegative matrix factorization
10.1016/j.csda.2006.11.006 · 2007
Incremental gradient, subgradient, and proximal methods for convex optimization: A survey
2011
Julia: A fast dynamic language for technical computing
2012
Factoring nonnegative matrices with linear programs
2012
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
2013
Unresolved referenced work
2010
Smallk is a C++/Python high-performance software library for nonnegative matrix factorization (NMF) and hierarchical and flat clustering using the NMF ; current version 1.2.0
2014
Accuracy at the top
2012
Unresolved referenced work
2003
Distributed optimization and statistical learning via the alternating direction method of multipliers
10.1561/2200000016 · 2011
10.1017/cbo9780511804441
10.1017/cbo9780511804441 · 2004
Unresolved referenced work
2003
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
10.1007/s10107-002-0352-8 · 2003
Local minima and convergence in low-rank semidefinite programming
10.1007/s10107-004-0564-1 · 2005
Robust principal component analysis?
10.1145/1970392.1970395 · 2011
Matrix completion with noise
2009
Exact matrix completion via convex optimization
2008
The power of convex relaxation: Near-optimal matrix completion
10.1109/tit.2010.2044061 · 2010
The scree test for the number of factors
10.1207/s15327906mbr0102_10 · 1966
Matrix estimation by universal singular value thresholding
2014
Parallel prefix polymorphism permits parallelization, presentation & proof
10.1109/hptcdl.2014.9 · 2014
Atomic decomposition by basis pursuit
10.1137/s1064827596304010 · 1998
A generalization of principal component analysis to the exponential family
2001
On the algorithmic implementation of multiclass kernel-based vector machines
2002
Random projections for non-negative matrix factorization
2014
Quadratic programing solver for non-negative matrix factorization with spark
2014
A direct formulation for sparse PCA using semidefinite programming
2004
1-bit matrix completion
2012
The Gifi system of nonlinear multivariate analysis
1984
Gift methods for optimal scaling in R: The package homals
2009
Additive structure in qualitative data: An alternating least squares method with optimal scaling features
10.1007/bf02296971 · 1976
Global convergence of stochastic gradient descent for some nonconvex matrix problems
2014
CVXPY: A Python-embedded modeling language for convex optimization, version 0.2
2014
Solving multiclass learning problems via error-correcting output codes
10.1613/jair.105 · 1995
Comparison of five rules for determining the number of compo
10.1037/0033-2909.99.3.432 · doi-reference
Sparse principal component analysis
10.1198/106186006x113430 · doi-reference
Regression with qualitative and quantitative variables: An alternating least squares method with optimal scaling features
10.1007/bf02296972 · doi-reference
Robust PCA via outlier pursuit
10.1109/tit.2011.2173156 · doi-reference
Large scale image annotation: Learning to rank with joint word-image embeddings
10.1007/s10994-010-5198-3 · doi-reference
Monaural sound source separation by nonnegative matrix factorization with temporal continuity and sparseness criteria
10.1109/tasl.2006.885253 · doi-reference
A tutorial on subspace clustering
10.1109/msp.2010.939739 · doi-reference
On the complexity of nonnegative matrix factorization
10.1137/070709967 · doi-reference
10.1145/1553374.1553509
10.1145/1553374.1553509 · doi-reference
Nearest q-flat to m points
10.1023/a:1004678431677 · doi-reference
Signal recovery from random measurements via orthogonal matching pursuit
10.1109/tit.2007.909108 · doi-reference
Probabilistic principal component analysis
10.1111/1467-9868.00196 · doi-reference
Nonmetric individual differences multidimensional scaling: an alternating least squares method with optimal scaling features
10.1007/bf02293745 · doi-reference
10.1109/focs.2015.25
10.1109/focs.2015.25 · doi-reference
Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence
10.1109/icassp.2014.6854796 · doi-reference
10.1007/978-3-540-74958-5_33
10.1007/978-3-540-74958-5_33 · doi-reference
10.1145/2507157.2507210
10.1145/2507157.2507210 · doi-reference
A geometric analysis of subspace clustering with outliers
10.1214/12-aos1034 · doi-reference
10.1007/978-3-540-87481-2_24
10.1007/978-3-540-87481-2_24 · doi-reference
Sparse principal component analysis via regularized low rank matrix approximation
10.1016/j.jmva.2007.06.007 · doi-reference
Document clustering using nonnegative matrix factorization
10.1016/j.ipm.2004.11.005 · doi-reference
10.1145/1102351.1102441
10.1145/1102351.1102441 · doi-reference
Parallel stochastic gradient algorithms for large-scale matrix completion
10.1007/s12532-013-0053-8 · doi-reference
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
10.1137/070697835 · doi-reference
10.1145/1273496.1273592
10.1145/1273496.1273592 · doi-reference
Repairing Tom Swift’s electric factor analysis machine
10.1207/s15328031us0201_02 · doi-reference
Glove: Global vectors for word representation
10.3115/v1/d14-1162 · doi-reference
On lines and planes of closest fit to systems of points in space
10.1080/14786440109462720 · doi-reference
A simple and fast algorithm for k-medoids clustering
10.1016/j.eswa.2008.01.039 · doi-reference
Sparse coding with an overcomplete basis set: A strategy employed by V1?
10.1016/s0042-6989(97)00169-7 · doi-reference
10.1109/acc.2010.5531594
10.1109/acc.2010.5531594 · doi-reference
10.1145/1553374.1553463
10.1145/1553374.1553463 · doi-reference
Least squares quantization in PCM
10.1109/tit.1982.1056489 · doi-reference
Interior-point method for nuclear norm approximation with application to system identification
10.1137/090755436 · doi-reference
Projected gradient methods for nonnegative matrix factorization
10.1162/neco.2007.19.10.2756 · doi-reference
Multicategory support vector machines: Theory and application to the classification of microarray data and satellite radiance data
10.1198/016214504000000098 · doi-reference
Learning the parts of objects by non-negative matrix factorization
10.1038/44565 · doi-reference
Branch-and-bound methods: A survey
10.1287/opre.14.4.699 · doi-reference
Regression quantiles
10.2307/1913643 · doi-reference
10.1017/cbo9780511754098
10.1017/cbo9780511754098 · doi-reference