https://www.googletagmanager.com/ns.html?id=GTM-5PQFQWH
The University of Windsor has moved to an “essential service only” model. Learn More.

School of Computer Science

In this section

MSc Thesis Proposal by Harshil Patel:"Cluster Hire in Social Networks using MWSCAN: Modified Weighted Structural Clustering Algorithm for Networks"

Thursday, February 20, 2020 - 10:00 to 11:00

SCHOOL OF COMPUTER SCIENCE

The School of Computer Science is pleased to present…

MSc Thesis Proposal by: Harshil Patel

Date: Thursday February 20th 2020
Time: 10:00 AM to 11:00 AM
Location: Lambton Tower, 3105

Abstract:

The concept of effective collaboration within a group is immensely used in organizations as a viable means for improving team performance. Any organization or big institute, who works with multiple projects need to hire a group of experts, who can complete a set of projects. When hiring a group of experts, multiple considerations have to be taken into account. In Cluster Hire problem, we are given a set of experts, each having a set of skills. Also, we are given a set of projects, each requiring a set of skills. Upon completion of each project, a profit is generated for an organization. Each expert demands a monetary cost (i.e. salary) to provide his/her expertise in a project. The solution to the Cluster Hire problem is hiring a group of experts for a set of projects within the constraints of a budget for hiring and a working capacity of each expert. The extension to this problem is assuming there exists a social network amongst the experts, which contains their past collaboration information. The goal of our research is to find the most collaborative group of experts who will work jointly to complete a set of projects. If two experts have collaborated in the past, then they are preferred to be on the same team in future. Currently, the solution to Cluster Hire problem is achieved using greedy heuristic algorithms and Integer Linear Programming (ILP) approach. However, both methods have high processing time for large networks. Whereas, Weighted Structural Clustering Algorithm for Networks (WSCAN) can produce faster results for constraint specific problems. We are proposing to solve Cluster Hire problem using Modified Weighted Structural Clustering Algorithm for Networks (MWSCAN). We will be comparing our results with the greedy heuristic and Integer Linear Programming (ILP) solutions.

Thesis Committee:

Internal Reader: Dr. Saeed Samet           
External Reader: Dr. Huapeng Wu
Advisor: Dr. Dan Wu

MSc Thesis Proposal Announcement

5113 Lambton Tower 401 Sunset Ave. Windsor ON, N9B 3P4 (519) 253-3000 Ext. 3716 csgradinfo@uwindsor.ca
Text Only Options

Top of page


Text Only Options

Open the original version of this page.

     

Usablenet Assistive is a UsableNet product. Usablenet Assistive Main Page.