Sciweavers

132 search results - page 5 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
ICA
2007
Springer
15 years 4 months ago
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) ...
Andrzej Cichocki, Rafal Zdunek, Shun-ichi Amari
BIBM
2010
IEEE
158views Bioinformatics» more  BIBM 2010»
14 years 7 months ago
Protein-protein interaction prediction via Collective Matrix Factorization
Abstract--Protein-protein interactions (PPI) play an important role in cellular processes and metabolic processes within a cell. An important task is to determine the existence of ...
Qian Xu, Evan Wei Xiang, Qiang Yang
NIPS
2004
14 years 11 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
15 years 4 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...
ICDT
2009
ACM
129views Database» more  ICDT 2009»
15 years 10 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh