Circular convolution-based feature extraction algorithm for classification of high-dimensional datasets

Abstract

High-dimensional data analysis has become the most challenging task nowadays. Dimensionality reduction plays an important role here. It focuses on data features, which have proved their impact on accuracy, execution time, and space requirement. In this study, a dimensionality reduction method is proposed based on the convolution of input features. The experiments are carried out on minimal preprocessed nine benchmark datasets. Results show that the proposed method gives an average 38% feature reduction in the original dimensions. The algorithm accuracy is tested using the decision tree (DT), support vector machine (SVM), and K-nearest neighbor (KNN) classifiers and evaluated with the existing principal component analysis algorithm. The average increase in accuracy (Δ) is 8.06 for DT, 5.80 for SVM, and 18.80 for the KNN algorithm. The most significant characteristic feature of the proposed model is that it reduces attributes, leading to less computation time without loss in classifier accuracy.

Maxima of the A α -spectral Radius of Graphs with Given Size and Minimum Degree δ ≥ 2

“…4) Both global and individual optimality are being updated. 5) When the number of iterations is reached, you should stop and output the parameters [15]. Repeat steps 2) through 4) until the maximum number of iterations is reached if the number of iterations has not been reached.…”

“…Using Autodesk 3d-Max tools, the substation equipment, buildings, and the surrounding terrain environment are modelled in a 3D scene in accordance with predetermined modelling standards. [7] suggested an early warning system that uses UAVs and laser scanning to detect the surroundings of substations intelligently.…”