Abstract
In this paper, we are interested in the problem of graph clustering. We propose a new algorithm for computing the median of a set of graphs. The concept of median allows the extension of conventional algorithms such as the k-means to graph clustering, helping to bridge the gap between statistical and structural approaches to pattern recognition. Experimental results show the efficiency of the new median graph algorithm compared to the (only) existing algorithm in the literature. We also show its effective use in clustering a set of random graphs and in a content-based synthetic image retrieval system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Luo B, Wilson RC, Hancock ER (2002) Spectral feature vectors for graph clustering. In: IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (S+SSPR), Windsor, Canada, LNCS 2396, pp 83–93
Messmer B, Bunke H (1995) Subgraph isomorphism in polynomial time. Technical report TR-IAM-95–003
Jiang X, Munger A, Bunke H (2001) On median graphs: Properties, algorithms, and applications. IEEE Trans. PAMI 23(10):1–1
Gunter S, Bunke H (2001) Validation indices for graph clustering. In: Proceedings of 3rd IAPR-TC-15 Workshop on Graph-based Representations in Pattern Recognition, Ischia, Italy, pp 23–25
Englert R, Glantz R (2000) Towards the clustering of graphs. In: Proceedings of 2nd IAPR-TC-15 Workshop on Graph-based Representations in Pattern Recognition, Austria, pp 125–133
Hlaoui A, Wang S (2002a) A new algorithm for inexact graph matching. In 16th International Conference on Pattern Recognition, Quebec, Canada
Hlaoui A, Wang S (2002b) A new algorithm for graph matching with application to content-based image retrieval. In: IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (S+SSPR), Windsor, Canada, LNCS 2396, pp 291–300
Hlaoui A, Wang S (2003) A new median graph algorithm. In: Proceedings of the 4th IAPR Workshop on Graph-based Representations in Pattern Recognition, 30 June–2 July 2003, pp 239–249, York, UK
Jiang X, Bunke H (2002) Optimal lower bound for generalized median problems in metric space. In: IAPR International Workshop on structural, syntactic and statistical pattern recognition (S+SSPR), Windsor, Canada, LNCS 2396, pp 143–151
Sossa H, Horaud R (1992) Model indexing: The graph-hashing approach. In: Proceedings of IEEE conference on computer vision and pattern recognition, June 1992. Champaign, IL, pp. 811-814
Kosinov S, Caelli T (2002) Inexact multisubgraph matching using graph eigenspace and clustering models. In: IAPR International workshop on structural, syntactic and statistical pattern recognition (S+SSPR), Windsor, Canada, LNCS 2396, pp 133–142
MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley symposium on mathematical statistics and probability. vol I, Statistics, Le Cam LM, Neyman J. (Eds). University of California Press
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hlaoui, A., Wang, S. Median graph computation for graph clustering. Soft Comput 10, 47–53 (2006). https://doi.org/10.1007/s00500-005-0464-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-005-0464-1