A Novel Approach for PAM Clustering Method
| Autor: | Faisal Bin Al Abid |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
DBSCAN
Clustering high-dimensional data Brown clustering Fuzzy clustering Computer science Correlation clustering Constrained clustering computer.software_genre Determining the number of clusters in a data set ComputingMethodologies_PATTERNRECOGNITION Data stream clustering CURE data clustering algorithm Outlier Canopy clustering algorithm FLAME clustering Affinity propagation Data mining Cluster analysis Algorithm computer k-medians clustering |
| Zdroj: | International Journal of Computer Applications. 86:1-5 |
| ISSN: | 0975-8887 |
| DOI: | 10.5120/15074-3039 |
| Popis: | and in recent times proposed clustering algorithms are studied and it is known that the k-means clustering method is mostly used for clustering of data due to its reduction of time complexity. But the foremost drawback of k-means algorithm is that it suffers from sensitivity of outliers which may deform the distribution of data owing to the significant values. The drawback of the k-means algorithm is resolved by k-medoids method where the novel approach uses user defined value for k. As a result, if the number of clusters is not chosen suitably, the accuracy will be minimized. Even, K-medoids algorithm does not scale well for huge data set. In order to overcome the above stated limitations, a new grid based clustering method is proposed, where time complexity of proposed algorithm is depending on the number of cells. Simulation results show that, the proposed approach has less time complexity and provides natural clustering method which scales well for large dataset. KeywordsGrid, ADULT Dataset, Partitioning, Time complexity |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|