Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types

Details Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types

2011-03-02

arxiv.org/abs/1103.0368v2

Computer Science

Social and Information Networks

Scientific paper

We investigate the community detection problem on graphs in the existence of multiple edge types. Our main motivation is that similarity between objects can be defined by many different metrics and aggregation of these metrics into a single one poses several important challenges, such as recovering this aggregation function from ground-truth, investigating the space of different clusterings, etc. In this paper, we address how to find an aggregation function to generate a composite metric that best resonates with the ground-truth. We describe two approaches: solving an inverse problem where we try to find parameters that generate a graph whose clustering gives the ground-truth clustering, and choosing parameters to maximize the quality of the ground-truth clustering. We present experimental results on real and synthetic benchmarks.

Affiliated with

Also associated with

No associations

Rating

Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473715