Javascript must be enabled to continue!
Denoising Auto-Encoder-Enhanced Deep Non-Negative Matrix Factorization Clustering Model
View through CrossRef
Non-negative matrix factorization directly decomposes data features into a base matrix and community matrix, which are easily affected by noise. Multi-view datasets have multiple feature matrices, each with a different angle. The data features need to be re-synthesized rather than simply concatenated or added. Based on the advantages and disadvantages of multi-view clustering and non-negative matrix factorization, we attempt to transplant the method of analyzing abstract connected graphs, analogize the similarity between edges and samples in the graph, and propose a deep non-negative matrix factorization model for clustering by constructing a similarity matrix and decomposing it. At the same time, in order to reduce the interference of noise, we introduce a denoising auto-encoder and non-negative matrix factorization in series, and research the reconstruction features, ultimately forming a model structure framework of “denoising auto-encoder, non-negative matrix factorization, clustering”. Through experiments, the denoising auto-encoder-enhanced non-negative matrix factorization achieved good results on five datasets. It achieved an accuracy of 87 percenton the BBC Sport dataset and 61 percent on Wiki-fea, which increased by two percentage points. The clustering results demonstrate that the model can effectively alleviate the impact of noise and provide new ideas for how to integrate multi-view features.
Title: Denoising Auto-Encoder-Enhanced Deep Non-Negative Matrix Factorization Clustering Model
Description:
Non-negative matrix factorization directly decomposes data features into a base matrix and community matrix, which are easily affected by noise.
Multi-view datasets have multiple feature matrices, each with a different angle.
The data features need to be re-synthesized rather than simply concatenated or added.
Based on the advantages and disadvantages of multi-view clustering and non-negative matrix factorization, we attempt to transplant the method of analyzing abstract connected graphs, analogize the similarity between edges and samples in the graph, and propose a deep non-negative matrix factorization model for clustering by constructing a similarity matrix and decomposing it.
At the same time, in order to reduce the interference of noise, we introduce a denoising auto-encoder and non-negative matrix factorization in series, and research the reconstruction features, ultimately forming a model structure framework of “denoising auto-encoder, non-negative matrix factorization, clustering”.
Through experiments, the denoising auto-encoder-enhanced non-negative matrix factorization achieved good results on five datasets.
It achieved an accuracy of 87 percenton the BBC Sport dataset and 61 percent on Wiki-fea, which increased by two percentage points.
The clustering results demonstrate that the model can effectively alleviate the impact of noise and provide new ideas for how to integrate multi-view features.
Related Results
Predictors of False-Negative Axillary FNA Among Breast Cancer Patients: A Cross-Sectional Study
Predictors of False-Negative Axillary FNA Among Breast Cancer Patients: A Cross-Sectional Study
Abstract
Introduction
Fine-needle aspiration (FNA) is commonly used to investigate lymphadenopathy of suspected metastatic origin. The current study aims to find the association be...
Factorization structures, cones, and polytopes
Factorization structures, cones, and polytopes
Abstract
Factorization structures occur in toric differential and discrete geometry and can be viewed in multiple ways, e.g., as objects determining substantial classes of expli...
Enhancing bone scan image quality: an improved self-supervised denoising approach
Enhancing bone scan image quality: an improved self-supervised denoising approach
Abstract
Objective. Bone scans play an important role in skeletal lesion assessment, but gamma cameras exhibit challenges with low sensitivity and...
Methods for image denoising using convolutional neural network: a review
Methods for image denoising using convolutional neural network: a review
AbstractImage denoising faces significant challenges, arising from the sources of noise. Specifically, Gaussian, impulse, salt, pepper, and speckle noise are complicated sources of...
Uncertainty in denoising of MRSI using low-rank methods
Uncertainty in denoising of MRSI using low-rank methods
Abstract
Purpose
Low-rank denoising of MRSI data results in an apparent increase in spectral SNR. However, it is not clear if t...
Memristor-Based Priority Encoder and Decoder Circuit
Memristor-Based Priority Encoder and Decoder Circuit
Introduction:
Memristors, recognized as the fourth fundamental circuit element, exhibit unique features
such as non-volatility, scalability, and energy efficien...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Combining denoising of RNA-seq data and flux balance analysis for cluster analysis of single cells
Combining denoising of RNA-seq data and flux balance analysis for cluster analysis of single cells
Abstract
Background
Sophisticated methods to properly pre-process and analyze the increasing collection of single-cell RNA sequencing (scRNA-seq) da...

