Search arXivSearch

arXiv · 2109.13521

A multi-stage semi-supervised improved deep embedded clustering method for bearing fault diagnosis under the situation of insufficient labeled samples

Abstract

Although data-driven fault diagnosis methods have been widely applied, massive labeled data are required for model training. However, a difficulty of implementing this in real industries hinders the application of these methods. Hence, an effective diagnostic approach that can work well in such situation is urgently needed.In this study, a multi-stage semi-supervised improved deep embedded clustering (MS-SSIDEC) method, which combines semi-supervised learning with improved deep embedded clustering (IDEC), is proposed to jointly explore scarce labeled data and massive unlabeled data. In the first stage, a skip-connection-based convolutional auto-encoder (SCCAE) that can automatically map the unlabeled data into a low-dimensional feature space is proposed and pre-trained to be a fault feature extractor. In the second stage, a semi-supervised improved deep embedded clustering (SSIDEC) network is proposed for clustering. It is first initialized with available labeled data and then used to simultaneously optimize the clustering label assignment and make the feature space to be more clustering-friendly. To tackle the phenomenon of overfitting, virtual adversarial training (VAT) is introduced as a regularization term in this stage. In the third stage, pseudo labels are obtained by the high-quality results of SSIDEC. The labeled dataset can be augmented by these pseudo-labeled data and then leveraged to train a bearing fault diagnosis model. Two public datasets of vibration data from rolling bearings are used to evaluate the performance of the proposed method. Experimental results indicate that the proposed method achieves a promising performance in both semi-supervised and unsupervised fault diagnosis tasks. This method provides a new approach for fault diagnosis under the situation of limited labeled samples by effectively exploring unsupervised data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tongda Sun, Gang Yu. 2021-11-23. A multi-stage semi-supervised improved deep embedded clustering method for bearing fault diagnosis under the situation of insufficient labeled samples. https://arxiv.org/abs/2109.13521

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG