Mining and Matching of Profiles in a Social Network – A Static Measure of Friendship

By : Puspendu Biswas, Aditya Bagchi

Page No: 75-98

Abstract
In the process of preventing possible cyber-crimes through social media, a new research paradigm named Proactive Forensics has evolved. As a part of such research effort, this paper attempts to match profiles of two members in a social network as a measure of compatibility between two persons. Profile matching efforts made so far include; matching job profile with candidate profile to choose “right man for the right job”, matching profiles of same person from two different social nets like Facebook and LinkedIn and to ascertain that they belong to the same person and even matching of two different Genome profiles. However, this paper tries to identify whether a friendship request on a social net can be accepted on the basis of a matching value generated by comparing the features of two profiles. For the purpose of matching, this paper provides two measures of closeness between two profiles; first a measure of the degree of exact match of feature values and secondly a composite distance measure of different feature wise distances. This composite measure has been termed as a static measure of friendship. A modified Jacardian similarity and standard Cosine similarity have been used for final measure of closeness between two profiles. In addition, it has been found that many features, used for matching, give rise to different types of hierarchies. New distance measures have been developed for matching such hierarchic structures. It has also been proved that such new measures are valid distance measures.

Authors :
Puspendu Biswas
Software Development Department, IGT Solutions Pvt. Ltd., Gurgaon

Aditya Bagchi
Computer Science Department, Ramakrishna Mission Vivekananda Educational & Research Institute, Belur Math, Howrah
 

DOI: DOI-https://doi.org/10.32381/IAPQRT.2022.46.01-02.5