A Novel Rough Set Based Clustering Approach for Streaming Data

被引:0
作者
Yogita [1 ]
Toshniwal, Durga [1 ]
机构
[1] Indian Inst Technol, Roorkee, Uttar Pradesh, India
来源
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2012) | 2014年 / 236卷
关键词
Clustering; Streaming data; Cluster approximation; Rough set;
D O I
10.1007/978-81-322-1602-5_131
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering is a very important data mining task. Clustering of streaming data is very challenging because streaming data cannot be scanned multiple times and also new concepts may keep evolving in data over time. Inherent uncertainty involved in real world data stream further magnifies the challenge of working with streaming data. Rough set is a soft computing technique which can be used to deal with uncertainty involved in cluster analysis. In this paper, we propose a novel rough set based clustering method for streaming data. It describes a cluster as a pair of lower approximation and an upper approximation. Lower approximation comprises of the data objects that can be assigned with certainty to the respective cluster, whereas upper approximation contains those data objects whose belongingness to the various clusters in not crisp along with the elements of lower approximation. Uncertainty in assigning a data object to a cluster is captured by allowing overlapping in upper approximation. Proposed method generates soft-cluster. Keeping in view the challenges of streaming data, the proposed method is incremental and adaptive to evolving concept. Experimental results on synthetic and real world data sets show that our proposed approach outperforms Leader clustering algorithm in terms of classification accuracy. Proposed method generates more natural clusters as compare to k-means clustering and it is robust to outliers. Performance of proposed method is also analyzed in terms of correctness and accuracy of rough clustering.
引用
收藏
页码:1253 / 1265
页数:13
相关论文
共 15 条
[1]  
Aggarwal C., 2004, P 2003 INT C VERY LA
[2]  
Aggarwal C., 2004, P 30 VLBD C
[3]  
[Anonymous], 2010, UCI MACHINE LEARNING
[4]   Rough set based incremental clustering of interval data [J].
Asharaf, S ;
Murty, MN ;
Shevade, SK .
PATTERN RECOGNITION LETTERS, 2006, 27 (06) :515-519
[5]   Density-Based Clustering over an Evolving Data Stream with Noise [J].
Cao, Feng ;
Ester, Martin ;
Qian, Weining ;
Zhou, Aoying .
PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006, :328-+
[6]  
Hailiang Wang, 2012, Rough Sets and Current Trends in Computing. Proceedings 8th International Conference, RSCTC 2012, P26, DOI 10.1007/978-3-642-32115-3_3
[7]  
Jiawei H., 2006, DATA MINING CONCEPTS, VSecond, DOI [10.1016/C2009-0-61819-5, DOI 10.1016/C2009-0-61819-5]
[8]  
Joshi M., 2010, Proceedings 10th International Conference on Intelligent Systems Design and Applications (ISDA 2010), P397, DOI 10.1109/ISDA.2010.5687233
[9]  
Lingras P, 2002, PROCEEDINGS OF THE 2002 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOL 1 & 2, P1039, DOI 10.1109/FUZZ.2002.1006647
[10]  
OCallaghan L., 2000, P ICDE C, P685