.png){kind=icon}
Return
Enhancing grid-density based clustering for high dimensional data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2011.02.047.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an enhanced grid-density based approach for clustering high dimensional data. Our technique takes objects (or points) as atomic units in which the size requirement to cells is waived without losing clustering accuracy. For efficiency, a new partitioning is developed to make the number of cells smoothly adjustable; a concept of the ith-order neighbors is defined for avoiding considering the exponential number of neighboring cells; and a novel density compensation is proposed for improving the clustering accuracy and quality. We experimentally evaluate our approach and demonstrate that our algorithm significantly improves the clustering accuracy and quality. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Clustering
Subspace clustering
High dimensional data
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.1
Papers:
5.5K
Citations:
8.4K
Organization
Cited Papers
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveThe soft X-ray spectroscopy beamline at the LNLS: technical description and commissioning results
OAAI
OAAIShareSaveShareSaveShareSave no more
no more