On Clustering on Graphs with Multiple Edge Types

Details On Clustering on Graphs with Multiple Edge Types On Clustering on Graphs with Multiple Edge Types

2011-09-08

arxiv.org/abs/1109.1605v1

Computer Science

Social and Information Networks

Scientific paper

We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where they are published, keyword similarity, citations, etc. As such, graphs with multiple edges is a more accurate model to describe similarities between objects. Each edge/metric provides only partial information about the data; recovering full information requires aggregation of all the similarity metrics. Clustering becomes much more challenging in this context, since in addition to the difficulties of the traditional clustering problem, we have to deal with a space of clusterings. We generalize the concept of clustering in single-edge graphs to multi-edged graphs and investigate problems such as: Can we find a clustering that remains good, even if we change the relative weights of metrics? How can we describe the space of clusterings efficiently? Can we find unexpected clusterings (a good clustering that is distant from all given clusterings)? If given the ground-truth clustering, can we recover how the weights for edge types were aggregated? %In this paper, we discuss these problems and the underlying algorithmic challenges and propose some solutions. We also present two case studies: one based on papers on Arxiv and one based on CIA World Factbook.

Affiliated with

Also associated with

No associations

Rating

On Clustering on 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 On Clustering on Graphs with Multiple Edge Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Clustering on Graphs with Multiple Edge Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-474391