Towards Discovery of Relevant Patterns from Parameterized Schemes of Information Granule Construction

Author(s):  
Andrzej Skowron ◽  
Jarosław Stepaniuk ◽  
James F. Peters
Keyword(s):  
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Fan Zhao ◽  
Shuai Li ◽  
Wei Zhou

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.


2021 ◽  
Vol 25 (6) ◽  
pp. 1507-1524
Author(s):  
Chunying Zhang ◽  
Ruiyan Gao ◽  
Jiahao Wang ◽  
Song Chen ◽  
Fengchun Liu ◽  
...  

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.


Author(s):  
Andrzej Skowron ◽  
Jaroslaw Stepaniuk ◽  
James F. Peters
Keyword(s):  

2020 ◽  
Vol 31 (06) ◽  
pp. 2050087
Author(s):  
Li Tingting ◽  
Luo Chao ◽  
Shao Rui

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.


Author(s):  
Wei Zhao ◽  
Hongyu Li ◽  
Gue Gu ◽  
Xiuzhen Wang ◽  
Guohui Zhou ◽  
...  

2014 ◽  
Vol 496-500 ◽  
pp. 2256-2259
Author(s):  
Zhen Dong Mu ◽  
Jian Feng Hu ◽  
Jing Hai Yin

EEG is a complex signal source, feature extraction and classification algorithm was studied for the brain electrical signal is also a key point in the research of brain waves, information granule clustering algorithm is one of the main idea, at the same time, the partial least square method is an effective method of dimension reduction, this paper, the use of information granule and partial least squares analysis of visual evoked potential EEG signals, the results show that this method can effectively extract the characteristics.


Sign in / Sign up

Export Citation Format

Share Document