Closed

non-dominated optimization for community finding

You will develop a multi-objective EA algorithm to find the non-dominated (Pareto) set of communities in a multi-graph. A multigraph is a graph where multi-types of edges can exist between vertices. The multi-graph that you will be experimenting on is based on bibliographical data of researchers.

This project involves experience with multi-objective optimisation, using Evolutionary Algorithms, and how to interpret the solutions from the algorithms. This is an unsupervised learning task. Part of the challenge is to come up with ways to validate, interpret and justify the communities found.

There are many possible graphs that can be extracted from the semi-structured DBLP data. In this project, we focus on two relations between researchers:

a) co-authorship and b) co-publications at same conferences. Co-authorship is the number of papers that the two incident researchers have written together. Co-publications is the number of unique conferences where both researchers have published in. In addition, each of the researchers have the number of years they have been active, which is the difference between the years of their first and latest publications.

Formally, the multi-graph can be represented as G(V; A;U; Y ), where V denotes the vertex set, A denotes the co-authorship edge weights between the vertices (A : V V ! N1), U denotes the co-publication edge weights (U : V V ! N) and Y denotes the vertex weights of the number of active years (Y : V ! N). In this project, we concentrate on partitional communities, i.e., the communities completely partition the set of vertices and there is no overlap between communities. The set of communities is denoted by C, a community is denoted by Ci, where i is an index and C(vi) is a function that returns the community index for vertex vi.

A community is a group of vertices that generally form a cohesive group. Because this is a multi-graph, a \cohesive group" in one relation might not

be one in the other relation. There are many de nitions and objectives for communities, hence to simplify the project both relations are to be grouped

according to the weighted modularity objective. In the weighted modularity objective, we want to find a set of communities that minimises some objectives for the co-authorship relation:

Skills: Algorithm, Matlab and Mathematica

See more: community set, vertices graph, types data graphs, types algorithms, types algorithm, set algorithm, part graph, overlap algorithm, learning challenge, find solutions, many graphs, graphs algorithms, graphs algorithm, graph edge, find researchers, edge graph, develop algorithms, develop algorithm, community data, algorithms graph, algorithms graphs, algorithm set, algorithm graphs, algorithm function, algorithm graph

About the Employer:
( 0 reviews ) Australia

Project ID: #4977191

3 freelancers are bidding on average $333 for this job

DrFreelancer2012

Hi I have a PhD and have an academic position; I am the best fit for this project. I have the required background. I will send some pages of my reports. PhD, P.S. I am the freelancer who doesn't hire others. I do the More

$157 AUD in 3 days
(18 Reviews)
4.7
theenggprojects

Hi, I am a Mechatronics and Control Engineer , you can check my work on my blog www.TheEngineeringProjects.com Thanks.

$500 AUD in 15 days
(13 Reviews)
4.3
redmapleleaves

I am an expert in Matlab and optimization. I can help you in time. i have many experiences in a multi-objective EA algorithm to find the non-dominated (Pareto) set of communities in a multi-graph.

$250 AUD in 7 days
(3 Reviews)
2.3
jingguo811

hello, sir. i can help u satisfactorily. i wish u to send me ur detail project. sincerely. i would wait ur answer. thank you.

$250 AUD in 10 days
(1 Review)
1.0