An incremental clustering method based on multiple objectives for dynamic data analysis

被引:3
|
作者
Dwivedi, Rajesh [1 ]
Tiwari, Aruna [1 ]
Bharill, Neha [2 ]
Ratnaparkhe, Milind [3 ]
Soni, Rishabh [1 ]
Mahbubani, Rahul [1 ]
Kumar, Saket [1 ]
机构
[1] IIT Indore, Dept Comp Sci, Indore 453552, Madhya Pradesh, India
[2] Mahindra Univ, Ecole Cent Sch Engn, Dept Comp Sci, Hyderabad 500043, Telangana, India
[3] Indian Inst Soybean Res Indore, ICAR, Indore 452001, Madhya Pradesh, India
关键词
Multi-objective optimization; Incremental clustering; Intra-cluster distance; Inter-cluster distance; Cluster density;
D O I
10.1007/s11042-023-17134-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the advancement in big data and bioinformatics, the quantity and quality of raw data have exploded during the past two decades. Multiple sources contributed to the generation of very complex, diverse, and vast raw data. The generated data may conceal crucial patterns that need to be identified for data analysis. In the past few decades, a variety of clustering methods have been developed and have proven useful for data analysis. However, these methods are inappropriate for dynamic applications and only function with static data. To address this issue, we present a multi-objective incremental clustering method for processing dynamic data that generates and updates clusters in real-time. To improve the dynamic clustering process, the proposed method employs Euclidean distance to calculate the similarity between data points and constructs a fitness function with three primary clustering objective functions: inter-cluster distance, intra-cluster distance, and cluster density. The proposed method employs the concept of objective weighting, which allocates a weight to each objective in order to generate a single Pareto-optimal solution for the constructed fitness function. The proposed method outperforms other state-of-the-art methods on five benchmarks and three real-life plant genomics data sets.
引用
收藏
页码:38145 / 38165
页数:21
相关论文
共 50 条
  • [31] Initial Seeds Selection in Dynamic Clustering Method Based on Data Depth
    Zhang, Caiya
    Jin, Ze
    INTELLIGENCE SCIENCE AND BIG DATA ENGINEERING: BIG DATA AND MACHINE LEARNING TECHNIQUES, ISCIDE 2015, PT II, 2015, 9243 : 603 - 611
  • [32] A New Method For Dynamic Stock Clustering Based On Spectral Analysis
    Li, Zhaoyuan
    Tian, Maozai
    COMPUTATIONAL ECONOMICS, 2017, 50 (03) : 373 - 392
  • [33] Incremental Outlier Feature Clustering Algorithm in Blockchain Networks Based on Big Data Analysis
    Yang, Chao
    IETE JOURNAL OF RESEARCH, 2023, 69 (11)
  • [34] A New Method For Dynamic Stock Clustering Based On Spectral Analysis
    Zhaoyuan Li
    Maozai Tian
    Computational Economics, 2017, 50 : 373 - 392
  • [35] Incremental clustering algorithm of mixed numerical and categorical data based on clustering ensemble
    Li, Tao-Ying
    Chen, Yan
    Zhang, Jin-Song
    Qin, Sheng-Jun
    Kongzhi yu Juece/Control and Decision, 2012, 27 (04): : 603 - 608
  • [36] Incremental Clustering on Linked Data
    Nentwig, Markus
    Rahm, Erhard
    2018 18TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2018, : 531 - 538
  • [37] A Data Mining Method For Refining Groups In Data Using Dynamic Model Based Clustering
    Servi, Tayfun
    Erol, Hamza
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (IEEE INISTA), 2013,
  • [38] A dynamic hierarchical incremental learning-based supervised clustering for data stream with considering concept drift
    Nikpour, Soheila
    Asadi, Shahrokh
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2022, 13 (6) : 2983 - 3003
  • [39] A dynamic hierarchical incremental learning-based supervised clustering for data stream with considering concept drift
    Soheila Nikpour
    Shahrokh Asadi
    Journal of Ambient Intelligence and Humanized Computing, 2022, 13 : 2983 - 3003
  • [40] An incremental attribute reduction method for dynamic data mining
    Jing, Yunge
    Li, Tianrui
    Fujita, Hamido
    Wang, Baoli
    Cheng, Ni
    INFORMATION SCIENCES, 2018, 465 : 202 - 218