Fast Density Clustering Algorithm for Numerical Data and Categorical Data
Data objects with mixed numerical and categorical attributes are often dealt with in the real world. Most existing algorithms have limitations such as low clustering quality, cluster center determination difficulty, and initial parameter sensibility. A fast density clustering algorithm (FDCA) is put...
Saved in:
| Published in | Mathematical problems in engineering Vol. 2017; no. 2017; pp. 1 - 15 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Cairo, Egypt
Hindawi Publishing Corporation
01.01.2017
Hindawi John Wiley & Sons, Inc |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1024-123X 1026-7077 1563-5147 1563-5147 |
| DOI | 10.1155/2017/6393652 |
Cover
| Summary: | Data objects with mixed numerical and categorical attributes are often dealt with in the real world. Most existing algorithms have limitations such as low clustering quality, cluster center determination difficulty, and initial parameter sensibility. A fast density clustering algorithm (FDCA) is put forward based on one-time scan with cluster centers automatically determined by center set algorithm (CSA). A novel data similarity metric is designed for clustering data including numerical attributes and categorical attributes. CSA is designed to choose cluster centers from data object automatically which overcome the cluster centers setting difficulty in most clustering algorithms. The performance of the proposed method is verified through a series of experiments on ten mixed data sets in comparison with several other clustering algorithms in terms of the clustering purity, the efficiency, and the time complexity. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1024-123X 1026-7077 1563-5147 1563-5147 |
| DOI: | 10.1155/2017/6393652 |