Clustering based on random graph model embedding vertex features

@article{Zanghi2010ClusteringBO,
  title={Clustering based on random graph model embedding vertex features},
  author={Hugo Zanghi and Stevenn Volant and Christophe Ambroise},
  journal={Pattern Recognition Letters},
  year={2010},
  volume={31},
  pages={830-836}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Similar Papers

Loading similar papers…