CoChat

Clustering With Orthogonal AutoEncoder

Open access
Wang, Wei, Yang, Dan, Chen, Feiyu, Pang, Yunsheng, Huang, Sheng, Ge, Yongxin · 2019 · IEEE Access
Cited by 49

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Recently, clustering algorithms based on deep AutoEncoder attract lots of attention due to their excellent clustering performance. On the other hand, the success of PCA-Kmeans and spectral clustering corroborates that the orthogonality of embedding is beneficial to increase the clustering accuracy. In this paper, we propose a novel dimensional reduction model, called Orthogonal AutoEncoder (OAE), which encourages the orthogonality of the learned embedding. Furthermore, we propose a joint deep Clustering framework based on Orthogonal AutoEncoder (COAE), and this new framework is capable of extracting the latent embedding and predicting the clustering assignment simultaneously. The COAE stacks a fully connected clustering layer on top of the OAE, where the activation function of the clustering layer is the multinomial logistic regression function. The loss function of the COAE contains two terms: the reconstruction loss and the clustering-oriented loss. The first one is a data-dependent term in order to prevent overfitting. The other one is the cross entropy between the predicted assignment and the auxiliary target distribution. The network parameters of the COAE can be effectively updated by the mini-batch stochastic gradient descent algorithm and the back-propagation approach. The experiments on benchmark datasets empirically demonstrate that the COAE can achieve superior or competitive clustering performance as state-of-the-art deep clustering frameworks. The implementation of our algorithm is available at https://github.com/WangDavey/COAE.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2019.2916030

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 49

Metadata

Authors
Wang, W., Yang, D., Chen, F., Pang, Y., Huang, S., & Ge, Y.
Venue
IEEE Access
Published
2019
Volume
7
Pages
62421-62432
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2944603198
Cited by
49
References
8
FWCI
2.53
Type
journal article
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Clustering With Orthogonal AutoEncoder. https://app.cochat.ai/papers/10.1109/access.2019.2916030
The paper
Wang, W., Yang, D., Chen, F., Pang, Y., Huang, S., & Ge, Y. (2019). Clustering With Orthogonal AutoEncoder. IEEE Access. https://doi.org/10.1109/access.2019.2916030

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.