Clustering based on Random Graph Model embedding Vertex Features

Details Clustering based on Random Graph Model embedding Vertex Features Clustering based on Random Graph Model embedding Vertex Features

2009-10-12

arxiv.org/abs/0910.2107v1

Statistics

Applications

Scientific paper

Large datasets with interactions between objects are common to numerous scientific fields (i.e. social science, internet, biology...). The interactions naturally define a graph and a common way to explore or summarize such dataset is graph clustering. Most techniques for clustering graph vertices just use the topology of connections ignoring informations in the vertices features. In this paper, we provide a clustering algorithm exploiting both types of data based on a statistical model with latent structure characterizing each vertex both by a vector of features as well as by its connectivity. We perform simulations to compare our algorithm with existing approaches, and also evaluate our method with real datasets based on hyper-textual documents. We find that our algorithm successfully exploits whatever information is found both in the connectivity pattern and in the features.

Affiliated with

Also associated with

No associations

Rating

Clustering based on Random Graph Model embedding Vertex Features 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 Clustering based on Random Graph Model embedding Vertex Features, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering based on Random Graph Model embedding Vertex Features will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-464177