The geometry of three-way decision

Evaluation of emotional dynamics in social media conversations: an approach based on structures of opposition and set-theoretic measures

The paper presents the results related to the definition and adoption of structures of opposition, built with set-theoretic measures, to evaluate emotional dynamics that arise during conversations on social media. Specifically, a graded hexagon of opposition is used to compare the emotional profiles of individuals involved in a dyadic conversation. Set-theoretic measures, based on fuzzy logic, are used to construct the hexagon whose analysis allows us to understand the tendency of the conversation toward empathy or lack of empathy. The results can be useful in the context of the current trend of social media sensing and, in particular, to support social media providers in receiving early warnings related to the analysis of emotional dynamics that could lead to or degenerate into information disorder. The results have been evaluated with conversations extracted from the Empathetic Dialogue dataset.

Network rule extraction under the network formal context based on three-way decision

Knowledge discovery combined with network structure is an emerging field of network data analysis and mining. Three-way concept analysis is a method that can fit the human mind in uncertain decisions and analysis. In reality, when three-way concept analysis is placed in the background of a network, not only the three-way rules need to be obtained, but also the network characteristic values of these rules should be obtained, which is of great significance for concept cognition in the network. This paper mainly combines complex network analysis with the formal context of three-way decision. Firstly, the network formal context of three-way decision (NFC3WD) is proposed to unify the two studies mentioned above into one data framework. Then, the network weaken-concepts of three-way decision (NWC3WD) and their corresponding sub-networks are studied. Therefore, we can not only find out the network weaken-concepts but also know the average influence of the sub-network, as well as the influence difference within the sub-network. Furthermore, the concept logic of network and the properties of its operators are put forward, which lays a foundation for designing the algorithm of rule extraction. Subsequently, the bidirectional rule extraction algorithm and reduction algorithm based on confidence degree are also explored. Meanwhile, these algorithms are applied to the diagnosis examples of COVID-19 from which we can not only get diagnostic rules, but also know the importance of the population corresponding to these diagnostic rules in the network through network eigenvalues. Finally, experimental analysis is made to show the superiority of the proposed method.

Accelerating Update of Variable Precision Multigranulation Approximations While Adding Granular Structures

In multigranulation environments, variable precision multigranulation rough set (VPMGRS) is a useful framework that has a tolerance for errors. Approximations are basic concepts for knowledge acquisition and attribute reductions. Accelerating update of approximations can enhance the efficiency of acquiring decision rules by utilizing previously saved information. In this study, we focus on exploiting update mechanisms of approximations in VPMGRS with the addition of granular structures. By analyzing the basic changing trends of approximations in VPMGRS, we develop accelerating update mechanisms for acquiring approximations. In addition, an incremental algorithm to update variable precision multigranulation approximations is proposed when adding multiple granular structures. Finally, extensive comparisons elaborate the efficiency of the incremental algorithm.

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.