Publications

A Two-Stage Approach for Constructing Type-2 Information Granules

In this article, we are concerned with the formation of type-2 information granules in a two-stage approach. We present a comprehensive algorithmic framework which gives rise to information granules of a higher type (type-2, to be specific) such that the key structure of the local granular data, their topologies, and their diversities become fully reflected and quantified. In contrast to traditional collaborative clustering where local structures (information granules) are obtained by running algorithms on the local datasets and communicating findings across sites, we propose a way of characterizing granular data (formed) by forming a suite of higher type information granules to reveal an overall structure of a collection of locally available datasets. Information granules built at the lower level on a basis of local sources of data are weighted by the number of data they represent while the information granules formed at the higher level of hierarchy are more abstract and general, thus facilitating a formation of a hierarchical description of data realized at different levels of detail. The construction of information granules is completed by resorting to fuzzy clustering algorithms (more specifically, the well-known Fuzzy C-Means). In the formation of information granules, we follow the fundamental principle of granular computing, viz., the principle of justifiable granularity. Experimental studies concerning selected publicly available machine-learning datasets are reported.

IEEE Systems, Man, and Cybernetics Society Information

Distributed Event-Triggered Algorithm with Network Independent Step-Size for Constraint-Coupled Optimization Problems

In this study, we introduce a distributed algorithm that is specifically designed to address optimization problems featuring a decomposable objective function and equality constraints. To minimize the amount of communication required, we incorporate an event-triggered mechanism that enables information exchange only when variable values exceed predefined thresholds. Importantly, our proposed algorithm possesses a distinctive characteristic where the determination of step size is solely based on the properties of the objective function, regardless of the structure of the communication network. Even in situations where changes occur in the network structure, our algorithm remains valid without necessitating any updates to its step size. Assuming strong convexity and smoothness in local objective functions, along with appropriate event-triggered thresholds, our algorithm achieves a convergence rate that is linear. Several numerical experiments provide evidence supporting the effectiveness and superiority of our proposed approach.

Collaborative Fuzzy Clustering Algorithms: Some Refinements and Design Guidelines

There are some variants of the widely used Fuzzy C-Means (FCM) algorithm that support clustering data distributed across different sites. Those methods have been studied under different names, like collaborative and parallel fuzzy clustering. In this study, we offer some augmentation of the two FCM-based clustering algorithms used to cluster distributed data by arriving at some constructive ways of determining essential parameters of the algorithms (including the number of clusters) and forming a set of systematically structured guidelines such as a selection of the specific algorithm depending on the nature of the data environment and the assumptions being made about the number of clusters. A thorough complexity analysis, including space, time, and communication aspects, is reported. A series of detailed numeric experiments is used to illustrate the main ideas discussed in the study.

Multicriteria decision making under conditions of uncertainty in application to multiobjective allocation of resources

Contemporary Fuzzy Logic

Conjunctive and Disjunctive Combination Rules in Random Permutation Set Theory: A Layer-2 Belief Structure Perspective

A new classifier for imbalanced data with iterative learning process and ensemble operating process

Granular structure-based incremental updating for multi-label classification

Identification of fuzzy models using a successive tuning method with a variant identification ratio

Fuzzy Multicriteria Decision‐Making

A new effective approximate multiplication operation on LR fuzzy numbers and its application

MAGDM Framework Based on Double Hierarchy Bipolar Hesitant Fuzzy Linguistic Information and Its Application to Optimal Selection of Talents

Choquet Integral-Based Aggregation for the Analysis of Anomalies Occurrence in Sustainable Transportation Systems

Anomaly detection is one of the most important problems of modern data science due to the threat to the security of information systems as well as their users. This applies in particular to logistic data, which is used to predict costs, times, and organization of travel routes. Data anomalies may endanger the welfare and safety of transport users, goods, handling companies, and consumers. Moreover, they contribute to the overexploitation of the natural environment. Therefore, it is extremely important to find methods that are responsible for their effective detection. The desired approach may be the Choquet integral and its extensions, which in various applications have proven that with their help it is possible to efficiently increase the quality of the classification measured, for example, with the help of the accuracy. Due to the fact that the Choquet integral is resistant to data fluctuations and takes into account the quality (significance) of the information source, it appears to be an effective proposition for the final determination of what data, or more precisely, which records can be considered anomalous. The innovative approach to analyze transport data has not been used before. This article considers four publicly available databases covering different fields of application of transport systems. In a series of comprehensive numerical experiments, the Choquet integral-based approach has proven high efficiency for each of them. Moreover, we made a comparative analysis of the solutions before applying the Choquet integral and the results after its application.

Semantical Stability of Information Granules

Granular transfer learning

Data granulation through optimization of similarity measure

A Multimodel Prediction Method for Dynamic Multiobjective Evolutionary Optimization

A large number of prediction strategies are specific to a dynamic multiobjective optimization problem (DMOP) with only one type of the Pareto set (PS) change. However, a continuous DMOP with more than one type of the unknown PS change has been seldom investigated. We present a multimodel prediction approach (MMP) realized in the framework of evolutionary algorithms (EAs) to tackle the problem. In this paper, we first detect the type of the PS change, followed by the selection of an appropriate prediction model to provide an initial population for the subsequent evolution. To observe the influence of MMP on EAs, optimal solutions obtained by three classical dynamic multiobjective EAs with and without MMP are investigated. Furthermore, to investigate the performance of MMP, three state-of-the-art prediction strategies are compared on a large number of dynamic test instances under the same particle swarm optimizer. The experimental results demonstrate that the proposed approach outperforms its counterparts under comparison on most optimization problems.