An ensemble learning strategy for graph clustering

@inproceedings{Ovelgnne2012AnEL,
  title={An ensemble learning strategy for graph clustering},
  author={Michael Ovelg{\"o}nne and Andreas Geyer-Schulz},
  booktitle={Graph Partitioning and Graph Clustering},
  year={2012}
}
This paper is on a graph clustering scheme inspired by ensemble learning. In short, the idea of ensemble learning is to learn several weak classifiers and use these weak classifiers to form a strong classifier. In this contribution, we use the generic procedure of ensemble learning and determine several weak graph clusterings (with respect to the objective function). From the partition given by the maximal overlap of these clusterings (the cluster cores), we continue the search for a strong… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

51 Citations

051015'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…