High dimensional clustering algorithm based on Local Significant Units
- Publication Type:
- Journal Article
- Citation:
- Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2010, 32 (11), pp. 2707 - 2712
- Issue Date:
- 2010-11-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| High Dimensional Clustering Algorithm Based on Local Significant Units.pdf | Published Version | 256.11 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
High dimensional clustering algorithm based on equal or random width density grid cannot guarantee high quality clustering results in complicated data sets. In this paper, a High dimensional Clustering algorithm based on Local Significant Unit (HC_LSU) is proposed to deal with this problem, based on the kernel estimation and spatial statistical theory. Firstly, a structure, namely Local Significant Unit (LSU) is introduced by local kernel density estimation and spatial statistical test; secondly, a greedy algorithm named Greedy Algorithm for LSU (GA_LSU) is proposed to quickly find out the local significant units in the data set; and eventually, the single-linkage algorithm is run on the local significant units with the same attribute subset to generate the clustering results. Experimental results on 4 synthetic and 6 real world data sets showed that the proposed high-dimensional clustering algorithm, HC_LSU, could effectively find out high quality clustering results from the highly complicated data sets.
Please use this identifier to cite or link to this item: