A Space Efficient Minimum Spanning Tree Approach to the Fuzzy Joint Points Clustering Algorithm

摘要

The fuzzy joint points (FJPs) method is a neighborhood-based clustering method that uses a fuzzy neighborhood relation and eliminates the need for a parameter. Even though the fuzzy neighborhood-based clustering methods are proven to be fast enough, such that tens of thousands of data can be handled under a second, the space complexity is still a limiting factor. In this study, a minimum spanning tree based reduced space FJP algorithm is proposed. The computational experiments show that the reduced space algorithm enables the method to be used for much larger data sets.