CE3: A three-way clustering method based on mathematical morphology

被引:136
作者
Wang, Pingxin [1 ,2 ,3 ]
Yao, Yiyu [2 ]
机构
[1] Jiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212003, Jiangsu, Peoples R China
[2] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
[3] Hebei Normal Univ, Coll Math & Informat Sci, Shijiazhuang 050024, Hebei, Peoples R China
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词
Three-way clustering; Three-way decision; Mathematics morphology; Contraction; Expansion; THEORETIC ROUGH SET; DECISION-MAKING; FUZZY; WEB; GRANULATION; MODEL;
D O I
10.1016/j.knosys.2018.04.029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many existing clustering methods produce clusters with clear and sharp boundaries, which does not truly reflect the fact that a cluster may not necessarily have a well-defined boundary in many real world situations. In this paper, by combining ideas of erosion and dilation from mathematical morphology and principles of three-way decision, we propose a framework of a contraction-and-expansion based three-way clustering called CE3. A three-way cluster is defined by a nested pair of sets called the core and the support of the cluster, respectively. A stronger relationship holds between objects in the core and a weaker relationship holds between objects in the support. Given a cluster obtained from a hard clustering method, CE3 uses a contraction operation to shrink the cluster into the core of a three-way cluster and uses an expansion operation to enlarge the cluster into the support. The difference between the support and the core is called the fringe region, representing an unsharp boundary of a cluster. Within the CE3 framework, we can define different types of contraction and expansion operations. We can apply the CE3 framework on the top of any existing clustering method. As examples for demonstration, we introduce a pair of neighbor-based contraction and expansion operations and apply the CE3 framework on the top of k-means and spectral clustering, respectively. We use one synthetic data set, five UCI data sets, and three USPS data sets to evaluate experimentally the performance of CE3. The results show that CE3 is in fact effective in revealing cluster structures.
引用
收藏
页码:54 / 65
页数:12
相关论文
共 68 条
[1]   A three-way clustering approach for handling missing data using GTRS [J].
Afridi, Mohammad Khan ;
Azam, Nouman ;
Yao, JingTao ;
Alanazi, Eisa .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 98 :11-24
[2]  
[Anonymous], GLOB TEL C GLOBECOM
[3]   Some Relationships Between Fuzzy Sets, Mathematical Morphology, Rough Sets, F-Transforms, and Formal Concept Analysis [J].
Atif, Jamal ;
Bloch, Isabelle ;
Hudelot, Celine .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2016, 24 :1-32
[4]  
Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms
[5]   Some new indexes of cluster validity [J].
Bezdek, JC ;
Pal, NR .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1998, 28 (03) :301-315
[6]   On links between mathematical morphology and rough sets [J].
Bloch, I .
PATTERN RECOGNITION, 2000, 33 (09) :1487-1496
[7]   Orthopairs and granular computing [J].
Ciucci, Davide .
GRANULAR COMPUTING, 2016, 1 (03) :159-170
[8]   LOWER BOUNDS FOR PARTITIONING OF GRAPHS [J].
DONATH, WE ;
HOFFMAN, AJ .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (05) :420-425
[9]  
FIEDLER M, 1973, CZECH MATH J, V23, P298
[10]   Resilience Analysis of Critical Infrastructures: A Cognitive Approach Based on Granular Computing [J].
Fujita, Hamido ;
Gaeta, Angelo ;
Loia, Vincenzo ;
Orciuoli, Francesco .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (05) :1835-1848