Dominant Sets and Pairwise Clustering

By Massimiliano Pavan, Marcello Pelillo. 2007

522 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Is data clustering in adversarial settings secure? (2013, background): “Indeed, C might be a hard or soft partition of D delivered by partitional clusterings algorithms such as k-means, fuzzy c-means or normalized cuts, or it could be a more general family of subsets of D such as the one delivered by the dominant sets clustering algorithm [22], or it can even be a param”
Face alignment by coarse-to-fine shape searching (2015, methodology): “In order to suppress their influence in computing the sub-region center, we adopt the dominant set approach [28] for estimating w.”
Expandable Data-Driven Graphical Modeling of Human Actions Based on Salient Postures (2008, background): “Choices of such a clustering algorithm include normalized cuts (NCuts) [43] and dominant sets (DSs) [44].”
Evolutionary Hough Games for coherent object detection (2012, unknown): “Indeed, it coincides with the idea of a Dominant Set, which has been recently introduced in [19,18] and generalizes the notion of maximal cliques to edge-weighted graphs.”
Multiobject tracking as maximum weight independent set (2011, methodology): “MWIS is often reformulated as the maximum weight clique (MWC) problem that uses a dual graph of the original [18].”
Cross-View Image Matching for Geo-Localization in Urban Environments (2017, methodology): “We use dominant sets [14, 15] to solve this problem.”
A new sentence similarity measure and sentence based extractive technique for automatic text summarization (2009, methodology): “In this section we use other criterion to assess sentence salience, proposed in paper (Pavan & Pelillo, 2007 ).”
Constrained Dominant Sets for Multimodal Document Question Answering (2026, unknown): “Dominant sets [16, 15] generalize maximal cliques by representing strict local maxima of a quadratic program on the simplex, while constrained dominant sets [17, 18] additionally require the cluster to include a user-specified seed.”