Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = pairwise controlled manifold approximation (PaCMAP)

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 4245 KiB  
Article
An Intelligent Reliability Assessment and Prognosis of Rolling Bearings Using Adaptive Cyclostationary Blind Deconvolution and AdaBoost-Mixed Kernel Relevance Vector Machine
by Yifan Yu, Shuxi Chen, Depeng Gao and Jianlin Qiu
Algorithms 2025, 18(4), 192; https://doi.org/10.3390/a18040192 - 28 Mar 2025
Viewed by 274
Abstract
In this paper, a reliability assessment and prediction method based on bearing vibration signals is proposed, which combines Adaptive Cyclostationary Blind Deconvolution (ACYCBD) and AdaBoost-Mixed Kernel Relevance Vector Machine. Firstly, CYCBD parameters were optimized by the Ivy optimization algorithm to enhance the noise [...] Read more.
In this paper, a reliability assessment and prediction method based on bearing vibration signals is proposed, which combines Adaptive Cyclostationary Blind Deconvolution (ACYCBD) and AdaBoost-Mixed Kernel Relevance Vector Machine. Firstly, CYCBD parameters were optimized by the Ivy optimization algorithm to enhance the noise reduction effect, and then multidimensional features were extracted and dimensionalization was reduced by PaCMAP. Based on dimensionality reduction features, logistic regression was used to evaluate reliability, and AdaBoost-MKRVM was combined to predict reliability. The experimental results show that the mean absolute error (MAE) of the proposed method on the bearing life dataset of Xi’an Jiaotong University is 0.052, which is better than the traditional method, and provides a new idea for the performance prediction of rolling bearings. Full article
(This article belongs to the Section Algorithms for Multidisciplinary Applications)
Show Figures

Figure 1

22 pages, 12387 KiB  
Article
Fuzzy Information Discrimination Measures and Their Application to Low Dimensional Embedding Construction in the UMAP Algorithm
by Liliya A. Demidova and Artyom V. Gorchakov
J. Imaging 2022, 8(4), 113; https://doi.org/10.3390/jimaging8040113 - 15 Apr 2022
Cited by 10 | Viewed by 4099
Abstract
Dimensionality reduction techniques are often used by researchers in order to make high dimensional data easier to interpret visually, as data visualization is only possible in low dimensional spaces. Recent research in nonlinear dimensionality reduction introduced many effective algorithms, including t-distributed stochastic neighbor [...] Read more.
Dimensionality reduction techniques are often used by researchers in order to make high dimensional data easier to interpret visually, as data visualization is only possible in low dimensional spaces. Recent research in nonlinear dimensionality reduction introduced many effective algorithms, including t-distributed stochastic neighbor embedding (t-SNE), uniform manifold approximation and projection (UMAP), dimensionality reduction technique based on triplet constraints (TriMAP), and pairwise controlled manifold approximation (PaCMAP), aimed to preserve both the local and global structure of high dimensional data while reducing the dimensionality. The UMAP algorithm has found its application in bioinformatics, genetics, genomics, and has been widely used to improve the accuracy of other machine learning algorithms. In this research, we compare the performance of different fuzzy information discrimination measures used as loss functions in the UMAP algorithm while constructing low dimensional embeddings. In order to achieve this, we derive the gradients of the considered losses analytically and employ the Adam algorithm during the loss function optimization process. From the conducted experimental studies we conclude that the use of either the logarithmic fuzzy cross entropy loss without reduced repulsion or the symmetric logarithmic fuzzy cross entropy loss with sufficiently large neighbor count leads to better global structure preservation of the original multidimensional data when compared to the loss function used in the original UMAP algorithm implementation. Full article
(This article belongs to the Section AI in Imaging)
Show Figures

Figure 1

Back to TopTop