Content matching problem in large scale network using weighted b-matching algorithm

Abstract

This paper highlights the solution of a content matching problem in large-scale social network, where the matching is to be done between a set of producers of information and the associated consumers. In the information dissemination process, the objective is to provide suitable information from the provider to the right kind of consumers. In order to have higher or maximized relevance of the matched content, a good number of algorithms have been proposed. This matching task can be further extended based on the solution of the weighted b-matching problem of graph theory. Hence an algorithm, named the b-suitor algorithm has been proposed in this direction and different case studies have been considered to verify the accuracy of the algorithm when the data size is large. Further, a comparative analysis has been presented based on the performance of this algorithm versus various other algorithms as available in the literature.