Novel Ranking Methods Applied to Complex Membership Determination Problems

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.
Type de document :
Communication dans un congrès
Khalid Saeed; Václav Snášel. 13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. Springer, Lecture Notes in Computer Science, LNCS-8838, pp.89-99, 2014, Computer Information Systems and Industrial Management. 〈10.1007/978-3-662-45237-0_10〉
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01405566
Contributeur : Hal Ifip <>
Soumis le : mercredi 30 novembre 2016 - 10:53:24
Dernière modification le : mardi 10 octobre 2017 - 14:58:01
Document(s) archivé(s) le : lundi 27 mars 2017 - 07:40:23

Fichier

978-3-662-45237-0_10_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Loc Tran, Linh Tran, Hoang Trang. Novel Ranking Methods Applied to Complex Membership Determination Problems. Khalid Saeed; Václav Snášel. 13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. Springer, Lecture Notes in Computer Science, LNCS-8838, pp.89-99, 2014, Computer Information Systems and Industrial Management. 〈10.1007/978-3-662-45237-0_10〉. 〈hal-01405566〉

Partager

Métriques

Consultations de la notice

28

Téléchargements de fichiers

28