Robust local triangular kernel density-based clustering for high-dimensional data
A number of clustering algorithms can be employed to find clusters in multivariate data. However, the effectiveness and efficiency of the existing algorithms are limited, since the respective data has high dimension, contain large amount of noise and consist of clusters with arbitrary shapes and den...
Disimpan dalam:
| Pengarang-pengarang Utama: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Diterbitkan: |
2013
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/51289/ http://eprints.utm.my/51289/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!