.png){kind=icon}
.png){kind=icon}
Return
An incremental clustering method based on multiple objectives for dynamic data analysis
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-023-17134-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Multi-objective optimization
Incremental clustering
Intra-cluster distance
Inter-cluster distance
Cluster density
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W
View more organizations