MD-SPKM: A set pair k-modes clustering algorithm for incomplete categorical matrix data

In order to solve the clustering problem with incomplete and categorical matrix data sets, and considering the uncertain relationship between samples and clusters, a set pair k-modes clustering algorithm is proposed (MD-SPKM). Firstly, the correlation theory of set pair information granule is introduced into k-modes clustering. By improving the distance formula of traditional k-modes algorithm, a set pair distance measurement method between incomplete matrix samples is defined. Secondly, considering the uncertain relationship between the sample and the cluster, the definition of the intra-cluster average distance and the threshold calculation formula to determine whether the sample belongs to multiple clusters is given, and then the result of set pair clustering is formed, which includes positive region, boundary region and negative region. Finally, through the selected three data sets and four contrast algorithms for experimental evaluation, the experimental results show that the set pair k-modes clustering algorithm can effectively handle incomplete categorical matrix data sets, and has good clustering performance in Accuracy, Recall, ARI and NMI.

Fuzzy Knowledge Distance with Three-Layer Perspectives in Neighborhood System

Information granule is the basic element in granular computing (GrC), and it can be obtained according to the granulation criterion. In neighborhood rough sets, current uncertainty measures focus on computing the knowledge granulation of single granular space and have two main limitations: (i) neglecting the structural information of boundary regions and (ii) the inability to reflect the difference between neighborhood granular spaces with the same uncertainty for approximating a target concept. Firstly, a fuzziness-based uncertainty measure for neighborhood rough sets is introduced to characterize the structural information of boundary regions. Moreover, from the perspective of distance, based on the idea of density peaks, we present a fuzzy-neighborhood-granule-distance- (FNGD-) based method to discover the relationship between granules in a granular space. Then, to characterize the difference between granular spaces for approximating a target concept, we present the fuzzy neighborhood granular space distance (FNGSD) and fuzzy neighborhood boundary region distance (FNBRD). FNGD, FNGSD, and FNBRD are hierarchically organized from fineness to coarseness according to the semantics of granularity, which provide three-layer perspectives in the neighborhood system.

Feature Selection Using Approximate Conditional Entropy Based on Fuzzy Information Granule for Gene Expression Data Classification

Classification is widely used in gene expression data analysis. Feature selection is usually performed before classification because of the large number of genes and the small sample size in gene expression data. In this article, a novel feature selection algorithm using approximate conditional entropy based on fuzzy information granule is proposed, and the correctness of the method is proved by the monotonicity of entropy. Firstly, the fuzzy relation matrix is established by Laplacian kernel. Secondly, the approximately equal relation on fuzzy sets is defined. And then, the approximate conditional entropy based on fuzzy information granule and the importance of internal attributes are defined. Approximate conditional entropy can measure the uncertainty of knowledge from two different perspectives of information and algebra theory. Finally, the greedy algorithm based on the approximate conditional entropy is designed for feature selection. Experimental results for six large-scale gene datasets show that our algorithm not only greatly reduces the dimension of the gene datasets, but also is superior to five state-of-the-art algorithms in terms of classification accuracy.

Performance Index of Incremental Granular Model with Information Granule of Linguistic Intervals and Its Application

This paper addresses the performance index (PI) of an incremental granular model (IGM) with information granules of linguistic intervals. For this purpose, IGM is designed by combining a linear regression (LR) and an interval-based granular model (GM). The fundamental scheme of IGM construction comprises two essential phases: (1) development of LR as a basic model and (2) design of a local granular model, which attempts to reduce errors obtained by the LR model. Here, the local interval-based GM is based on an interval-based fuzzy clustering algorithm, which is materialized by information granulations. The PI of IGM is calculated by multiplying the coverage with specificity property, because the output of IGM is not a numerical value but a linguistic interval value. From the concept of coverage and specificity, we can construct information granules; thus, it is justified by the available experimental proof and presented as clearly defined semantics. To validate the PI method, an experiment is conducted on concrete compressive strength for civil engineering applications. The experimental results confirm that the PI of IGM is an effective performance evaluation method.

The structure and dynamics of granular complex networks deriving from financial time series

High noise and strong volatility are the typical characteristics of financial time series. Combined with pseudo-randomness, nonsteady and self-similarity exhibiting in different time scales, it is a challenging issue for the pattern analysis of financial time series. Different from the existing works, in this paper, financial time series are converted into granular complex networks, based on which the structure and dynamics of network models are revealed. By using variable-length division, an extended polar fuzzy information granule (FIGs) method is used to construct granular complex networks from financial time series. Considering the temporal characteristics of sequential data, static networks and temporal networks are studied, respectively. As to the static network model, some features of topological structures of granular complex networks, such as distribution, clustering and betweenness centrality are discussed. Besides, by using the Markov chain model, the transfer processes among different granules are investigated, where the fluctuation pattern of data in the coming step can be evaluated from the transfer probability of two consecutive granules. Shanghai composite index and foreign exchange data as two examples in real life are applied to carry out the related discussion.