In this paper we propose a Deep Autoencoder MIxture Clustering (DAMIC) algorithm based on a mixture of deep autoencoders where each cluster is represented by an autoencoder. A clustering network transforms the data into another space and then selects one of the clusters. Next, the autoencoder associated with this clust…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,786 papers · 148 categories
Trend · papers per month
48 results for “Autoencoder Clustering”
Paper uses autoencoders for time series clustering with energy data.
problem Challenges in time series clustering, especially with outliers.
method Combines convolutional autoencoder and k-medoids for clustering.
result Improves clustering robustness to outliers and finer clusters.
A new deep clustering model learns both clustering and embedding simultaneously.
problem Optimizing autoencoders for clustering and embedding separately.
method Integrating clustering module into a deep autoencoder.
result Joint learning of clustering and embedding improves performance.
Deep clustering has increasingly been demonstrating superiority over conventional shallow clustering algorithms. Deep clustering algorithms usually combine representation learning with deep neural networks to achieve this performance, typically optimizing a clustering and non-clustering loss. In such cases, an autoenco…
Unsupervised clustering is one of the most fundamental challenges in machine learning. A popular hypothesis is that data are generated from a union of low-dimensional nonlinear manifolds; thus an approach to clustering is identifying and separating these manifolds. In this paper, we present a novel approach to solve th…
ADEC addresses feature randomness and drift in autoencoder-based clustering.
problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.
Recently, a number of works have studied clustering strategies that combine classical clustering algorithms and deep learning methods. These approaches follow either a sequential way, where a deep representation is learned using a deep autoencoder before obtaining clusters with k-means, or a simultaneous way, where dee…
Proposes SDCN to integrate structural information into deep clustering.
problem Lack of attention to structural information in representation learning for clustering.
method Designs a delivery operator to transfer autoencoder representations to GCN layers and uses a dual self-supervised mechanism.
result SDCN consistently outperforms state-of-the-art techniques in clustering tasks.
VLAC clusters data hierarchically, outperforming GMM.
problem Clustering with multiple attributes or hierarchies.
method Disentangled latent representations for hierarchical clustering.
result VLAC outperforms Gaussian Mixture Models in clustering accuracy.
MFCVAE clusters data over multiple facets, improving disentanglement and generation.
problem Clustering high-dimensional data like images over multiple characteristics.
method Variational autoencoder with hierarchical latent variables and Mixture-of-Gaussians priors.
result MFCVAE learns and clusters over multiple aspects of data in a disentangled manner.
DEMVC improves multi-view clustering with collaborative training and deep autoencoders.
problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.
Study identifies mental stress in firefighters using heart rate variability data.
problem Unsupervised identification of mental stress in firefighters from heart rate variability data.
method Exploration and comparison of three unsupervised methods: K-Means, convolutional autoencoders, and LSTM autoencoders.
result Convolutional and LSTM autoencoders successfully stratify stressed versus normal samples using HRV markers.
Improves clustering performance by mixing latent representations.
problem Finding well-defined clusters in data representations.
method Mixing Consistent Deep Clustering method that encourages realistic interpolations and semantic consistency.
result Improved clustering performance across various models and datasets.
ISVAE enhances interpretability in time series clustering using a novel filter bank.
problem Improving interpretability in time series clustering models.
method Integrates a Filter Bank (FB) into a Variational Autoencoder (VAE) to enhance interpretability and clusterability.
result ISVAE produces a more interpretable and separable encoding with enhanced clusterability.
Two autoencoding models learn latent traffic scene representations.
problem Learning latent representations of traffic scenarios.
method CNN and RNN models for spatio-temporal and temporal data, incorporating permutation invariance.
result Latent scenario embeddings can be used for clustering and similarity retrieval.
RAEUFS selects features from data without labels, improving robustness to outliers.
problem Feature selection in high-dimensional data, especially in the presence of outliers.
method RAEUFS uses a deep autoencoder to learn nonlinear feature representations, improving robustness to outliers.
result RAEUFS outperforms state-of-the-art UFS methods in both clean and outlier-contaminated data settings.
MoE-Sim-VAE clusters and generates data from similarity-based representations.
problem Clustering high-dimensional data like biological measurements.
method Variational Autoencoder with Mixture-of-Experts architecture.
result MoE-Sim-VAE outperforms other methods in clustering and generating realistic data.
Proposes a new method for clustering compressed data.
problem Limited communication bandwidth and low-power consumption.
method Joint Variational Autoencoders with Bernoulli mixture models (VAB).
result The model can perform clustering in the compressed data domain.
The clustering methods have recently absorbed even-increasing attention in learning and vision. Deep clustering combines embedding and clustering together to obtain optimal embedding subspace for clustering, which can be more effective compared with conventional clustering methods. In this paper, we propose a joint lea…
GMVAE improves open-set classification by clustering latent representations.
problem Improving open-set classification accuracy and robustness.
method Cooperative learning of reconstruction and clustering in the latent space of a GMVAE.
result Achieved an average F1 improvement of 29.5% in open-set classification.
Detecting stellar clusters have always been an important research problem in Astronomy. Although images do not convey very detailed information in detecting stellar density enhancements, we attempt to understand if new machine learning techniques can reveal patterns that would assist in drawing better inferences from t…
New method uses random convex polytopes to measure representation quality.
problem Measuring the quality of deep learning representations.
method Random Polytope Descriptor method based on random convex polytopes.
result Regularization in autoencoders can degrade out-of-distribution detection.
Improves hierarchical clustering in Euclidean space using autoencoders.
problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.
BasisVAE combines VAE and clustering for tabular data analysis.
problem Lack of insights in tabular high-dimensional data analysis.
method Combines VAE with probabilistic clustering prior for joint dimensionality reduction and clustering.
result Learned one-hot basis function representation for translation-invariant features.
Deep learning autoencoder model clusters unlabeled time series data.
problem Clustering unlabeled time series data.
method Two-stage approach: create labels from time series characteristics, then use autoencoder for clustering.
result 87.5% accuracy in clustering unseen time series data.
Improved clustering accuracy with disentangled latent code representation.
problem Improving k-Means clustering performance.
method Optimizing the entanglement of autoencoder latent code representation using soft nearest neighbor loss with annealing temperature.
result 96.2% test clustering accuracy on MNIST, 85.6% on Fashion-MNIST, and 79.2% on EMNIST Balanced datasets.
Autoencoding topologystat.ML
The problem of learning a manifold structure on a dataset is framed in terms of a generative model, to which we use ideas behind autoencoders (namely adversarial/Wasserstein autoencoders) to fit deep neural networks. From a machine learning perspective, the resulting structure, an atlas of a manifold, may be viewed as …
Variation Autoencoder (VAE) has become a powerful tool in modeling the non-linear generative process of data from a low-dimensional latent space. Recently, several studies have proposed to use VAE for unsupervised clustering by using mixture models to capture the multi-modal structure of latent representations. This st…
We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoencoder has a newly designed decoder which builds a completely symmetric autoencoder form. For the re…
We develop a data driven approach to perform clustering and end-to-end feature learning simultaneously for streaming data that can adaptively detect novel clusters in emerging data. Our approach, Adaptive Nonparametric Variational Autoencoder (AdapVAE), learns the cluster membership through a Bayesian Nonparametric (BN…
DMAE uses neural networks to cluster data with flexible dissimilarity functions.
problem Clustering data with complex dissimilarity functions.
method Integrates a dissimilarity mixture model into deep learning architectures.
result DMAE achieves competitive clustering accuracy compared to other methods.
VampPrior Mixture Model improves clustering in DLVMs.
problem Simplicity of standard priors in DLVMs leads to poor clustering performance.
method Leverages VampPrior concepts to fit a Bayesian GMM prior in a VAE.
result VMM achieves highly competitive clustering performance on benchmark datasets.
Improved clustering and anomaly detection using latent space conditioning.
problem Anomaly detection on unlabeled data.
method Conditional latent space variational autoencoder (cLSVAE) that separates latent space by conditioning on data labels.
result The method outperforms typical variational autoencoders in clustering and anomaly detection.
We study a variant of the variational autoencoder model (VAE) with a Gaussian mixture as a prior distribution, with the goal of performing unsupervised clustering through deep generative models. We observe that the known problem of over-regularisation that has been shown to arise in regular VAEs also manifests itself i…
Twitter has been a prominent social media platform for mining population-level health data and accurate clustering of health-related tweets into topics is important for extracting relevant health insights. In this work, we propose deep convolutional autoencoders for learning compact representations of health-related tw…
Paper proposes a novel approach to improve temporal clustering of time series data.
problem Challenges in clustering temporal data with varying sampling rates and high dimensionality.
method Transform time series into Euclidean space using similarity measures, then use CNN-GRU autoencoder for latent representation.
result Approach outperforms existing methods by up to 32% on various time series datasets.
Interpretable Embeddings From Molecular Simulations Using Gaussian Mixture Variational Autoencodersphysics.chem-ph
GMVAE improves clustering in molecular simulations data.
problem Clustering metastable states in multi-basin free-energy landscapes.
method Gaussian mixture variational autoencoder (GMVAE) for dimensionality reduction and clustering.
result Enhanced clustering of metastable states compared to standard VAEs.
Graph regularized autoencoder improves anomaly detection performance.
problem Unsupervised anomaly detection in high-dimensional data.
method Developed a graph regularized autoencoder using MST-based distances.
result Outperforms alternative methods on 20 benchmark anomaly detection datasets.
We present a variation of the Autoencoder (AE) that explicitly maximizes the mutual information between the input data and the hidden representation. The proposed model, the InfoMax Autoencoder (IMAE), by construction is able to learn a robust representation and good prototypes of the data. IMAE is compared both theore…
In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To bui…
MNIST-Nd offers synthetic datasets to benchmark clustering across dimensions.
problem Clustering performance degrades with high-dimensional data.
method Training mixture variational autoencoders on MNIST to create synthetic datasets with varying latent dimensions.
result Leiden clustering algorithm is most robust as dimensionality grows.
Identifying customer segments in retail banking portfolios with different risk profiles can improve the accuracy of credit scoring. The Variational Autoencoder (VAE) has shown promising results in different research domains, and it has been documented the powerful information embedded in the latent space of the VAE. We…
New tensor kernels reduce mismatch between clustering and reconstruction objectives in deep learning.
problem Objective Function Mismatch in deep clustering.
method Proposed Unsupervised Companion Objectives (UCOs) with tensor kernels to address mismatch.
result Reduced OFM between clustering and reconstruction objectives, leading to improved clustering performance.
In unsupervised learning, there is no apparent straightforward cost function that can capture the significant factors of variations and similarities. Since natural systems have smooth dynamics, an opportunity is lost if an unsupervised objective function remains static during the training process. The absence of concre…
Paper proposes a deep subspace clustering method using multi-level representations.
problem Deep subspace clustering of images.
method Convolutional autoencoders with multiple fully-connected layers for multi-level representations, loss minimization with iterative updates.
result The method outperforms state-of-the-art methods on real-world datasets.
Recent developments in specialized computer hardware have greatly accelerated atomic level Molecular Dynamics (MD) simulations. A single GPU-attached cluster is capable of producing microsecond-length trajectories in reasonable amounts of time. Multiple protein states and a large number of microstates associated with f…
In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…
Simple linear model outperforms GCN in graph AE tasks.
problem Challenging tasks like link prediction and node clustering.
method Replaced GCN with a simple linear model on adjacency matrix.
result Simple model consistently reaches competitive performances.