Unsupervised classification methods learn a discriminative classifier from unlabeled data, which has been proven to be an effective way of simultaneously clustering the data and training a classifier from the data. Various unsupervised classification methods obtain appealing results by the classifiers learned in an uns…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Unsupervised Data”
Improved unsupervised anomaly detection using Random Forest.
problem Enhancing unsupervised anomaly detection accuracy.
method Training Random Forest to distinguish real and synthetic data, then applying transformed distances.
result Significant improvement in anomaly detection accuracy compared to other methods.
Ensemble learning, the machine learning paradigm where multiple algorithms are combined, has exhibited promising perfomance in a variety of tasks. The present work focuses on unsupervised ensemble classification. The term unsupervised refers to the ensemble combiner who has no knowledge of the ground-truth labels that …
Study proposes using auxiliary classification to improve unsupervised anomaly detection.
problem Challenging anomaly detection in high-dimensional data.
method Use of an auxiliary classification task to extract features from unlabelled data by supervised learning.
result Our feature learning approach yields best anomaly detection performance.
The authors advocate for more rigorous unsupervised cross-lingual learning methods.
problem Lack of parallel data for many languages.
method Review of unsupervised cross-lingual learning approaches and methodological issues.
result A scenario without parallel data and abundant monolingual data is unrealistic.
A central goal of unsupervised learning is to acquire representations from unlabeled data or experience that can be used for more effective learning of downstream tasks from modest amounts of labeled data. Many prior unsupervised learning works aim to do so by developing proxy objectives based on reconstruction, disent…
Paper proposes a novel unsupervised feature selection method using K-means and ADMM.
problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.
Paper summarizes unsupervised learning challenges for disentangled representations.
problem Unsupervised learning of disentangled representations without inductive biases.
method Theoretical and practical analysis of existing approaches.
result Unsupervised disentanglement is fundamentally impossible without inductive biases.
Super-AND improves unsupervised embedding learning with 89.2% accuracy on CIFAR-10.
problem Extracting good representations from data without labels.
method Super-AND uses unique losses to gather similar samples and maintain features.
result Super-AND achieves 89.2% accuracy on CIFAR-10 image classification.
End-to-end training solves deep unsupervised contrastive learning problems.
problem Theoretical analysis of unsupervised contrastive learning.
method End-to-end training of deep neural networks.
result Approximate stationary solutions found for non-convex contrastive loss.
Paper presents a workflow for reliable unsupervised learning in science.
problem Lack of standardization in unsupervised learning workflows for reproducible scientific discoveries.
method Structured workflow including data preparation, modeling, validation, and communication.
result Illustrates the importance of validation in unsupervised learning.
A new method for feature selection in high-dimensional data.
problem Dealing with noise and high-dimensional data in unsupervised feature selection.
method Sparse PCA via -norm regularization, combined with an efficient optimization algorithm.
result The proposed method effectively selects features from real-world data sets.
Proposes a new model for unsupervised clustering with latent variables.
problem The challenge of unsupervised clustering in machine learning.
method Clustered Generator Model with continuous and discrete latent variables.
result Achieves competitive unsupervised clustering accuracy and disentangled latent representations.
Inference of gene regulatory network from expression data is a challenging task. Many methods have been developed to this purpose but a comprehensive evaluation that covers unsupervised, semi-supervised and supervised methods, and provides guidelines for their practical application, is lacking. We performed an extensiv…
New unsupervised feature selection method for imbalanced datasets.
problem Feature selection challenges in imbalanced multi-class datasets.
method Distance Rank Score using Spearman's Rank Correlation.
result Outperforms existing methods on clustering problems.
A major goal of unsupervised learning is to discover data representations that are useful for subsequent tasks, without access to supervised labels during training. Typically, this involves minimizing a surrogate objective, such as the negative log likelihood of a generative model, with the hope that representations us…
Unsupervised model detects healthcare fraud from patient visit data.
problem Detecting fraudulent healthcare bills from patient visit data.
method Uses LSTM and seq2seq models for anomaly detection, normalizes scores with EDF.
result Improves anomaly detection for high class imbalance problems.
This paper proves the theoretical advantage of unsupervised pretraining for machine learning tasks.
problem Understanding why unsupervised pretraining helps in machine learning tasks.
method A generic framework using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for downstream tasks.
result Proves an excess risk of for downstream tasks under mild conditions.
Discovering Phase Transitions with Unsupervised Learningcond-mat.stat-mech
Unsupervised learning is a discipline of machine learning which aims at discovering patterns in big data sets or classifying the data into several categories without being trained explicitly. We show that unsupervised learning techniques can be readily used to identify phases and phases transitions of many body systems…
An Unsupervised Approach for Automatic Activity Recognition based on Hidden Markov Model Regressionstat.ML
Using supervised machine learning approaches to recognize human activities from on-body wearable accelerometers generally requires a large amount of labelled data. When ground truth information is not available, too expensive, time consuming or difficult to collect, one has to rely on unsupervised approaches. This pape…
This research shows unsupervised GANs can perform object segmentation without labels.
problem Performing object segmentation without pixel or image-level labels.
method Used large-scale unsupervised GAN models to differentiate foreground from background.
result Demonstrated high-quality saliency masks and new state-of-the-art performance.
Improves deep learning with less labeled data using unsupervised projection.
problem Lack of labeled data for deep learning models.
method Modified unsupervised discriminant projection as a regularization term for semi-supervised learning.
result Proposes an algorithm that enhances classification performance with minimal labeled data.
Minimal variations guide unsupervised learning for better downstream tasks.
problem Efficiently describing raw data for various future tasks.
method Minimal variations as a guiding principle for unsupervised representation learning.
result Unveiling minimal variations as a principle behind unsupervised learning.
A new deep learning framework selects representative samples for unsupervised learning.
problem Selecting representative samples for unsupervised learning in non-linear data.
method DUAL framework using an encoder-decoder architecture to learn nonlinear embeddings and a selection block to choose representative samples.
result DUAL outperforms state-of-the-art methods in selecting representative samples for unsupervised learning.
New method embeds phylogenetic trees for clustering, recovering evolutionary relationships.
problem Lack of a meaningful way to embed phylogenetic trees into a vector space.
method Split-weight embedding to fit clustering algorithms to phylogenetic trees.
result Split-weight embedding recovers meaningful evolutionary relationships in simulated and real data.
We introduce a framework to leverage knowledge acquired from a repository of (heterogeneous) supervised datasets to new unsupervised datasets. Our perspective avoids the subjectivity inherent in unsupervised learning by reducing it to supervised learning, and provides a principled way to evaluate unsupervised algorithm…
Enhances weather detection by learning from auxiliary information.
problem Mispredictions in unsupervised severe weather detection.
method Learning joint representations of textual and weather data.
result Improved decision boundaries for severe weather detection.
Paper proposes DRL for unsupervised IoT localization.
problem Challenges in unsupervised localization of IoT devices.
method Modeling localization as MDP, using DRL with reward-setting and RSS measurements.
result Demonstrated effectiveness of DRL in wireless localization.
This paper critically examines unsupervised disentangled representation learning, revealing challenges and limitations.
problem The difficulty of unsupervised learning of disentangled representations and the challenges in evaluation metrics.
method Theoretical analysis and a large-scale experimental study covering 8 datasets and 14000 models.
result Well-disentangled models cannot be identified without supervision, and different evaluation metrics disagree on what constitutes disentanglement.
Proposes manifold-based unsupervised anomaly detection for visual data.
problem Rare anomalies in unlabeled data.
method Constant curvature manifolds, hyperspherical Variational Auto-Encoders (VAE) with gyroplane layer.
result State-of-the-art results on visual anomaly benchmarks and histopathology.
Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for uns…
Study examines the training process of an unsupervised learning model for detecting gravitational-wave transient noise.
problem Transient noise in gravitational-wave detector data causes instability and signal overlap.
method Unsupervised deep learning with variational autoencoder and invariant information clustering applied to the Gravity Spy dataset.
result Training process of the unsupervised learning architecture is examined and reported.
Paper tackles medical image diagnosis with unsupervised domain adaptation.
problem Limited labeled samples and label noise in medical images.
method Collaborative Unsupervised Domain Adaptation (UDA) algorithm.
result Empirical results show superiority of the proposed method.
A new framework uses information theory to detect anomalies in images without labeled data.
problem Detect anomalies in images without labeled data.
method A direct objective function using information theory to maximize the distance between normal and anomalous data.
result The proposed framework significantly outperforms state-of-the-arts on multiple benchmark datasets.
This work proposes unsupervised learning by predicting random distances in neural networks.
problem Lack of labelled data in unsupervised learning tasks.
method Train neural networks to predict random distances in a randomly projected space, optimizing for genuine class structures.
result Learned representations outperform state-of-the-art methods in anomaly detection and clustering.
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.
ARGUE combines expert networks for anomaly detection.
problem Anomaly detection without labeled data.
method Gated mixture-of-experts architecture combining expert networks.
result Prior knowledge about normal data distribution is valuable.
UDA learns target domain from unlabeled data via source knowledge transfer.
problem Learning unlabeled target domain data.
method Transferring both source knowledge and target-relatedness.
result Improves UDA performance by simultaneous knowledge transfer.
In applications of machine learning to particle physics, a persistent challenge is how to go beyond discrimination to learn about the underlying physics. To this end, a powerful tool would be a framework for unsupervised learning, where the machine learns the intricate high-dimensional contours of the data upon which i…
Score calibration enables automatic speaker recognizers to make cost-effective accept / reject decisions. Traditional calibration requires supervised data, which is an expensive resource. We propose a 2-component GMM for unsupervised calibration and demonstrate good performance relative to a supervised baseline on NIST…
Model adaptation and unsupervised learning with non-stationary batch data under smooth concept driftcs.LG
Paper proposes an unsupervised adaptation algorithm for non-stationary batch data.
problem Gradual concept drift in non-stationary data sources.
method Iterative unsupervised algorithm for model adaptation.
result Improved performance of adapted models compared to unadapted ones.
CasVAE outperforms supervised methods for star-galaxy classification.
problem Challenges in machine learning for astronomy data.
method Cascade Variational Auto-Encoder (CasVAE) for unsupervised star-galaxy classification.
result CasVAE outperforms baseline models in accuracy and stability.
SUOD accelerates unsupervised outlier detection for large datasets.
problem Scalability issues in unsupervised outlier detection for high-dimensional datasets.
method Three-module acceleration framework: Random Projection, Balanced Parallel Scheduling, Pseudo-supervised Approximation.
result SUOD significantly improves efficiency and scalability in outlier detection.
We introduce 'semi-unsupervised learning', a problem regime related to transfer learning and zero-shot learning where, in the training data, some classes are sparsely labelled and others entirely unlabelled. Models able to learn from training data of this type are potentially of great use as many real-world datasets ar…
Benchmark data sets are of vital importance in machine learning research, as indicated by the number of repositories that exist to make them publicly available. Although many of these are usable in the stream mining context as well, it is less obvious which data sets can be used to evaluate data stream clustering algor…
Is all of machine learning supervised to some degree? The field of machine learning has traditionally been categorized pedagogically into ; where supervised learning has typically referred to learning from labeled data, while unsupervised learning has typically referred to learning …
New method reconstructs past foehn occurrences using unsupervised and supervised learning.
problem Reconstructing past foehn occurrences due to lack of direct measurement.
method Combining unsupervised and supervised learning methods to infer foehn occurrences from reanalysis data.
result Accurate hourly reconstructions of past foehn occurrences for 83 years.
A multi-step framework tackles online unsupervised domain adaptation with novel mean-target subspace computation.
problem Online unsupervised domain adaptation with unlabelled target data arriving sequentially.
method Multi-step framework with a novel mean-target subspace computation and temporal coherency consideration.
result Improved performance over previous approaches on four datasets.