Grouping with Asymmetric Affinities: A Game-Theoretic Perspective

@article{Torsello2006GroupingWA,
  title={Grouping with Asymmetric Affinities: A Game-Theoretic Perspective},
  author={Andrea Torsello and Samuel Rota Bul{\`o} and Marcello Pelillo},
  journal={2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)},
  year={2006},
  volume={1},
  pages={292-299}
}
Pairwise grouping and clustering approaches have traditionally worked under the assumption that the similarities or compatibilities between the elements to be grouped are symmetric. However, asymmetric compatibilities arise naturally in many areas of computer vision and pattern recognition. Hence, there is a need for a new generic approach to clustering and grouping that can deal with asymmetries in the compatibilities. In this paper, we present a generic framework for grouping and clustering… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

80 Citations

051015'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Buhmann . Optimal cluster preserving embedding of nonmetric proximity data

  • J. Laub V. Roth, M. Kawanabe, M. J.
  • Proc . IEEE Conf . Computer Vision and Pattern…
  • 2003

Buhmann . Pairwise data clustering by deterministic annealing

  • M. J.
  • Proc . IEEE Conf . Computer Vision and Pattern…
  • 2003

Similar Papers

Loading similar papers…