Neighborhood rough set-based three-way clustering considering attribute correlations: An approach to classification of potential gout groups

Three-way decisions in generalized intuitionistic fuzzy environments: survey and challenges

Enhancing decision-making under risks is crucial in various fields, and three-way decision (3WD) methods have been extensively utilized and proven to be effective in numerous scenarios. However, traditional methods may not be sufficient when addressing intricate decision-making scenarios characterized by uncertain and ambiguous information. In response to this challenge, the generalized intuitionistic fuzzy set (IFS) theory extends the conventional fuzzy set theory by introducing two pivotal concepts, i.e., membership degrees and non-membership degrees. These concepts offer a more comprehensive means of portraying the relationship between elements and fuzzy concepts, thereby boosting the ability to model complex problems. The generalized IFS theory brings about heightened flexibility and precision in problem-solving, allowing for a more thorough and accurate description of intricate phenomena. Consequently, the generalized IFS theory emerges as a more refined tool for articulating fuzzy phenomena. The paper offers a thorough review of the research advancements made in 3WD methods within the context of generalized intuitionistic fuzzy (IF) environments. First, the paper summarizes fundamental aspects of 3WD methods and the IFS theory. Second, the paper discusses the latest development trends, including the application of these methods in new fields and the development of new hybrid methods. Furthermore, the paper analyzes the strengths and weaknesses of research methods employed in recent years. While these methods have yielded impressive outcomes in decision-making, there are still some limitations and challenges that need to be addressed. Finally, the paper proposes key challenges and future research directions. Overall, the paper offers a comprehensive and insightful review of the latest research progress on 3WD methods in generalized IF environments, which can provide guidance for scholars and engineers in the intelligent decision-making field with situations characterized by various uncertainties.

Research on SPDTRS-PNN based intelligent assistant diagnosis for breast cancer

Breast cancer is the second dangerous cancer in the world. Breast cancer data often contains more redundant information. Redundant information makes the breast cancer auxiliary diagnosis less accurate and time consuming. Dimension reduction algorithm combined with machine learning can solve these problems well. This paper proposes the single parameter decision theoretic rough set (SPDTRS) combined with the probability neural network (PNN) model for breast cancer diagnosis. We find that when the parameter value of SPDTRS is 2.5 and the SPREAD value is 0.75, the number of 30 attributes of the original breast cancer data dropped to 12, the accuracy of the SPDTRS-PNN model training set is 99.25%, the accuracy of the test set is 97.04%, and the test time is 0.093 s. The experimental results show that the SPDTRS-PNN model can improve the ac-curacy of breast cancer recognition, reduce the time required for diagnosis.

New constructions of decision evaluation functions in three-way decision spaces based on uninorms

In 2014, Hu introduced the concept of three-way decision spaces and axiomatic definition of decision evaluation functions. In three-way decision spaces, decision evaluation function satisfies minimum element axiom, monotonicity axiom and complement axiom. Since then, the research on construction method of decision evaluation functions from commonly used binary aggregation functions becomes a research hotspot. Meanwhile, uninorms, as one class of binary aggregation functions, have been successfully applied in various application problems, such as in decision making, image processing, data mining, etc. This paper continues to consider this research topic and mainly explores the new construction methods of decision evaluation functions based on uninorms. Firstly, we show two novel transformation methods from semi-decision evaluation functions to decision evaluation functions based on uninorms. Secondly, using known semi-decision evaluation functions, we give some new construction methods of semi-decision evaluation functions. Thirdly, we give some novel construction methods of decision evaluation functions and semi-decision evaluation functions related to fuzzy sets, interval-valued fuzzy sets, fuzzy relations and hesitant fuzzy sets. Based on them, decision maker can obtain more useful decision evaluation functions, thereby more choices can be used for realistic decision-making problems. Finally, we consider two real evaluation problems to illustrate the results obtained in this paper. The three-way decisions results of evaluation problem show that the construction method proposed in this paper is superior to some existing construction methods under some conditions.

Attribute Reduction Based on Lift and Random Sampling

As one of the key topics in the development of neighborhood rough set, attribute reduction has attracted extensive attentions because of its practicability and interpretability for dimension reduction or feature selection. Although the random sampling strategy has been introduced in attribute reduction to avoid overfitting, uncontrollable sampling may still affect the efficiency of search reduct. By utilizing inherent characteristics of each label, Multi-label learning with Label specIfic FeaTures (Lift) algorithm can improve the performance of mathematical modeling. Therefore, here, it is attempted to use Lift algorithm to guide the sampling for reduce the uncontrollability of sampling. In this paper, an attribute reduction algorithm based on Lift and random sampling called ARLRS is proposed, which aims to improve the efficiency of searching reduct. Firstly, Lift algorithm is used to choose the samples from the dataset as the members of the first group, then the reduct of the first group is calculated. Secondly, random sampling strategy is used to divide the rest of samples into groups which have symmetry structure. Finally, the reducts are calculated group-by-group, which is guided by the maintenance of the reducts’ classification performance. Comparing with other 5 attribute reduction strategies based on rough set theory over 17 University of California Irvine (UCI) datasets, experimental results show that: (1) ARLRS algorithm can significantly reduce the time consumption of searching reduct; (2) the reduct derived from ARLRS algorithm can provide satisfying performance in classification tasks.

Three-Way Ensemble Clustering Based on Sample’s Perturbation Theory

The complexity of the data type and distribution leads to the increase in uncertainty in the relationship between samples, which brings challenges to effectively mining the potential cluster structure of data. Ensemble clustering aims to obtain a unified cluster division by fusing multiple different base clustering results. This paper proposes a three-way ensemble clustering algorithm based on sample’s perturbation theory to solve the problem of inaccurate decision making caused by inaccurate information or insufficient data. The algorithm first combines the natural nearest neighbor algorithm to generate two sets of perturbed data sets, randomly extracts the feature subsets of the samples, and uses the traditional clustering algorithm to obtain different base clusters. The sample’s stability is obtained by using the co-association matrix and determinacy function, and then the samples can be divided into a stable region and unstable region according to a threshold for the sample’s stability. The stable region consists of high-stability samples and is divided into the core region of each cluster using the K-means algorithm. The unstable region consists of low-stability samples and is assigned to the fringe regions of each cluster. Therefore, a three-way clustering result is formed. The experimental results show that the proposed algorithm in this paper can obtain better clustering results compared with other clustering ensemble algorithms on the UCI Machine Learning Repository data set, and can effectively reveal the clustering structure.

An Improved Three-Way Clustering Based on Ensemble Strategy

As a powerful data analysis technique, clustering plays an important role in data mining. Traditional hard clustering uses one set with a crisp boundary to represent a cluster, which cannot solve the problem of inaccurate decision-making caused by inaccurate information or insufficient data. In order to solve this problem, three-way clustering was presented to show the uncertainty information in the dataset by adding the concept of fringe region. In this paper, we present an improved three-way clustering algorithm based on an ensemble strategy. Different to the existing clustering ensemble methods by using various clustering algorithms to produce the base clustering results, the proposed algorithm randomly extracts a feature subset of samples and uses the traditional clustering algorithm to obtain the diverse base clustering results. Based on the base clustering results, labels matching is used to align all clustering results in a given order and voting method is used to obtain the core region and the fringe region of the three way clustering. The proposed algorithm can be applied on the top of any existing hard clustering algorithm to generate the base clustering results. As examples for demonstration, we apply the proposed algorithm on the top of K-means and spectral clustering, respectively. The experimental results show that the proposed algorithm is effective in revealing cluster structures.

Research on complex attribute big data classification based on iterative fuzzy clustering algorithm

In order to overcome the low classification accuracy of traditional methods, this paper proposes a new classification method of complex attribute big data based on iterative fuzzy clustering algorithm. Firstly, principal component analysis and kernel local Fisher discriminant analysis were used to reduce dimensionality of complex attribute big data. Then, the Bloom Filter data structure is introduced to eliminate the redundancy of the complex attribute big data after dimensionality reduction. Secondly, the redundant complex attribute big data is classified in parallel by iterative fuzzy clustering algorithm, so as to complete the complex attribute big data classification. Finally, the simulation results show that the accuracy, the normalized mutual information index and the Richter’s index of the proposed method are close to 1, the classification accuracy is high, and the RDV value is low, which indicates that the proposed method has high classification effectiveness and fast convergence speed.