A people-to-people matching system using graph mining techniques

  • Authors:

  • Sangeetha Kutty;Richi Nayak;Lin Chen

  • Affiliations:

  • Faculty of Science and Technology, Queensland University of Technology, Brisbane, Australia 4001;Faculty of Science and Technology, Queensland University of Technology, Brisbane, Australia 4001;Faculty of Science and Technology, Queensland University of Technology, Brisbane, Australia 4001

  • Venue:
  • World Wide Web
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called "attributed bipartite graph". By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.