Fuzzy C-Means (FCM) is a clustering algorithm based on partition of the universe. However, the partition generated by an equivalence relation is strict in practical application and exhibits relatively poor fault-tolerant mechanism. In this paper, a novel binary relation based on improved FCM with the principle of refined justifiable granularity is presented. Different expressions of the proposed binary relation under different values of weight parameter are discussed, and the changes of the properties of the binary relation under different parameter values are provided. By measuring the significance of attributes in the feature space, a feature selection method, called forward heuristic feature selection (FHFS), is designed to construct the low-dimension feature space based on maximizing the original data and information retention through the defined degrees of aggregation and dispersion. It is shown how the results of feature selection and classification performance vary when the values of the weight factor locate in different ranges. To illustrate the superiority and effectiveness of the proposed FHFS algorithm, nine high-dimensional datasets and eight image datasets from UCI repository are used and compared with other feature selection methods, respectively. The results of experimental evaluation and the significance test show that the proposed learning mechanism is a superior algorithm.
Most exiting results for impulsive switched systems (ISSs) are mainly built on the synchronous switching and impulses case; however, the impulses can not only occur in switched interval including switched instants but also the switched signals may exist between two impulsive points in practical instants. Under asynchronous impulses and switching signals, the main objective of this article is to study the exponential stability of fractional-order hybrid systems. In order to better characterize stability, some novel criteria are presented by adopting the mode-dependent average impulsive interval and induction method. The obtained impulsive switched criteria lead to a tradeoff between fractional-order $\alpha $ and impulsive strength. Especially, the impulsive effects (positive or negative) with the order $\alpha $ are also discussed in detail, which extends the previous integer order results. Moreover, numerical examples are given to interpret and verify the effectiveness of the obtained criteria.
26 September 2023 in IEEE Transactions on Artificial Intelligence
Double-quantitative-based granular computing implies the systematic perspective, completeness and accuracy of rough approximation. However, most of existing researches only focus on the case of single quantification, and there are few research study on the simultaneous computing method of double quantification. In this paper, we explore feature selection with double quantification in multi-granularity ordered decision systems (MG-ODSs). Firstly, the related concepts of quantitative functions are interpreted from different viewpoints of relative and absolute quantification. Then, the multi-granularity double-quantitative rough sets in an ordered decision system (ODS) from optimistic and pessimistic cases, the related properties, and three-way decisions based on the presented quantitative levels are discussed. Furthermore, the greedy algorithm for feature selection is derived. By using twelve datasets from public repository, evaluations and comparisons are made on the parameter setting and classification accuracy. From these comparative experiments, advantages and effectiveness of the proposed feature selection algorithm could be demonstrated over the existing approaches.
4 July 2019 in International Journal of Robust and Nonlinear Control
Classical clustering algorithms such as k-means face limitations in handling clusters with heterogeneous shapes, densities, and sizes, while exhibiting sensitivity to initial centroid selection. To overcome these challenges, this article proposes a novel clustering framework based on regenerated granular ball (RGGB) with the principle of justifiable granularity. Unlike existing granular-ball (GB) techniques that overemphasize purity criteria at the expense of uncontrolled ball sizes, RGGB dynamically adjusts granularity levels through iterative regeneration, achieving an optimal balance between detailed data representation and computational efficiency. This adaptability enhances stability in capturing data similarities while mitigating sensitivity to initialization. To validate the method, we integrate RGGB with a novel k-nearest neighbor (KNN) classifier using regenerated GBs to evaluate classification performance and demonstrate practical applications. Experiments on diverse public and realistic datasets demonstrate that the RGGB-based KNN algorithm consistently outperforms existing techniques, including traditional KNN and other methods, making a promising advancement in clustering and classification tasks.
11 August 2023 in International Journal of Fuzzy Systems