Minimally Supervised Learning using Topological Projections in
Self-Organizing Maps
- URL: http://arxiv.org/abs/2401.06923v2
- Date: Thu, 15 Feb 2024 18:15:35 GMT
- Title: Minimally Supervised Learning using Topological Projections in
Self-Organizing Maps
- Authors: Zimeng Lyu, Alexander Ororbia, Rui Li, Travis Desell
- Abstract summary: We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs)
Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU)
Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
- Score: 55.31182147885694
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Parameter prediction is essential for many applications, facilitating
insightful interpretation and decision-making. However, in many real life
domains, such as power systems, medicine, and engineering, it can be very
expensive to acquire ground truth labels for certain datasets as they may
require extensive and expensive laboratory testing. In this work, we introduce
a semi-supervised learning approach based on topological projections in
self-organizing maps (SOMs), which significantly reduces the required number of
labeled data points to perform parameter prediction, effectively exploiting
information contained in large unlabeled datasets. Our proposed method first
trains SOMs on unlabeled data and then a minimal number of available labeled
data points are assigned to key best matching units (BMU). The values estimated
for newly-encountered data points are computed utilizing the average of the $n$
closest labeled data points in the SOM's U-matrix in tandem with a topological
shortest path distance calculation scheme. Our results indicate that the
proposed minimally supervised model significantly outperforms traditional
regression techniques, including linear and polynomial regression, Gaussian
process regression, K-nearest neighbors, as well as deep neural network models
and related clustering schemes.
Related papers
- A Bayesian Approach to Data Point Selection [24.98069363998565]
Data point selection (DPS) is becoming a critical topic in deep learning.
Existing approaches to DPS are predominantly based on a bi-level optimisation (BLO) formulation.
We propose a novel Bayesian approach to DPS.
arXiv Detail & Related papers (2024-11-06T09:04:13Z) - Weakly supervised covariance matrices alignment through Stiefel matrices
estimation for MEG applications [64.20396555814513]
This paper introduces a novel domain adaptation technique for time series data, called Mixing model Stiefel Adaptation (MSA)
We exploit abundant unlabeled data in the target domain to ensure effective prediction by establishing pairwise correspondence with equivalent signal variances between domains.
MSA outperforms recent methods in brain-age regression with task variations using magnetoencephalography (MEG) signals from the Cam-CAN dataset.
arXiv Detail & Related papers (2024-01-24T19:04:49Z) - Querying Easily Flip-flopped Samples for Deep Active Learning [63.62397322172216]
Active learning is a machine learning paradigm that aims to improve the performance of a model by strategically selecting and querying unlabeled data.
One effective selection strategy is to base it on the model's predictive uncertainty, which can be interpreted as a measure of how informative a sample is.
This paper proposes the it least disagree metric (LDM) as the smallest probability of disagreement of the predicted label.
arXiv Detail & Related papers (2024-01-18T08:12:23Z) - Large-scale Fully-Unsupervised Re-Identification [78.47108158030213]
We propose two strategies to learn from large-scale unlabeled data.
The first strategy performs a local neighborhood sampling to reduce the dataset size in each without violating neighborhood relationships.
A second strategy leverages a novel Re-Ranking technique, which has a lower time upper bound complexity and reduces the memory complexity from O(n2) to O(kn) with k n.
arXiv Detail & Related papers (2023-07-26T16:19:19Z) - Iterative self-transfer learning: A general methodology for response
time-history prediction based on small dataset [0.0]
An iterative self-transfer learningmethod for training neural networks based on small datasets is proposed in this study.
The results show that the proposed method can improve the model performance by near an order of magnitude on small datasets.
arXiv Detail & Related papers (2023-06-14T18:48:04Z) - A Survey of Learning on Small Data: Generalization, Optimization, and
Challenge [101.27154181792567]
Learning on small data that approximates the generalization ability of big data is one of the ultimate purposes of AI.
This survey follows the active sampling theory under a PAC framework to analyze the generalization error and label complexity of learning on small data.
Multiple data applications that may benefit from efficient small data representation are surveyed.
arXiv Detail & Related papers (2022-07-29T02:34:19Z) - A Topological Data Analysis Based Classifier [1.6668132748773563]
This paper proposes an algorithm that applies Topological Data Analysis directly to multi-class classification problems.
The proposed algorithm builds a filtered simplicial complex on the dataset.
On average, the proposed TDABC method was better than KNN and weighted-KNN.
arXiv Detail & Related papers (2021-11-09T15:54:16Z) - Bayesian graph convolutional neural networks via tempered MCMC [0.41998444721319217]
Deep learning models, such as convolutional neural networks, have long been applied to image and multi-media tasks.
More recently, there has been more attention to unstructured data that can be represented via graphs.
These types of data are often found in health and medicine, social networks, and research data repositories.
arXiv Detail & Related papers (2021-04-17T04:03:25Z) - Classification based on Topological Data Analysis [1.6668132748773563]
Topological Data Analysis (TDA) is an emergent field that aims to discover topological information hidden in a dataset.
This paper proposes an algorithm that applies TDA directly to multi-class classification problems, even imbalanced datasets.
arXiv Detail & Related papers (2021-02-07T03:47:28Z) - Semi-Supervised Learning with Meta-Gradient [123.26748223837802]
We propose a simple yet effective meta-learning algorithm in semi-supervised learning.
We find that the proposed algorithm performs favorably against state-of-the-art methods.
arXiv Detail & Related papers (2020-07-08T08:48:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.