GPU-based Parallel Technique for Solving the N-Similarity Problem in Textual Data Mining

An important issue in data mining and information retrieval is the problem of multiple similarity or n-similarity. This problem entails finding a group of n data points with the highest similarity within a large dataset. Exact methods to solve this problem exist but come with high time and space complexities. Additionally, various metaheuristic algorithms have been proposed, including genetic algorithms, gravitational search algorithms, particle swarm optimization, imperialist competitive algorithms, and fuzzy imperialist competitive algorithms. These metaheuristics are capable of finding near-optimal solutions within a reasonable timeframe, although there is no guarantee of achieving exact results. In this paper, we employ a parallelization technique using CUDA to expedite the exact method. We conduct experiments on textual datasets to identify a group of n textual documents with the highest similarity to each other. The experimental results demonstrate that the proposed parallel exact method significantly reduces execution time compared to the best sequential approach and CPU multi-core implementation. Furthermore, it is evident that the proposed method requires less memory space than the exact method.