Abstract: We propose a Hamming distance based approximate similarity text search (HASTS) algorithm to improve the quality of queries in massive text data. The HASTS algorithm first constructs an index ...

This repository contains the code to reproduce the result of the pubblication "Split-and-Merge sampling algorithm for Hamming-mixture models of categorical data" made by Di Marino et al. (2025) on the ...

Abstract: When the Hamming clustering is applied to personalized recommendations for the user access logs, since it does not reflect the user's preference for the project, so we proposed a hybrid ...