Algorithms for clustering data
Algorithms for clustering data
Feasible and infeasible maxima in a quadratic program for maximum clique
Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Continuous characterizations of the maximum clique problem
Mathematics of Operations Research
Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
Computer Vision and Image Understanding
Semantic Clustering of Index Terms
Journal of the ACM (JACM)
An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pairwise Data Clustering by Deterministic Annealing
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Factorization Approach to Grouping
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dominant Sets and Hierarchical Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
A new graph-theoretic approach to clustering and segmentation
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Fast communication: Dominant sets clustering for image retrieval
Signal Processing
Consensus Graphs for Symmetry Plane Estimation
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Expert Systems with Applications: An International Journal
A game-theoretic approach to partial clique enumeration
Image and Vision Computing
Combining graph connectivity & dominant set clustering for video summarization
Multimedia Tools and Applications
Hierarchical Pairwise Segmentation Using Dominant Sets and Anisotropic Diffusion Kernels
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Soccer Video Shot Classification Based on Color Characterization Using Dominant Sets Clustering
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
A continuous-based approach for partial clique enumeration
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Szemerédi's regularity lemma and its applications to pairwise clustering and segmentation
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Fast population game dynamics for dominant sets and other quadratic optimization problems
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
A new spectral bound on the clique number of graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Video scene detection using graph-based representations
Image Communication
Efficient clustering earth mover's distance
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Graph-based quadratic optimization: A fast evolutionary approach
Computer Vision and Image Understanding
Dominant sets based movie scene detection
Signal Processing
High order structural matching using dominant cluster analysis
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
Multiple-instance learning with instance selection via dominant sets
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Detecting F-formations as dominant sets
ICMI '11 Proceedings of the 13th international conference on multimodal interfaces
Common visual pattern discovery via graph matching
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Contour-based object detection as dominant set computation
Pattern Recognition
Graph transduction as a noncooperative game
Neural Computation
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Mobile video surveillance systems: an architectural overview
Mobile Multimedia Processing
Dense Neighborhoods on Affinity Graph
International Journal of Computer Vision
In quest of the missing neuron: Spike sorting based on dominant-sets clustering
Computer Methods and Programs in Biomedicine
Evolutionary Hough Games for coherent object detection
Computer Vision and Image Understanding
Towards hierarchical clustering
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
An enriched game-theoretic framework for multi-objective clustering
Applied Soft Computing
SMI 2013: Grouping real functions defined on 3D surfaces
Computers and Graphics
Is data clustering in adversarial settings secure?
Proceedings of the 2013 ACM workshop on Artificial intelligence and security
Hash Bit Selection Using Markov Process for Approximate Nearest Neighbor Search
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Deflation-based power iteration clustering
Applied Intelligence
Hi-index | 0.15 |
We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a notion introduced here which generalizes that of a maximal complete subgraph to edge-weighted graphs. We establish a correspondence between dominant sets and the extrema of a quadratic form over the standard simplex, thereby allowing the use of straightforward and easily implementable continuous optimization techniques from evolutionary game theory. Numerical examples on various point-set and image segmentation problems confirm the potential of the proposed approach.