A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Histogram clustering for unsupervised segmentation and image retrieval
Pattern Recognition Letters
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Recognizing Indoor Images with Unsupervised Segmentation and Graph Matching
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Toward Global Solution to MAP Image Estimation: Using Common Structure of Local Solutions
EMMCVPR '97 Proceedings of the First International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Statistical Models for Co-occurrence Data
Statistical Models for Co-occurrence Data
Central Clustering of Attributed Graphs
Machine Learning
Learning Shape-Classes Using a Mixture of Tree-Unions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A spectral approach to learning structural variations in graphs
Pattern Recognition
Graph embedding using tree edit-union
Pattern Recognition
Region and constellations based categorization of images with unsupervised graph learning
Image and Vision Computing
A generative model for graph matching and embedding
Computer Vision and Image Understanding
Constellations and the unsupervised learning of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Spectral edit distance method for image clustering
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Computer Vision and Image Understanding
A spectral generative model for graph structure
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A model-based approach to attributed graph clustering
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph matching and clustering using kernel attributes
Neurocomputing
| Hi-index | 0.00 |
In a previous work we have adapted the Asymmetric Clustering Model (ACM) to the domain of non-attributed graphs. We use our Comb algorithm for graph matching, a population-based method which performs multi-point explorations of the discrete space of feasible solutions. Given this algorithm we define an incremental method to obtain a prototypical graph by fusing the elements of the ensemble weighted by their prior probabilities of belonging to the class. Graph-matching and incremental fusion are integrated in a EM clustering algorithm. In this paper, we adapt the latter ACM clustering model to deal with attributed graphs, where these attributes are probability density functions associated to nodes and edges. In order to do so, we modify the incremental method for obtaining a prototypical graph to update these pdf's provided that they are statistically compatible with those of the corresponding nodes and edges. This graph-clustering approach is successfully tested in the domain of Mondrian images (images built on rectangular patches of colored textures) because our final purpose is to the unsupervised learning of image classes.