Clustering Algorithm for Vehicle’s Driving Data Feature based on Integrated Navigation

2021 ◽  
Vol 13 (4) ◽  
Author(s):  
Na Guo ◽  
Yiyi Zhu
Keyword(s):  
Clustering Algorithm ◽  
Principal Component ◽  
Kernel Principal Component Analysis ◽  
Integrated Navigation ◽  
Clustering Problem ◽  
Incremental Method ◽  
Feature Parameters ◽  
Vehicle Acceleration ◽  
Feature Based ◽  
Clustering Problems

The clustering result of K-means clustering algorithm is affected by the initial clustering center and the clustering result is not always global optimal. Therefore, the clustering analysis of vehicle’s driving data feature based on integrated navigation is carried out based on global K-means clustering algorithm. The vehicle mathematical model based on GPS/DR integrated navigation is constructed and the vehicle’s driving data based on GPS/DR integrated navigation, such as vehicle acceleration, are collected. After extracting the vehicle’s driving data features, the feature parameters of vehicle’s driving data are dimensionally reduced based on kernel principal component analysis to reduce the redundancy of feature parameters. The global K-means clustering algorithm converts clustering problem into a series of sub-cluster clustering problems. At the end of each iteration, an incremental method is used to select the next cluster of optimal initial centers. After determining the optimal clustering number, the feature clustering of vehicle’s driving data is completed. The experimental results show that the global K-means clustering algorithm has a clustering error of only 1.37% for vehicle’s driving data features and achieves high precision clustering for vehicle’s driving data features.

Failure Prediction and Wear State Evaluation of Power Shift Steering Transmission

2015 ◽  
Vol 741 ◽  
pp. 183-187 ◽  
Author(s):  
Yong Liu ◽  
Biao Ma ◽  
Yu Yan ◽  
Chang Song Zheng
Keyword(s):  
Principal Component Analysis ◽  
Clustering Algorithm ◽  
Principal Component ◽  
Atomic Emission ◽  
Component Analysis ◽  
Kernel Principal Component Analysis ◽  
State Evaluation ◽  
Power Shift ◽  
Fuzzy C Means Clustering ◽  
Friction Surfaces

Within the vehicle transmission, the friction surfaces of mechanical parts were consecutively worn-out and ultimately up to the degradation failures. For assessing the wear progress effectively, wear particles should be generally monitored by measuring the element concentration through Atomic emission (AE) spectroscopy. Herein, the spectral data sampled from life-cycle test has been processed by both the Principal Component Analysis (PCA) and further Kernel Principal Component Analysis (KPCA). Results show that KPCA acts more effectively in variable-dimensions reduction due to fewer principle components and higher cumulative contributing rate. To detect the threshold point at where the wear-stage upgraded, the Fuzzy C-means clustering algorithm was applied to process the eigenvalues of principle components. Furthermore, it is demonstrated that the principle components relate to the worn-out state of friction pairs or transmission parts. In general, the introduction of KPCA has contributed to assess the wear-stage at where the machine situates and the accurate worn-out state of various transmission parts.

scholarly journals Incremental Matrix-Based Subspace Method for Matrix-Based Feature Extraction

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Zhaoyang Zhang ◽  
Shijie Sun ◽  
Wei Wang
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Spatial Statistics ◽  
Principal Component ◽  
Kernel Principal Component Analysis ◽  
Subspace Method ◽  
Training Set ◽  
Incremental Method ◽  
The Matrix ◽  
The Given

The matrix-based features can provide valid and interpretable information for matrix-based data such as image. Matrix-based kernel principal component analysis (MKPCA) is a way for extracting matrix-based features. The extracted matrix-based feature is useful to both dimension reduction and spatial statistics analysis for an image. In contrast, the efficiency of MKPCA is highly restricted by the dimension of the given matrix data and the size of the training set. In this paper, an incremental method to extract features of a matrix-based dataset is proposed. The method is methodologically consistent with MKPCA and can improve efficiency through incrementally selecting the proper projection matrix of the MKPCA by rotating the current subspace. The performance of the proposed method is evaluated by performing several experiments on both point and image datasets.

Application of Kernel Trick to Fuzzy c-Means with Regularization by K-L Information

2004 ◽  
Vol 8 (6) ◽  
pp. 566-572 ◽  
Author(s):  
Hidetomo Ichihashi ◽  
◽  
Katsuhiro Honda
Keyword(s):  
Principal Component Analysis ◽  
Clustering Algorithm ◽  
Principal Component ◽  
Component Analysis ◽  
Gaussian Mixture ◽  
Kernel Principal Component Analysis ◽  
Support Vector ◽  
Fisher Discriminant Analysis ◽  
Kernel Trick ◽  
Kernel Approach

Support vector machines (SVM), kernel principal component analysis (KPCA), and kernel Fisher discriminant analysis (KFD), are examples of successful kernel-based learning methods. By the addition of a regularizer and the kernel trick to a fuzzy counterpart of Gaussian mixture models (GMM), this paper proposes a clustering algorithm in an extended high dimensional feature space. Unlike the global nonlinear approaches, GMM or its fuzzy counterpart is to model nonlinear structure with a collection, or mixture, of local linear sub-models of PCA. When the number of feature vectors and clusters are n and c respectively, this kernel approach can find up to c × n nonzero eigenvalues. A way to control the number of parameters in the mixture of probabilistic principal component analysis (PPCA) is adopted to reduce the number of parameters. The algorithm provides a partitioning with flexible shape of clusters in the original input data space.

Application of Machine Learning in Animal Disease Analysis and Prediction

2020 ◽  
Vol 15 ◽  
Author(s):  
Shuwen Zhang ◽  
Qiang Su ◽  
Qin Chen
Keyword(s):  
Machine Learning ◽  
Unsupervised Learning ◽  
Supervised Learning ◽  
Clustering Algorithm ◽  
Principal Component ◽  
Support Vector ◽  
Animal Disease ◽  
Human Beings ◽  
Animal Diseases ◽  
Disease Analysis

Abstract: Major animal diseases pose a great threat to animal husbandry and human beings. With the deepening of globalization and the abundance of data resources, the prediction and analysis of animal diseases by using big data are becoming more and more important. The focus of machine learning is to make computers learn how to learn from data and use the learned experience to analyze and predict. Firstly, this paper introduces the animal epidemic situation and machine learning. Then it briefly introduces the application of machine learning in animal disease analysis and prediction. Machine learning is mainly divided into supervised learning and unsupervised learning. Supervised learning includes support vector machines, naive bayes, decision trees, random forests, logistic regression, artificial neural networks, deep learning, and AdaBoost. Unsupervised learning has maximum expectation algorithm, principal component analysis hierarchical clustering algorithm and maxent. Through the discussion of this paper, people have a clearer concept of machine learning and understand its application prospect in animal diseases.

scholarly journals Monitoring a Reverse Osmosis Process with Kernel Principal Component Analysis: A Preliminary Approach

2021 ◽  
Vol 11 (14) ◽  
pp. 6370
Author(s):  
Elena Quatrini ◽  
Francesco Costantino ◽  
David Mba ◽  
Xiaochuan Li ◽  
Tat-Hean Gan
Keyword(s):  
Principal Component Analysis ◽  
Fault Detection ◽  
Water Purification ◽  
Principal Component ◽  
Temporal Correlation ◽  
Component Analysis ◽  
Kernel Principal Component Analysis ◽  
Original Dataset ◽  
Monitoring Process ◽  
Machine Health

The water purification process is becoming increasingly important to ensure the continuity and quality of subsequent production processes, and it is particularly relevant in pharmaceutical contexts. However, in this context, the difficulties arising during the monitoring process are manifold. On the one hand, the monitoring process reveals various discontinuities due to different characteristics of the input water. On the other hand, the monitoring process is discontinuous and random itself, thus not guaranteeing continuity of the parameters and hindering a straightforward analysis. Consequently, further research on water purification processes is paramount to identify the most suitable techniques able to guarantee good performance. Against this background, this paper proposes an application of kernel principal component analysis for fault detection in a process with the above-mentioned characteristics. Based on the temporal variability of the process, the paper suggests the use of past and future matrices as input for fault detection as an alternative to the original dataset. In this manner, the temporal correlation between process parameters and machine health is accounted for. The proposed approach confirms the possibility of obtaining very good monitoring results in the analyzed context.

Data Mining in Analysis of Biomechanical Signals

2009 ◽  
Vol 147-149 ◽  
pp. 588-593 ◽  
Author(s):  
Marcin Derlatka ◽  
Jolanta Pauk
Keyword(s):  
Data Mining ◽  
Principal Component Analysis ◽  
Cerebral Palsy ◽  
Spina Bifida ◽  
Decision Tree ◽  
Principal Component ◽  
Data Preprocessing ◽  
Component Analysis ◽  
Kernel Principal Component Analysis

In the paper the procedure of processing biomechanical data has been proposed. It consists of selecting proper noiseless data, preprocessing data by means of model’s identification and Kernel Principal Component Analysis and next classification using decision tree. The obtained results of classification into groups (normal and two selected pathology of gait: Spina Bifida and Cerebral Palsy) were very good.

Sign in / Sign up

Export Citation Format

Share Document