Abstract
Partitioning a data set of attributed graphs into clusters arises in different application areas of structural pattern recognition and computer vision. Despite its importance, graph clustering is currently an underdeveloped research area in machine learning due to the lack of theoretical analysis and the high computational cost of measuring structural proximities. To address the first issue, we introduce the concept of metric graph spaces that enables central (or center-based) clustering algorithms to be applied to the domain of attributed graphs. The key idea is to embed attributed graphs into Euclidean space without loss of structural information. In addressing the second issue of computational complexity, we propose a neural network solution of the K-means algorithm for structures (KMS). As a distinguishing feature to improve the computational time, the proposed algorithm classifies the data graphs according to the principle of elimination of competition where the input graph is assigned to the winning model of the competition. In experiments we investigate the behavior and performance of the neural KMS algorithm.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Ballard, D. H., & Brown, C. M. (1982). Computer Vision. Prentice Hall, Englewood Cliffs, New Jersey.
Ballard, D. H., Gardner, P.C., & Srinivas, M. A. (1987). Graph problems and connectionist architectures. Technical Report TR 167, Dept. Computer Science, University of Rochester.
Bezdek, J. C. (1981). Pattern recogniton with fuzzy objective function algorithms. New York, NY: Plenum Press.
Bunke, H., Foggia, P., Guidobaldi, C., & Vento, M. (2003). Graph clustering using the weighted minimum common supergraph. In E. Hancock and M. Vento (Eds.), Graph based representations in pattern recognition. 4th IAPR international workshop, GbRPR 2003, LNCS 2726, Springer-Verlag (pp. 235–246).
Bunke, H., Münger, A., & Jiang, X. (1999). Combinatorial search versus genetic algorithms: A case study based on the generalized mean graph problem. Pattern Recognition Letters, 20:11–13, 1271–1277.
Carpenter, G. A., & Grossberg, S. (1987a). A massively parallel architecture for a self-organising neural pattern recognition machine. Computer Vision, Graphics, and Image Processing, 37, 54–115.
Carpenter, G. A., & Grossberg, S. (1987b). ART 2: Self-organisation of stable category recognition codes for analog input patterns. Applied Optics, 26, 4919–4930.
Carpenter, G. A., & Grossberg, S. (1988). The ART of adaptive pattern recognition by a self-organizing neural network. Computer, 21:3, 77–88.
Christmas, W. J., Kittler, J., & Petrou, M. (1995). Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:8, 749–764.
Cross, A. D. J., Wilson, R. C., & Hancock, E. R. (1997). Inexact graph matching with genetic search. Pattern Recognition, 30:6, 953–970.
Eshera, M. A., & Fu, K. S. (1986). An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8:5, 604–618.
Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York.
Gold, S., & Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:4, 377–388.
Gold, S., Rangarajan, A., & Mjolsness, E. (1996). Learning with preknowledge: Clustering with point and graph matching distance measures. Neural Computation, 8:4, 787–804.
Goldfarb, L., Abela, J., Bhavsar, V. C., & Kamat, V. N. (1995). Can a vector space based learning model discover inductive class generalization in a symbolic environment? Pattern Recognition Letters, 16, 719–726.
Günter, S., & Bunke, H. (2002). Adaptive self-organizing map in the graph domain. In H. Bunke and A. Kandel (Eds.), Hybrid methods in pattern recognition, World Scientific (pp. 61–74).
Günter, S., & Bunke, H. (2002). Self-organizing map for clustering in the graph domain. Pattern Recognition Letters, 23, 401–417.
Hagenbuchner, M., Sperduti, A., & Tsoi, A. C. (2003). A self-organizing map for adaptive processing of structured data. IEEE Transactions on Neural Networks, 14:3, 491–505.
Herault, L., Horaud, R., Veillon, F., & Niez, J. J. (1990). Symbolic image matching by simulated annealing. In Proceedings of British Machine Vision Conference (pp. 319–324).
Hofmann, T., & Buhmann, J. M. (1997). Pairwise data clustering by deterministic annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19:1, 1–14.
Hopfield, J. J., & Tank, D. W. (1985). Neural computation of decisions in optimization problems. Biological Cybernetics, 52, 141–152.
Palmer, R. G., Hertz, J., & Krogh, A. (1991). Introduction to the theory of neural computation. Redwood City, CA: Addison-Wesley.
Jain, B. J., & Wysotzki, F. The maximum ω-clique problem and the Hopfield ω-clique model. Submitted for publication.
Jain, B. J., & Wysotzki, F. The Schur-Hadamard inner product and maximum ω-cliques in an inner product graph. Submitted for publication.
Jain, B. J., & Wysotzki, F. Winner-takes-all classification of structures. Submitted for publication.
Jain, B. J., & Wysotzki, F. (2001). Distance-based classification of structures within a connectionist framework. In R. Klinkenberg et al. (Eds.), Proceedings Fachgruppentreffen Maschinelles Lernen.
Jain, B. J., & Wysotzki, F. (2002). Self-organizing recognition and classification of relational structures. In W. Gray and C. Schunn (Eds.), The 24th Annual meeting of the cognitive science society. Springer Verlag (pp. 163–173).
Jain, B. J., & Wysotzki, F. (2003). A competitive winner-takes-all architecture for classification and pattern recpgnition of structures. In E. Hancock and M. Vento (Eds.), Graph based representations in pattern recognition. 4th IAPR international workshop, GbRPR 2003, LNCS 2726, Springer-Verlag (pp. 259–270).
Jain, B. J., & Wysotzki, F. (2003). A k-winner-takes-all classifier for structured data. In A. Günter, R. Kruse, and B. Neumann (Eds.), KI 2003: Advances in artificial intelligence. 26th annual conference on AI, LNAI 2821, Springer-Verlag (pp. 342–354).
Jain, B. J., & Wysotzki, F. (2003). Perceptron learning in the domain of graphs. In Proc. of the International Joint Conference on Neural Networks, IJCNN 2003.
Jiang, X., Münger, A., & Bunke, H. (1999). Synthesis of representative symbols by computing generalized median graph. In Proceedings of the 3rd International Workshop on Graphics Recognition, GREC'99, Jaipur (pp. 187–194).
Jiang, X., Münger, A., & Bunke, H. (2001). On median graphs: Properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:10, 1144–1151.
Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43, 59–69.
Koutroumbas, K., & Kalouptsidis, N. (1994). Qualitative analysis of the parallel and asynchronous modes of the hamming network. IEEE Transactions on Neural Networks, 15:3, 380–391.
Lippman, R. P. (1987). An introduction to computing with neural nets. IEEE ASSP Magazine (pp. 4–22).
Lozano, M. A., & Escolano, F. (2003a). ACM attributed graph clustering for learning classes of images. In E. Hancock and M. Vento (Eds.), Graph based representations in pattern recognition. 4th IAPR international workshop, GbRPR 2003, LNCS 2726, Springer-Verlag (pp. 247–258).
Lozano, M. A., & Escolano, F. (2003b). Em algorithm for clustering an ensemble of graphs with comb matching. In A. Rangarajan, M. Figueiredo, and J. Zerubia (Eds.), Energy minimization methods in computer vision and pattern recognition, EMMCVPR 2003, LNCS 2683, Springer-Verlag (pp. 52–67).
Luo, B., Robles-Kelly, A., Torsello, A., Wilson, R. C., & Hancock, E. R. (2001a). Discovering shape categories by clustering shock trees. In W. Skarbek (Ed.), Computer analysis of images and patterns: 9th international conference, CAIP 2001, LNCS 2124, Springer-Verlag (pp. 152–160).
Luo, B., Robles-Kelly, A., Torsello, A., Wilson, R. C., & Hancock, E. R. (2001b). A probabilistic framework for graph clustering. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 912–919).
Luo, B., Wilson, R. C., & Hancock, E. R. (2003). Spectral embedding of graphs. Pattern Recognition, 36:10, 2213–2223.
Pelillo, M., Siddiqi, K., & Zucker, S. W. (1999). Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:11, 1105–1120.
Rangarajan, A., Gold, S., & Mjolsness, E. (1996). A novel optimizing network architecture with applications. Neural Computation, 8:5, 1041–1060.
Ruspini, E. H. (1969). A new approach to clustering. Information Control, 15, 22–32.
Sanfeliu, A., Serratosa, F., & Alquezar, R. (2000). Clustering of attributed graphs and unsupervised synthesis of function-described graphs. In Proceedings of the 15th International Conference on Pattern Recognition, ICPR'2000, Barcelona, Spain (pp. 1026–1029).
Sanfeliu, A., Serratosa, F., & Alquezar, R. (2002). Synthesis of function-described graphs and clustering of attributed graphs. International Journal of Pattern Recognition and Artificial Intelligence, 16:6, 621–655.
Schädler, K., & Wysotzki, F. (1999). Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11, 15–30.
Sengupta, K., & Boyer, K. (1995). Organising large structural databases. IEEE Transaction on Pattern Analysis and Machine Intelligence, 17:4, 321–332.
Shapiro, L. G., & Haralick, R. M. (1981). Structural descriptions and inexact matching. IEEE Transaction on Pattern Analysis and Machine Intelligence, 3, 514–519.
Suganthan, P., Teoh, E., & Mital, D. (1995). Pattern recognition by graph matching using potts mft networks. Pattern Recognition, 28, 997–1009.
Williams, M. L., Wilson, R. C., & Hancock, E. R. (1999). Deterministic search for relational graph matching. Pattern Recognition, 32:7, 1255–1271.
Wong, A., & You, M. (1985). Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7:5, 599–609.
Yu, S.-S., & Tsai, W.-H. (1992). Relaxation by the Hopfield neural network. Pattern Recognition, 25:2, 197–209.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jain, B.J., Wysotzki, F. Central Clustering of Attributed Graphs. Machine Learning 56, 169–207 (2004). https://doi.org/10.1023/B:MACH.0000033119.52532.ce
Issue Date:
DOI: https://doi.org/10.1023/B:MACH.0000033119.52532.ce