Binary Orthogonal Non-negative Matrix Factorization

10/19/2022
by   S. Fathi Hafshejani, et al.
0

We propose a method for computing binary orthogonal non-negative matrix factorization (BONMF) for clustering and classification. The method is tested on several representative real-world data sets. The numerical results confirm that the method has improved accuracy compared to the related techniques. The proposed method is fast for training and classification and space efficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2021

Approximation Algorithms for Orthogonal Non-negative Matrix Factorization

In the non-negative matrix factorization (NMF) problem, the input is an ...
research
03/23/2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization

This article utilizes the projected gradient method (PG) for a non-negat...
research
11/02/2022

Privacy-preserving Non-negative Matrix Factorization with Outliers

Non-negative matrix factorization is a popular unsupervised machine lear...
research
10/07/2021

On audio enhancement via online non-negative matrix factorization

We propose a method for noise reduction, the task of producing a clean a...
research
04/11/2021

A Non-Negative Matrix Factorization Game

We present a novel game-theoretic formulation of Non-Negative Matrix Fac...
research
02/11/2002

Non-negative sparse coding

Non-negative sparse coding is a method for decomposing multivariate data...
research
01/23/2014

Matrix factorization with Binary Components

Motivated by an application in computational biology, we consider low-ra...

Please sign up or login with your details

Forgot password? Click here to reset