.png){kind=icon}
Return
DENDIS: A new density-based sampling for clustering algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2016.03.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To deal with large datasets, sampling can be used as a preprocessing step for clustering. In this paper, an hybrid sampling algorithm is proposed. It is density-based while managing distance concepts to ensure space coverage and fit cluster shapes. At each step a new item is added to the sample: it is chosen as the furthest from the representative in the most important group. A constraint on the hyper volume induced by the samples avoids over sampling in high density areas. The inner structure allows for internal optimization: only a few distances have to be computed. The algorithm behavior is investigated using synthetic and real-world data sets and compared to alternative approaches, at conceptual and empirical levels. The numerical experiments proved it is more parsimonious, faster and more accurate, according to the Rand Index, with both k-means and hierarchical clustering algorithms. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Density
Distance
Space coverage
Clustering
Rand index
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
Cited Papers
ShareSaveHalogen atom transfer radical cyclization of N-allyl-N-benzyl-2,2-dihaloamides to 2-pyrrolidinones, promoted by Fe0-FeCl3 or CuCl-TMEDA.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSaveShareSaveA K-Farthest-Neighbor-based approach for support vector data descriptionAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSave
ShareSave
View more