Identifying similar functional modules by a new hybrid spectral clustering method

Identifying similar functional modules by a new hybrid spectral clustering method

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Systems Biology — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Recently, a large number of researches have focused on finding cellular modules within protein–protein interaction networks. Until now, most of the works have concentrated on finding small modules and protein complexes. The authors have extended the concept of functional module and have identified larger functional modules which are the most similar to the entire network. To this end, a new hybrid spectral-based method is proposed here. First, the original graph is transformed into a line graph. Next, the nodes of the new graph are represented in the Euclidean space by using spectral methods and finally, a self-organising map is applied to the points in the new feature space. The experimental results show that similar modules, obtained from the proposed method, have own local hubs and lots of significant functional subunits concerning each other. These modules not only detect general biological processes that each protein is involved in, but also due to great similarities to the original network, it can be used as significant subnetworks for predicting protein function as detailed as possible. Some interesting properties of these modules are also investigated in this research. [Includes supplementary material]


    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • The use of edge-betweenness clustering to investigate biological function in protein interaction networks
    7. 7)
    8. 8)
    9. 9)
      • Evaluation of clustering algorithms for protein–protein interaction networks
    10. 10)
      • An automated method for finding molecular complexes in large protein interaction networks
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • Verma, D., Meila, M.: `A comparison of spectral clustering algorithms', Technical report, 2003
    21. 21)
      • On spectral clustering: analysis and an algorithm
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
      • Unsupervised learning: the elements of statistical learning
    27. 27)
    28. 28)
    29. 29)
    30. 30)
      • Diffusion maps, spectral clustering and eigenfunctions of Fokker–Planck operators
    31. 31)
    32. 32)
    33. 33)
    34. 34)
      • Cho, Y.-R., Zhang, A.: `Restructuring protein interaction networks to reveal structural hubs and functional organizations', IEEE Int. Conf. on Bioinformatics and Biomedicine, November 2009, Washington, DC, USA, p. 105–110
    35. 35)
    36. 36)
    37. 37)
    38. 38)

Related content

This is a required field
Please enter a valid email address