SUPERVISED NMF AS A SPARSE OPTIMIZATION PROBLEM
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a novel scheme to supervised nonnegative matrix factorization (NMF). We formulate the supervised NMF as a sparse optimization problem assuming the availability of a set of basis vectors, some of which are irrelevant to a given matrix to be decomposed. The number of basis vectors to be actively used is obtained as a consequence of optimization. We present a state-of-the-art convex-analytic iterative solver which ensures global convergence. Simulation results show the efficacy of the proposed scheme in the case of perfect basis matrix.
- 一般社団法人電子情報通信学会の論文
- 2013-03-07
著者
-
Yukawa Masahiro
Dept. Communications And Integrated Systems Tokyo Institute Of Technology
-
MORIKAWA Yu
Dept. Electrical and Electronic Engineering, Niigata University
関連論文
- Blind and Nonblind DS/CDMA Receivers by Adaptive Projected Subgradient Method
- An Efficient Distributed Power Control for Infeasible Downlink Scenarios : Global-Local Fixed-Point-Approximation Technique(Papers Selected from the 20th Symposium on Signal Processing)
- Fast and efficient interference suppression by uniform linear array based on dual-domain adaptive filtering technique (通信方式)
- Fast and efficient interference suppression by uniform linear array based on dual-domain adaptive filtering technique (回路とシステム)
- Fast and efficient interference suppression by uniform linear array based on dual-domain adaptive filtering technique (信号処理)
- Multi-Kernel NLMS Algorithm with Coherence Criterion and Its Application to Online Prediction of Time Series Data
- Multikernel Adaptive Filtering With Double Regularization
- Multikernel Adaptive Filtering With Double Regularization
- SUPERVISED NMF AS A SPARSE OPTIMIZATION PROBLEM
- SUPERVISED NMF AS A SPARSE OPTIMIZATION PROBLEM
- SUPERVISED NMF AS A SPARSE OPTIMIZATION PROBLEM