Clustering massive high dimensional data with dynamic feature maps
Amarasiri, Rasika, Alahakoon, Damminda and Smith-Miles, Kate 2006, Clustering massive high dimensional data with dynamic feature maps, Lecture notes in computer science, vol. 4233, pp. 814-823, doi: 10.1007/11893257_90.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Clustering massive high dimensional data with dynamic feature maps
This paper presents an algorithm based on the Growing Self Organizing Map (GSOM) called the High Dimensional Growing Self Organizing Map with Randomness (HDGSOMr) that can cluster massive high dimensional data efficiently. The original GSOM algorithm is altered to accommodate for the issues related to massive high dimensional data. These modifications are presented in detail with experimental results of a massive real-world dataset.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.