.png){kind=icon}
Return
An automatic clustering for interval data using the genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03606-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an Automatic Clustering algorithm for Interval data using the Genetic algorithm (ACIG). In this algorithm, the overlapped distance between intervals is applied to determining the suitable number of clusters. Moreover, to optimize in clustering, we modify the Davies & Bouldin index, and to improve the crossover, mutation, and selection operators of the original genetic algorithm. The convergence of ACIG is theoretically proved and illustrated by the numerical examples. ACIG can be implemented effectively by the established Matlab procedure. Through the experiments on data sets with different characteristics, the proposed algorithm has shown the outstanding advantages in comparison to the existing ones. Recognizing the images by the proposed algorithm gives the potential in real applications of this research.
Keywords:
Cluster analysis
DB index
Genetic algorithm
Interval data
Overlap distance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
ShareSaveNovosphingobium and Its Potential Role in Chronic Obstructive Pulmonary Diseases: Insights from Microbiome Studies.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSave
View more