On reducing space complexity of fuzzy neighborhood based clustering algorithms

Using fuzzy neighborhood relations in density-based clustering, like in Fuzzy Joint Points (FJP) algorithm, yields more robust and autonomous algorithms. 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 transformed FJP algorithm with low space complexity is proposed.