论文信息 - Hybrid Algorithm to Data Clustering

Hybrid Algorithm to Data Clustering

In this research an N-Dimentional clustering algorithm based on ACE algorithm for large datasets is described. Each part of the algorithm will be explained and experimental results obtained from apply this algorithm are discussed. The research is focused on the fast and accurate clustering using real databases as workspace instead of directly loaded data into memory since this is very limited and insufficient when large data amount are used. This algorithm can be applied to a great variety and types of information i.e. geospatial data, medical data, biological data and others. The number of computations required by the algorithm is ~O(N).

[1] Qiulin Ding,et al. Discovery of the Latent Supportive Relevance in Medical Data Mining , 2008 .

[2] William Peter,et al. New unsupervised clustering algorithm for large datasets , 2003, KDD '03.

[3] Michael J. A. Berry,et al. Data mining techniques - for marketing, sales, and customer support , 1997, Wiley computer publishing.

[4] C. Birdsall,et al. Plasma Physics via Computer Simulation , 2018 .

[5] Maurice K. Wong,et al. Algorithm AS136: A k-means clustering algorithm. , 1979 .

[6] Paul S. Bradley,et al. Scaling Clustering Algorithms to Large Databases , 1998, KDD.

[7] R W Hockney,et al. Computer Simulation Using Particles , 1966 .

[8] J. A. Hartigan,et al. A k-means clustering algorithm , 1979 .