Abstract
In this paper, we would like to present our research result to build a graph clustering system using the SOM neural network and graph spectra. We use this system to support the visualization of similar protein structures in graph database of protein structures. Graph spectra is a set of eigenvalues of the normalized Laplacian matrix representing the graph. These eigenvalues are sorted in descendant order. We create a feature vector of sorted eigenvalues in descendant order to represent graph. SOM neural network is used to cluster the graph spectra; graph distance is Euclidean distance between graph spectra. Using graph spectra, we can improve the speed of training phase of SOM neural network. After clustering, the 2D SOM output layer will create the clusters of similar protein structures. By putting 2D SOM output layer on the computer display, we can visualize the similar protein structures of database by moving around the computer display. Our proposed solution was tested with the protein structures downloaded from SCOP database which was created by manual inspection and automated methods for description of the structural and evolutionary relationships between all proteins known. Our results are compared with the SCOP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brew, C.: Schulte im Walde Spectral Clustering for German Verbs. In: Proc. of the Conf. in Natural Language Processing, Philadelphia, PA, pp. 117–124 (2002)
Auffarth, B.: Spectral Graph Clustering. Universitat de Barcelona, course report for Technicas Avanzadas de Aprendizaj, at Universitat Politecnica de Catalunya (2007)
Phuc, D., Hung, M.X.: Using SOM based graph clustering for extracting main ideas from documents. In: Proc. of IEEE RIVF 2008, pp. 209–214 (2008)
Bunke, H., Shearer, K.: Graph distance metric based on the maximal common sub-graph. Pattern Recognition letter 19, 225–229 (1998)
Vesanto, J.: SOM based data visualization. Helsinki University of Technology, Finland (1999)
Kaski, S., Honkela, T., Lagus, K., Kohonen, T.: WEBSOM–self-organizing maps of document collections. Neuro computing 21 (1998)
Wilson, R.C., Zhu, P.: A Study of graph spectra for comparing graphs and trees. CS Department, University of York, UK (2008)
Murzin, A.G., Brenner, S., Hubbard, T., Chothia, C.: SCOP: a structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology 247, 536–540 (1995)
Vishveshwara, S., et al.: Protein structure insights from graph theory. Journal of Theoretical and Computational Chemistry 1(1) (2002)
Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23(4), 405–417 (2002)
Lang, S.: Protein domain decomposition using spectral graph partition, CS Department, University of York, UK (2008)
Suters, W.H.: A new approach and faster exact methods for the maximum common sub-graph problem. In: Proceedings 11th International Computing and Combinatorics (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phuc, D., Phung, N.T.K. (2010). Visualization of the Similar Protein Structures Using SOM Neural Network and Graph Spectra. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-12101-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12100-5
Online ISBN: 978-3-642-12101-2
eBook Packages: Computer ScienceComputer Science (R0)