Piecewise Maximal Similarity for Ad-hoc Social Networks

Computing Profile Similarity is a fundamental requirement in the area of Social Networks to suggest similar social connections that have high chance of being accepted as actual connection. Representing and measuring similarity appropriately is a pursuit of many researchers. Cosine similarity is a widely used metric that is simple and effective. This paper provides analysis of cosine similarity for social profiles and proposes a novel method to compute Piecewise Maximal Similarity between profiles. The proposed metric is 6% more effective to measure similarity than cosine similarity based on computations on real data.