High-dimensional Problems Research Articles

Using Reinforcement Learning to Select an Optimal Feature Set

Feature Selection (FS) is an essential research topic in the area of machine learning. FS, which is the process of identifying the relevant features and removing the irrelevant and redundant ones, is meant to deal with the high dimensionality problem for the sake of selecting the best performing feature subset. In the literature, many feature selection techniques approach the task as a research problem, where each state in the search space is a possible feature subset. In this paper, we introduce a new feature selection method based on reinforcement learning. First, decision tree branches are used to traverse the search space. Second, a transition similarity measure is proposed so as to ensure exploit‐explore trade‐off. Finally, the informative features are the most involved ones in constructing the best branches. The performance of the proposed approaches is evaluated on nine standard benchmark datasets. The results using the AUC score show the effectiveness of the proposed system.

Optimisation of hybrid composite shields for hypervelocity Micro-Meteoroid and Orbital Debris (MMOD) impact

Advancements in space exploration over the last few decades have led to a sharp increase in Micro-Meteoroid and Orbital Debris (MMOD), with the associated increased risk of hypervelocity impact on satellites and space structures. The Whipple shield can mitigate the effects of such impacts and current research is exploring further developments towards effective lightweight passive shielding technology to counter the damaging effects of MMOD. With the increase in MMOD and the prospect of increased space travel in the coming years and decades, it is vital that more research is conducted and improvements are made in the development and design of efficient, lightweight shielding technology to protect both unmanned and manned spacecraft against hypervelocity impacts (HVI). The optimisation of shield design for HVI is a high dimensionality problem, suited to advanced computational approaches. Key variables in HVI shield design that should inform the focus on optimisation include: impact velocity, rear wall thickness, projectile diameter and bumper thickness. A hybrid shield configuration and numerical model are proposed and validated, with alternating layers of aluminium (AL2024) and carbon fibre composites (CFRP, T300 woven-fabric) to form a 5 mm thick target plate consisting of 5 plies. The adaptive coupled FEM-SPH method is used to model the target plates. The proposed hypervelocity shield design optimisation methodology is based on Direct Simulation-based Genetic Algorithm (DSGA) optimisation and is implemented to optimise a multi-variable shield design space. Objective weightings are used to analyse and discuss results, referring to the ratio of the kinetic energy to the shield areal density objectives. A clear transition in the impact behaviour of the optimised MMOD shields is observed in the transition region from high-velocity to hypervelocity impact, where significant levels of kinetic energy dissipation are observed below the transition region, and lower energy dissipation at hypervelocity. The shield design optimisation results show that with a weighted kinetic energy to mass objective of 90:10, the kinetic energy of the back shield plate decreases significantly (62.7%) and the areal density can be reduced by more than 18%. Alternative configurations displayed sub-optimal results based on a trade-off between objective functions.

LiFoL: An Efficient Framework for Financial Distress Prediction in High-Dimensional Unbalanced Scenario

Corporate financial distress will significantly damage the company’s and its stakeholders’ interests and even lead to a global financial crisis. Therefore, finding an efficient method for financial distress prediction (FDP) to avoid greater losses is essential. Although there is a lot of research and progress in this field, the existing methods rarely consider the problems of high dimensionality and class imbalance, which will largely limit the models to achieve satisfactory performance. To alleviate these problems, this article first proposes a novel Lightspace-SMOTE upsampling method, which can reduce the feature dimensionality and increase the signal-to-noise ratio (SNR) of the original data and then upsample it to increase the number of minor class samples. In addition, this article proposes an efficient ensemble framework (LiFoL) that combines Lightspace-SMOTE, focal loss (FL), and LightGBM, which can not only focus more on minor class and the hard-to-class samples but also obtain better performance. At the same time, the feature importance provided by the model can provide strong support for model interpretability. Experimental results show that the Lightspace-SMOTE upsampling method can help the model achieve higher scores in area under ROC curve (AUC) and recall, especially in the case of longer prediction periods. Compared with current methods, LiFoL can achieve more than 10% improvement in AUC and more than 20% in recall.

ANOVA approximation with mixed tensor product basis on scattered points

In this paper we consider an orthonormal basis, generated by a tensor product of Fourier basis functions, half period cosine basis functions, and the Chebyshev basis functions. We deal with the approximation problem in high dimensions related to this basis and design a fast algorithm to multiply with the underlying matrix, consisting of rows of the non-equidistant Fourier matrix, the non-equidistant cosine matrix and the non-equidistant Chebyshev matrix, and its transposed. Using this, we derive the ANOVA (analysis of variance) decomposition for functions with partially periodic boundary conditions through using the Fourier basis in some dimensions and the half period cosine basis or the Chebyshev basis in others. We consider sensitivity analysis in this setting, in order to find an adapted basis for the underlying approximation problem. More precisely, we find the underlying index set of the multidimensional series expansion. Additionally, we test this ANOVA approximation with mixed basis at numerical experiments, and refer to the advantage of interpretable results.

The synergy complement control approach for seamless limb-driven prostheses

Limb-driven control allows for direct control by using residual limb movements rather than unnatural and complex muscle activation. Existing limb-driven methods simultaneously learn a variety of possible motions, ranging from a residual limb to entire arm motions, from human templates by relying on linear or nonlinear regression techniques. However, the map between a low-dimensional residual limb movement and high-dimensional total limb movement is highly underdetermined. Therefore, this complex, high-dimensional coordination problem cannot be accurately solved by treating it as a data-driven black box problem. Here we address this challenge by introducing the residual limb-driven control framework synergy complement control. Firstly, the residual limb drives a one-dimensional phase variable to simultaneously control the multiple joints of the prosthesis. Secondly, the resulting prosthesis motion naturally complements the movement of the residual limb by its synergy components. Furthermore, our framework adds information on contextual tasks and goals and allows for seamless transitions between these. Experimental validation was conducted using subjects with preserved arms employing an exo-prosthesis setup, and studies involving participants with and without limb differences in a virtual reality setup. The findings affirm that the restoration of lost coordinated synergy capabilities is reliably achieved through the utilization of synergy complement control with the prosthesis.

Probabilistic back-analysis of rainfall-induced landslides for slope reliability prediction with multi-source information

Probabilistic back-analysis is an important means to infer the statistics of uncertain soil parameters, making the slope reliability assessment closer to the engineering reality. However, multi-source information (including test data, monitored data, field observation and slope survival records) is rarely used in current probabilistic back-analysis. Conducting the probabilistic back-analysis of spatially varying soil parameters and slope reliability prediction under rainfalls by integrating multi-source information is a challenging task since thousands of random variables and high-dimensional likelihood function are usually involved. In this paper, a framework by integrating a modified Bayesian Updating with Subset simulation (mBUS) method with adaptive Conditional Sampling (aCS) algorithm is established for the probabilistic back-analysis of spatially varying soil parameters and slope reliability prediction. Within this framework, the high-dimensional probabilistic back-analysis problem can be easily tackled, and the multi-source information (e.g. monitored pressure heads and slope survival records) can be fully used in the back-analysis. A real Taoyuan landslide case in Taiwan, China is investigated to illustrate the effectiveness and performance of the established framework. The findings show that the posterior knowledge of soil parameters obtained from the established framework is in good agreement with the field observations. Furthermore, the updated knowledge of soil parameters can be utilized to reliably predict the occurrence probability of a landslide caused by the heavy rainfall event on September 12, 2004 or forecast the potential landslides under future rainfalls in the Fuhsing District of Taoyuan City, Taiwan, China.

Meta-model based sequential importance sampling method for structural reliability analysis under high dimensional small failure probability

Reliability analysis poses a significant challenge for complex structures with stringent reliability requirements. While Sequential Importance Sampling (SIS) and Subset Simulation (SUS) have proven highly effective in addressing high-dimensional problems with small failure probabilities, the computational burden of mechanical simulations remains substantial due to the time-consuming nature of numerical simulation processes. Consequently, this paper introduces a novel approach, denoted as AK-SIS, which combines SIS with Kriging metamodeling specifically designed to address computational challenges associated with small failure probabilities. The fundamental principle of this approach involves utilizing AK-MCS technology (Echard et al., 2011) [1] as a precursor to the SIS approach to initially generate metamodels. These metamodels are then employed in lieu of performance functions in subsequent steps, significantly reducing the number of function calls required to simulate complex engineering problems when applying SIS techniques directly. By inheriting the advantages of SIS, AK-SIS has demonstrated its suitability for reliability analysis in scenarios involving high-dimensional spaces and small fault probabilities. Furthermore, AK-SIS is not limited by the shape of the failure domain, eliminates the need to solve the design point, and is particularly well-suited for analyzing reliability in cases of discontinuous failure domains, multiple failure domains, as well as complex failure domains and rare events. The efficacy of AK-SIS is substantiated through rigorous evaluation encompassing nonlinear, high-dimensional examples, and an engineering application. These empirical validations collectively contribute to a robust methodological framework for reliability analysis of intricate structures characterized by stringent reliability requirements.

Linear Deconfounded Score Method: Scoring DAGs With Dense Unobserved Confounding.

This article deals with the discovery of causal relations from a combination of observational data and qualitative assumptions about the nature of causality in the presence of unmeasured confounding. We focus on applications where unobserved variables are known to have a widespread effect on many of the observed ones, which makes the problem particularly difficult for constraint-based methods, because most pairs of variables are conditionally dependent given any other subset, rendering the causal effect unidentifiable. In this article, we show that under the principle of independent mechanisms, unobserved confounding in this setting leaves a statistical footprint in the observed data distribution that allows for disentangling spurious and causal effects. Using this insight, we demonstrate that a sparse linear Gaussian directed acyclic graph (DAG) among observed variables may be recovered approximately and propose a simple adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems. We find, in addition, that despite the conditions we pose to guarantee causal recovery, performance in practice is robust to large deviations in model assumptions, and extensions to nonlinear structural models are possible.

Composing MPC With LQR and Neural Network for Amortized Efficiency and Stable Control

Model predictive control (MPC) is a powerful control method that handles dynamical systems with constraints. However, solving MPC iteratively in real time, i.e., implicit MPC, remains a computational challenge. To address this, common solutions include explicit MPC and function approximation. Both methods, whenever applicable, may improve the computational efficiency of the implicit MPC by several orders of magnitude. Nevertheless, explicit MPC often requires expensive pre-computation and does not easily apply to higher-dimensional problems. Meanwhile, function approximation, although scales better with dimension, still requires pre-training on a large dataset and generally cannot guarantee to find an accurate surrogate policy, the failure of which often leads to closed-loop instability. To address these issues, we propose a triple-mode hybrid control scheme, named Memory-Augmented MPC, by combining a linear quadratic regulator, a neural network, and an MPC. From its standard form, we derive two variants of such hybrid control scheme: one customized for chaotic systems and the other for slow systems. The proposed scheme does not require pre-computation and is capable of improving the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">amortized</i> running time of the composed MPC with a well-trained neural network. In addition, the scheme maintains closed-loop stability with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">any</i> neural networks of proper input and output dimensions, alleviating the need for certifying optimality of the neural network in safety-critical applications. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This article was motivated by the need to reduce the amortized cost of MPC in repetitive industrial robotic applications, where long-term operational cost is important and safety is critical. Examples of such applications include factory robotic arm manipulation and fixed-route quadcopter payload transport. Unlike explicit MPC or function approximation, our approach does not require any pre-computation or pre-training. Rather, it attains task proficiency over time by learning a surrogate neural network on the spot and by gradually replacing the costly MPC with the more efficient surrogate model so long as safety permits. Consequently, the proposed scheme incurs a learning cost during the initial phase of the deployment but usually becomes more adept on the task afterwards, leading to amortized efficiency.

Information theoretic clustering for coarse-grained modeling of non-equilibrium gas dynamics

We present a new framework towards the objective of learning coarse-grained models based on the maximum entropy principle. We show that existing methods for assigning clusters using the maximum entropy approach are heuristic or sub-optimal. We propose a machine learning framework informed by rate-distortion theory to learn optimal cluster assignments, aiming to improve the effectiveness of the coarse-graining process. Our approach involves transforming the discrete optimization problem into a probabilistic and continuous form. Our inverse modeling approach involves the development of a fully differentiable, adjoint-driven dynamics solver for use with gradient-based optimization techniques. The entire framework is end-to-end differentiable, facilitating backward pass gradient computation to flow through the ODE solve and probabilistic coarse-graining to train a classifier. We demonstrate application in the evolution of particle quantum states in non-equilibrium conditions. The high dimensionality of these equations poses a significant challenge for efficient and accurate computations, even for seemingly simple chemical systems. Training is performed using a loss function informed by rate-distortion theory to cluster the rovibrational states of some molecule, effectively forming a reduced order model of the master equations. We also introduce variable transformations along with several ways of improving the tractability of the training process. These allow the framework to process the extremely high-dimensional discrete optimization problem successfully. Our method is general, and to demonstrate the effectiveness in a controlled setting, we apply it to a one-dimensional Gaussian source quantization problem for which an analytical solution is known, followed by the problem of isothermal relaxation of a ▪ system with O(104) degrees of freedom.

Research on finance Credit Risk Quantification Model Based on Machine Learning Algorithm

Machine learning is a branch of artificial intelligence (AI) technology that enables systems to learn and make predictions and decisions without the need for explicit programming. Machine learning algorithms learn patterns and relationships from data and are able to gradually improve their accuracy.This paper mainly introduces the application of deep learning in financial academia and the financial industry, with a particular focus on the application of machine learning and deep learning in financial quantitative trading. The paper mentions the complexity and challenges of financial markets and the difficulties machine learning faces in processing financial time series data, such as overfitting, non-stationarity, heteroscedasticity and autocorrelation. To overcome these challenges, the paper explores machine learning model design in financial quantitative trading and risk prediction, including data transformation and model construction. In the related work part, it introduces the history and development of quantitative investment, as well as the application of quantitative investment, such as high-frequency trading, arbitrage strategy and commodity trading advisory strategy. It then focuses on the application of machine learning in financial quantification, including the use of supervised and unsupervised learning in stock price forecasting and trading strategy generation. The paper also compares traditional quantitative strategies with machine learning strategies and discusses the advantages of machine learning in solving high-dimensional and non-linear problems. The methodology section introduces the application of the random forest model in financial quantification, including the model principle, feature importance calculation and experimental design. Through the pre-processing, feature selection and model construction of the credit risk prediction dataset, the construction and evaluation process of the random forest model is demonstrated. Finally, the performance of the random forest model is evaluated and compared with other models to demonstrate its advantages and applicability in financial quantification.

Interpretable linear dimensionality reduction based on bias-variance analysis

One of the central issues of several machine learning applications on real data is the choice of the input features. Ideally, the designer should select a small number of the relevant, nonredundant features to preserve the complete information contained in the original dataset, with little collinearity among features. This procedure helps mitigate problems like overfitting and the curse of dimensionality, which arise when dealing with high-dimensional problems. On the other hand, it is not desirable to simply discard some features, since they may still contain information that can be exploited to improve results. Instead, dimensionality reduction techniques are designed to limit the number of features in a dataset by projecting them into a lower dimensional space, possibly considering all the original features. However, the projected features resulting from the application of dimensionality reduction techniques are usually difficult to interpret. In this paper, we seek to design a principled dimensionality reduction approach that maintains the interpretability of the resulting features. Specifically, we propose a bias-variance analysis for linear models and we leverage these theoretical results to design an algorithm, Linear Correlated Features Aggregation (LinCFA), which aggregates groups of continuous features with their average if their correlation is “sufficiently large”. In this way, all features are considered, the dimensionality is reduced and the interpretability is preserved. Finally, we provide numerical validations of the proposed algorithm both on synthetic datasets to confirm the theoretical results and on real datasets to show some promising applications.

Hybrid Sine Cosine and Particle Swarm Optimization Algorithm for High-Dimensional Global Optimization Problem and Its Application

Particle Swarm Optimization (PSO) is facing more challenges in solving high-dimensional global optimization problems. In order to overcome this difficulty, this paper proposes a novel PSO variant of the hybrid Sine Cosine Algorithm (SCA) strategy, named Velocity Four Sine Cosine Particle Swarm Optimization (VFSCPSO). The introduction of the SCA strategy in the velocity formulation ensures that the global optimal solution is found accurately. It increases the flexibility of PSO. A series of experiments are conducted on the CEC2005 test suite with compositional algorithms, algorithmic variants, and good intelligent algorithms. The experimental results show that the algorithm effectively improves the overall performance of compositional algorithms; the Friedman test proves that the algorithm has good competitiveness. The algorithm also performs better in PID parameter tuning. Therefore, the VFSCPSO is able to solve the high-dimensional global optimization problems in a better way.

No Prior Mask: Eliminate Redundant Action for Deep Reinforcement Learning

The large action space is one fundamental obstacle to deploying Reinforcement Learning methods in the real world. The numerous redundant actions will cause the agents to make repeated or invalid attempts, even leading to task failure. Although current algorithms conduct some initial explorations for this issue, they either suffer from rule-based systems or depend on expert demonstrations, which significantly limits their applicability in many real-world settings. In this work, we examine the theoretical analysis of what action can be eliminated in policy optimization and propose a novel redundant action filtering mechanism. Unlike other works, our method constructs the similarity factor by estimating the distance between the state distributions, which requires no prior knowledge. In addition, we combine the modified inverse model to avoid extensive computation in high-dimensional state space. We reveal the underlying structure of action spaces and propose a simple yet efficient redundant action filtering mechanism named No Prior Mask (NPM) based on the above techniques. We show the superior performance of our method by conducting extensive experiments on high-dimensional, pixel-input, and stochastic problems with various action redundancy tasks. Our code is public online at https://github.com/zhongdy15/npm.

Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees

Projection-free online learning has drawn increasing interest due to its efficiency in solving high-dimensional problems with complicated constraints. However, most existing projection-free online methods focus on minimizing the static regret, which unfortunately fails to capture the challenge of changing environments. In this paper, we investigate non-stationary projection-free online learning, and choose dynamic regret and adaptive regret to measure the performance. Specifically, we first provide a novel dynamic regret analysis for an existing projection-free method named BOGD_IP, and establish an O(T^¾ (1+P_T)) dynamic regret bound, where P_T denotes the path-length of the comparator sequence. Then, we improve the upper bound to O(T^¾ (1+P_T)^¼) by running multiple BOGD_IP algorithms with different step sizes in parallel, and tracking the best one on the fly. Our results are the first general-case dynamic regret bounds for projection-free online learning, and can recover the existing O(T^¾) static regret by setting P_T = 0. Furthermore, we propose a projection-free method to attain an O(?^¾) adaptive regret bound for any interval with length ?, which nearly matches the static regret over that interval. The essential idea is to maintain a set of BOGD_IP algorithms dynamically, and combine them by a meta algorithm. Moreover, we demonstrate that it is also equipped with an O(T^¾ (1+P_T)^¼) dynamic regret bound. Finally, empirical studies verify our theoretical findings.

CMNet: deep learning model for colon polyp segmentation based on dual-branch structure.

Colon cancer is one of the top three diseases in gastrointestinal cancers, and colon polyps are an important trigger of colon cancer. Early diagnosis and removal of colon polyps can avoid the incidence of colon cancer. Currently, colon polyp removal surgery is mainly based on artificial-intelligence (AI) colonoscopy, supplemented by deep-learning technology to help doctors remove colon polyps. With the development of deep learning, the use of advanced AI technology to assist in medical diagnosis has become mainstream and can maximize the doctor's diagnostic time and help doctors to better formulate medical plans. We propose a deep-learning model for segmenting colon polyps. The model adopts a dual-branch structure, combines a convolutional neural network (CNN) with a transformer, and replaces ordinary convolution with deeply separable convolution based on ResNet; a stripe pooling module is introduced to obtain more effective information. The aggregated attention module (AAM) is proposed for high-dimensional semantic information, which effectively combines two different structures for the high-dimensional information fusion problem. Deep supervision and multi-scale training are added in the model training process to enhance the learning effect and generalization performance of the model. The experimental results show that the proposed dual-branch structure is significantly better than the single-branch structure, and the model using the AAM has a significant performance improvement over the model not using the AAM. Our model leads 1.1% and 1.5% in mIoU and mDice, respectively, when compared with state-of-the-art models in a fivefold cross-validation on the Kvasir-SEG dataset. We propose and validate a deep learning model for segmenting colon polyps, using a dual-branch network structure. Our results demonstrate the feasibility of complementing traditional CNNs and transformer with each other. And we verified the feasibility of fusing different structures on high-dimensional semantics and successfully retained the high-dimensional information of different structures effectively.

Surrogate-assisted differential evolution using manifold learning-based sampling for high- dimensional expensive constrained optimization problems

To address the challenges of high-dimensional constrained optimization problems with expensive simulation models, a Surrogate-Assisted Differential Evolution using Manifold Learning-based Sampling (SADE-MLS) is proposed. In SADE-MLS, differential evolution operators are executed to generate numerous high-dimensional candidate points. To alleviate the curse of dimensionality, a Manifold Learning-based Sampling (MLS) mechanism is developed to explore the high-dimensional design space effectively. In MLS, the intrinsic dimensionality of the candidate points is determined by a maximum likelihood estimator. Then, the candidate points are mapped into a low-dimensional space using the dimensionality reduction technique, which can avoid significant information loss during dimensionality reduction. Thus, Kriging surrogates are constructed in the low-dimensional space to predict the responses of the mapped candidate points. The candidate points with high constrained expected improvement values are selected for global exploration. Moreover, the local search process assisted by radial basis function and differential evolution is performed to exploit the design space efficiently. Several numerical benchmarks are tested to compare SADE-MLS with other algorithms. Finally, SADE-MLS is successfully applied to a solid rocket motor multidisciplinary optimization problem and a re-entry vehicle aerodynamic optimization problem, with the total impulse and lift to drag ratio being increased by 32.7% and 35.5%, respectively. The optimization results demonstrate the practicality and effectiveness of the proposed method in real engineering practices.

Optimization of wind‐wave hybrid system based on wind‐wave coupling model

AbstractThe integration of wave energy converters (WECs) into floating offshore wind turbine (FOWT) can effectively reduce costs and increase power generation. When WECs are integrated into FOWT, the hydrodynamic interference, motion coupling, and other factors contribute to the high spatial dimension of the coupled optimization, making it difficult to find the globally optimal solution. Therefore, this study proposes an optimization method based on a wind‐wave coupling model, and takes a new wind‐wave hybrid system as an example for verification and analysis. First, the experimental design is completed through random sampling, and the corresponding WECs and wind turbine power of each sample point are calculated using full coupling simulation. And then according to the design input and simulation results, the wind‐wave coupling model is obtained by training the elliptical basis functions neural network (EBFNN). At last, based on this model, the non‐dominated sorting genetic algorithm II (NSGA‐II) is used to optimize the WECs microarray. The results show that the prediction model established in this paper has high accuracy and is used with the NSGA‐II to effectively improve the wind‐wave coupling energy harvesting. This method can effectively solve the problem of high coupling dimensions in the process of hybrid system design.

A simple, efficient and versatile objective space algorithm for multiobjective integer programming

In the last years a multitude of algorithms have been proposed to solve multiobjective integer programming problems. However, only few authors offer open-source implementations. On the other hand, new methods are typically compared to code that is publicly available, even if this code is known to be outperformed. In this paper, we aim to overcome this problem by proposing a new state-of-the-art algorithm with an open-source implementation in C++. The underlying method falls into the class of objective space methods, i.e., it decomposes the overall problem into a series of scalarized subproblems that can be solved with efficient single-objective IP-solvers. It keeps the number of required subproblems small by avoiding redundancies, and it can be combined with different scalarizations that all lead to comparably simple subproblems. Our algorithm bases on previous results but combines them in a new way. Numerical experiments with up to ten objectives validate that the method is efficient and that it scales well to higher dimensional problems.

Construction of fuzzy classification systems by fitness sharing based genetic search and boosting based ensemble

This paper concentrates on the development of precise fuzzy rule-based classification systems for high-dimensional and multi-class problems. The approach begins with the extraction on potential fuzzy if-then rules using fitness sharing based genetic algorithms, this ensures effective searching for productive niches, thereby evolving and maintaining a diverse, cooperative population. Subsequently, for the purpose of combining the obtained fuzzy rules and eliminating their conflicts, an adaboost ensemble method is utilized, enhancing the accuracy of the fuzzy classification systems.Experiments have been conducted on 10 UCI datasets and 3 well-known image classification problems. The features for these image tasks were derived from the activation values of the final convolutional layer in pre-trained convolutional neural networks. These datasets, which were chosen to evaluate the effectiveness of the proposed approach, exhibit significant variation in terms of dimensionality and the number of class labels. Comparative analyses are carried out with conventional fuzzy rule-based classification methods, and the results demonstrate that the classification systems can be developed for complex problems, while maintaining a high-level of prediction accuracy.