.png){kind=icon}
Return
A clustering algorithm with affine space-based boundary detection
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-017-0979-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering is an important technique in data mining. The innovative algorithm proposed in this paper obtains clusters by first identifying boundary points as opposed to existing methods that calculate core cluster points before expanding to the boundary points. To achieve this, an affine space-based boundary detection algorithm was employed to divide data points into cluster boundary and internal points. A connection matrix was then formed by establishing neighbor relationships between internal and boundary points to perform clustering. Our clustering algorithm with an affine space-based boundary detection algorithm accurately detected clusters in datasets with different densities, shapes, and sizes. The algorithm excelled at dealing with high-dimensional datasets.
Keywords:
Data mining
Clustering algorithm
Boundary detection
Affine space
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSaveShareSaveShareSaveAn efficient and scalable density-based Clustering algorithm for datasets with complex structures.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveAssessing Performance of Painted Carbon and Weathering Steels in an Industrial AtmosphereCORROSION
CORROSIONIF0
PREAI
ShareSaveShareSaveShareSave
View more