Clustering Data Streams over Sliding Windows by DCA

被引:3
|
作者
Ta Minh Thuy [1 ]
Le Thi Hoai An [1 ,2 ]
Boudjeloud-Assala, Lydia [1 ]
机构
[1] Univ Lorraine, Lab Theoret & Appl Comp Sci, LITA EA 3097, F-57045 Metz, France
[2] Univ Lorraine, Lorraine Res Lab Comp Sci & Its Applicat, LORIA CNRS UMR 7503, F-54506 Nancy, France
关键词
Clustering; Data streams; Sliding windows; clustering; DCA;
D O I
10.1007/978-3-319-00293-4_6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mining data stream is a challenging research area in data mining, and concerns many applications. In stream models, the data is massive and evolving continuously, it can be read only once or a small number of times. Due to the limited memory availability, it is impossible to load the entire data set into memory. Traditional data mining techniques are not suitable for this kind of model and applications, and it is required to develop new approaches meeting these new paradigms. In this paper, we are interested in clustering data stream over sliding window. We investigate an efficient clustering algorithm based on DCA (Difference of Convex functions Algorithm). Comparative experiments with clustering using the standard K-means algorithm on some real-data sets are presented.
引用
收藏
页码:65 / 75
页数:11
相关论文
共 50 条
  • [31] Finding frequent items in sliding windows over data streams using EBF
    Wang, ShuYun
    Xu, HeXiang
    Hu, YunFa
    [J]. SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 682 - +
  • [32] Mining Swarm Patterns in Sliding Windows over Moving Object Data Streams
    Bhushan, Alka
    Bellur, Umesh
    Sharma, Kuldeep
    Deshpande, Srijay
    Sarda, Nandlal L.
    [J]. 25TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2017), 2017,
  • [33] Density and sliding window-based clustering over evolving data streams
    Yu, Yanwei
    Zhao, Jindong
    Zhang, Yonggang
    Wen, Changci
    [J]. ICIC Express Letters, Part B: Applications, 2015, 6 (08): : 2275 - 2283
  • [34] Approximate Range Emptiness in Constant Time for IoT Data Streams over Sliding Windows
    Wang, Xiujun
    Liu, Zhi
    Yang, Yangzhao
    Shao, Xun
    Gu, Yu
    Ishihara, Susumu
    [J]. 2019 28TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN), 2019,
  • [35] Concept Shift Detection for Frequent Itemsets from Sliding Windows over Data Streams
    Koh, Jia-Ling
    Lin, Ching-Yi
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2009, 5667 : 334 - 348
  • [36] New sampling-based summary structures for sliding windows over data streams
    Zhang, Longbo
    Li, Zhanhuai
    Yu, Min
    Zhao, Guangyuan
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 1242 - +
  • [38] Truly Perfect Samplers for Data Streams and Sliding Windows
    Jayaram, Rajesh
    Woodruff, David P.
    Zhou, Samson
    [J]. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2022, : 29 - 40
  • [39] Truly Perfect Samplers for Data Streams and Sliding Windows
    Jayaram, Rajesh
    Woodruff, David P.
    Zhou, Samson
    [J]. PROCEEDINGS OF THE 41ST ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS '22), 2022, : 29 - 40
  • [40] Mining frequent itemsets over data streams with multiple time-sensitive sliding windows
    Jin, Long
    Chai, Duck Jin
    Lee, Yang Koo
    Ryu, Keun Ho
    [J]. ALPIT 2007: PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON ADVANCED LANGUAGE PROCESSING AND WEB INFORMATION TECHNOLOGY, 2007, : 486 - +