Bayesian Fuzzy Clustering of Colored Graphs
With the increasing availability of interaction data stemming form fields as diverse as systems biology, telecommunication or social sciences, the task of mining and understanding the underlying graph structures becomes more and more important. Here we focus on data with different types of nodes; we subsume this meta information in the color of a node. An important first step is the unsupervised clustering of nodes into communities, which are of the same color and highly connected within but sparsely connected to the rest of the graph. Recently we have proposed a fuzzy extension of this clustering concept, which allows a node to have membership in multiple clusters. The resulting gradient descent algorithm shared many similarities with the multiplicative update rules from nonnegative matrix factorization. Two issues left open were the determination of the number of clusters of each color, as well as the non-defined integration of additional prior information. In this contribution we resolve these issues by reinterpreting the factorization in a Bayesian framework, which allows the ready inclusion of priors. We integrate automatic relevance determination to automatically estimate group sizes. We derive a maximum-a-posteriori estimator, and illustrate the feasibility of the approach on a toy as well as a protein-complex hypergraph, where the resulting fuzzy clusters show significant enrichment of distinct gene ontology categories.
KeywordsFuzzy Cluster Community Detection Colored Graph Nonnegative Matrix Factorization Fuzzy Graph
Unable to display preview. Download preview PDF.
- 1.Bishop, C.: Bayesian pca. In: Proc. NIPS 1999 (1999)Google Scholar
- 2.Blöchl, F., Hartsperger, M., Stümpflen, V., Theis, F.: Uncovering the structure of heterogeneus biological data: fuzzy graph partitioning in the k-partite setting. In: Proc. GCB 2010 (2010)Google Scholar
- 3.Hartsperger, M., Blöchl, F., Stümpflen, V., Theis, F.: Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs. BMC Bioinformatics 11(522) (2010)Google Scholar
- 4.Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature 40, 788–791 (1999)Google Scholar
- 5.Lee, D., Seung, H.: Algorithms for non-negative matrix factorization. In: Proc. NIPS 2000, vol. 13, pp. 556–562. MIT Press (2001)Google Scholar
- 6.Long, B., Wu, X., Zhang, Z., Yu, P.: Unsupervised learning on k-partite graphs. In: Proc. SIGKDD 2006, pp. 317–326 (2006)Google Scholar
- 9.Psorakis, I., Roberts, S., Sheldon, B.: Efficient bayesian community detection using non-negative matrix factorisation (2010) (submitted)Google Scholar
- 10.Ruepp, A., Brauner, B., Dunger-Kaltenbach, I., Frishman, G., Montrone, C., Stransky, M., Waegele, B., Schmidt, T., Doudieu, O.N., Stumpflen, V., Mewes, H.W.: Corum: the comprehensive resource of mammalian protein complexes. Nucleic Acids Res. 36(Database issue), D646–D650 (2008)Google Scholar
- 11.Tan, V., Févotte, C.: Automatic relevance determination in nonnegative matrix factorization. In: SPARS 2009 - Signal Processing with Adaptive Sparse Structured Representations, pp. 1–19 (2009)Google Scholar