The Community for Technology Leaders
2013 IEEE Seventh International Conference on Semantic Computing (2013)
Irvine, CA, USA USA
Sept. 16, 2013 to Sept. 18, 2013
pp: 90-93
ABSTRACT
The goal of a similarity search system is to allow users to retrieve data that presents a required similarity level in a certain dataset. For example, such dataset may be applied in the social media scenario, where huge amounts of data represent users in a social network. This paper uses a Vector Space Model (VSM) to represent users' profiles and the Random Hyper plane Hashing (RHH) function to create indexes for them. Both VSM and RHH compose an alternative to address the challenge of performing similarity searches over the huge amount of data present in the social media scenario: the Hamming similarity. In order to evaluate the effectiveness of our proposal, this paper brings examples of reference profiles, used for performing queries, and presents results regarding the correlation between cosine and Hamming similarity and the frequency distribution of Hamming distances among identifiers of users' profiles. In short, the results indicate that Hamming similarity can be useful for the development of similarity search systems for social media.
INDEX TERMS
Similarity Search, Hamming distance, RHH
CITATION

R. d. Villaca, L. B. Paula, R. Pasquini and M. F. Magalhaes, "A Similarity Search System Based on the Hamming Distance of Social Profiles," 2013 IEEE Seventh International Conference on Semantic Computing(ICSC), Irvine, CA, USA USA, 2013, pp. 90-93.
doi:10.1109/ICSC.2013.24
170 ms
(Ver 3.3 (11022016))