A three-way clustering approach for handling missing data using GTRS

被引:108
作者
Afridi, Mohammad Khan [1 ]
Azam, Nouman [1 ]
Yao, JingTao [2 ]
Alanazi, Eisa [3 ]
机构
[1] Natl Univ Comp & Emerging Sci, Islamabad, Pakistan
[2] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
[3] Umm Al Qura Univ, Dept Comp Sci, Mecca, Saudi Arabia
基金
加拿大自然科学与工程研究理事会;
关键词
Clustering; Three-way decisions; Game-theoretic rough sets; Missing data; Uncertainty; THEORETIC ROUGH SETS; INCOMPLETE DATA; FUZZY; ALGORITHM;
D O I
10.1016/j.ijar.2018.04.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering is an important data analysis task. It becomes a challenge in the presence of uncertainty due to reasons such as incomplete, missing or corrupted data. A three-way approach has recently been introduced to deal with uncertainty in clustering due to missing values. The essential idea is to make a deferment decision whenever it is not clear and possible to decide whether or not to include an object in a cluster. A key issue in the three-way approach is to determine the thresholds that are used to define the three types of decisions, namely, include an object in a cluster, exclude an object from a cluster, or delay (defer) the decision of inclusion or exclusion from a cluster. The existing studies do not sufficiently address the determination of thresholds and generally use its fix values. In this paper, we explore the use of game-theoretic rough set (GTRS) model to handle this issue. In particular, a game is defined where the determination of thresholds is approached based on a tradeoff between the properties of accuracy and generality of clusters. The determined thresholds are then used to induce three-way decisions for clustering uncertain objects. Experimental results on four datasets from UCI machine learning repository suggests that the GTRS significantly improves the generality while keeping similar levels of accuracy in comparison to other three-way and similar models. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:11 / 24
页数:14
相关论文
共 40 条
[1]  
[Anonymous], 1986, STAT ANAL MISSING DA
[2]  
[Anonymous], 2011, WILEY SERIES PROBABI
[3]  
Azam N, 2013, LECT NOTES ARTIF INT, V8171, P145, DOI 10.1007/978-3-642-41299-8_14
[4]   Analyzing uncertainties of probabilistic rough set regions with game-theoretic rough sets [J].
Azam, Nouman ;
Yao, JingTao .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2014, 55 (01) :142-155
[5]  
BROWN CH, 1983, PSYCHOMETRIKA, V48, P269
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]  
Eye A. V., 2014, STAT METHODS LONGITU, V1
[8]  
HAITOVSKY Y, 1968, J R STAT SOC B, V30, P67
[9]   Fuzzy c-means clustering of incomplete data [J].
Hathaway, RJ ;
Bezdek, JC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2001, 31 (05) :735-744
[10]   Game-Theoretic Rough Sets [J].
Herbert, Joseph P. ;
Yao, JingTao .
FUNDAMENTA INFORMATICAE, 2011, 108 (3-4) :267-286