Abstract
The biological motivated problem that we want to solve in this paper is to predict the new members of a partially known protein complex (i.e. complex membership determination). In this problem, we are given a core set of proteins (i.e. the queries) making up a protein complex. However, the biologist experts do not know whether this core set is complete or not. Our objective is to find more potential members of the protein complex by ranking proteins in protein-protein interaction network. One of the solutions to this problem is a network reliability based method. Due to high time complexity of this method, the random walk on graphs method has been proposed to solve this complex membership determination problem. However, the random walk on graphs method is not the current state of the art network-based method solving bioinformatics problem. In this paper, the novel un-normalized graph (p-) Laplacian based ranking method will be developed based on the un-normalized graph p-Laplacian operator definitions such as the curvature operator of graph (i.e. the un-normalized graph 1-Laplacian operator) and will be used to solve the complex membership determination problem. The results from experiments shows that the un-normalized graph p-Laplacian ranking methods are at least as good as the current state of the art network-based ranking method (p=2) but often lead to better ranking accuracy performance measures.
Chapter PDF
Similar content being viewed by others
References
Tran, L.: Application of three graph Laplacian based semi-supervised learning methods to protein function prediction problem. CoRR abs/1211.4289 (2012)
Tran, L.: Hypergraph and protein function prediction with gene ex-pression data CoRR abs/1212.0388 (2012)
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., Sakaki, Y.: A com-prehensive two-hybrid analysis to explore the yeast protein interac-tome. Proc. Natl. Acad. Sci. 98, 4569–4574 (2001)
Uetz, P., Cagney, G., Mansfield, T.A., Judson, R., Knight, J.R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P.: A comprehensive analysis of protein-protein interactions in saccharomyces cerevisiae. Nature 403, 623–627 (2000)
Gavin, A.C., Bosche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J.M., Michon, A.M., Cruciat, C.M.: Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415, 141–147 (2002)
Ho, Y., Gruhler, A., Heilbut, A., Bader, G.D., Moore, L., Adams, S.L., Millar, A., Taylor, P., Bennett, K., Boutilier, K.: Systematic identification of protein complexes in saccharomyces cerevisiae by mass spectrometry. Nature 415, 180–183 (2002)
Tsuda K., Shin H.H., and Schoelkopf B. Fast protein classification with multiple networks. Bioinformatics (ECCB 2005) 21(suppl. 2), ii59–ii65 (2005)
Lanckriet, G.R.G., Deng, M., Cristianini, N., Jordan, M.I., Noble, W.S.: Kernel-based data fusion and its application to protein function prediction in yeast. In: Pacific Symposium on Biocomputing (PSB) (2004)
Letovsky, S., Kasif, S.: Predicting protein function from pro-tein/protein interaction data: a probabilistic approach Bioinformatics 19, i197–i204 (2003)
Tsuda, K., Noble, W.S.: Learning kernels from biological networks by maximizing entropy. Bioinformatics 20(S1), i326–i333 (2004)
Tran, L.: The un-normalized graph p-Laplacian based semi-supervised learning method and protein function prediction problem. In: The Fifth International Conference on Knowledge Systems and Engineer (2013)
Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex membership using probabilistic network reliability. Genome Research 14, 1170–1175 (2004)
Can, T., Camoglu, O., Singh, A.K.: Analysis of protein-protein interaction networks using random walks. In: Proceedings of the 5th ACM SIGKDD Workshop on Data Mining in Bioinformatics, Chicago (August 2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30, 107–117 (1998)
Tran, L., Tran, L.: Un-normalized graph p-Laplacian semi-supervised learning method applied to cancer classification problem. In: The Second International Conference on Intelligent and Automation Systems (2014)
Zhou, D., Schölkopf, B.: Discrete Regularization. In: Chapelle, O., Schölkopf, B., Zien, A. (eds.) Semi-Supervised Learning, pp. 221–232. MIT Press, Cambridge (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Tran, L.H., Tran, L.H., Trang, H. (2014). Novel Ranking Methods Applied to Complex Membership Determination Problems. In: Saeed, K., Snášel, V. (eds) Computer Information Systems and Industrial Management. CISIM 2015. Lecture Notes in Computer Science, vol 8838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45237-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-45237-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45236-3
Online ISBN: 978-3-662-45237-0
eBook Packages: Computer ScienceComputer Science (R0)