Extending applicability of cluster based pattern recognition with efficient approximation techniques

摘要

The fundamental goal of this research has been to improve computational efficiency of the Visually Empirical Region of Influence (VERI) based clustering and pattern recognition (PR) algorithms we developed in previous work. The original clustering algorithm, when applied to data sets with N points, ran in time proportional to N(sup 3) (denoted with the notation O (N(sup 3)), which limited the size of data sets it could find solutions for. Results generated from our original clustering algorithm were superior to commercial clustering packages. These results warranted our efforts to improve the runtimes of our algorithms. This report describes the new algorithms, advances and obstacles met in their development. The report gives qualitative and quantitative analysis of the improved algorithms performances. With the information in this report, an interested user can determine which algorithm is best for a given problem in clustering (2-D) or PR (K-D), and can estimate how long it will run using the runtime plots of the algorithms before using any software.