Reference : Clustering approaches for visual knowledge exploration in molecular interaction networks.
Scientific journals : Article
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/37040
Clustering approaches for visual knowledge exploration in molecular interaction networks.
English
Ostaszewski, Marek mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) >]
Kieffer, Emmanuel mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
Danoy, Gregoire mailto [> >]
Schneider, Reinhard mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) >]
Bouvry, Pascal mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
2018
BMC bioinformatics
19
1
308
Yes (verified by ORBilu)
International
1471-2105
1471-2105
England
[en] Algorithms ; Cluster Analysis ; Computational Biology/methods ; Computer Graphics ; Data Mining/methods ; Databases, Factual ; Gene Regulatory Networks ; Humans ; Bi-level optimization ; Clustering ; Evolutionary algorithms ; Knowledge discovery ; Molecular diagrams ; Ontology
[en] BACKGROUND: Biomedical knowledge grows in complexity, and becomes encoded in network-based repositories, which include focused, expert-drawn diagrams, networks of evidence-based associations and established ontologies. Combining these structured information sources is an important computational challenge, as large graphs are difficult to analyze visually. RESULTS: We investigate knowledge discovery in manually curated and annotated molecular interaction diagrams. To evaluate similarity of content we use: i) Euclidean distance in expert-drawn diagrams, ii) shortest path distance using the underlying network and iii) ontology-based distance. We employ clustering with these metrics used separately and in pairwise combinations. We propose a novel bi-level optimization approach together with an evolutionary algorithm for informative combination of distance metrics. We compare the enrichment of the obtained clusters between the solutions and with expert knowledge. We calculate the number of Gene and Disease Ontology terms discovered by different solutions as a measure of cluster quality. Our results show that combining distance metrics can improve clustering accuracy, based on the comparison with expert-provided clusters. Also, the performance of specific combinations of distance functions depends on the clustering depth (number of clusters). By employing bi-level optimization approach we evaluated relative importance of distance functions and we found that indeed the order by which they are combined affects clustering performance. Next, with the enrichment analysis of clustering results we found that both hierarchical and bi-level clustering schemes discovered more Gene and Disease Ontology terms than expert-provided clusters for the same knowledge repository. Moreover, bi-level clustering found more enriched terms than the best hierarchical clustering solution for three distinct distance metric combinations in three different instances of disease maps. CONCLUSIONS: In this work we examined the impact of different distance functions on clustering of a visual biomedical knowledge repository. We found that combining distance functions may be beneficial for clustering, and improve exploration of such repositories. We proposed bi-level optimization to evaluate the importance of order by which the distance functions are combined. Both combination and order of these functions affected clustering quality and knowledge recognition in the considered benchmarks. We propose that multiple dimensions can be utilized simultaneously for visual knowledge exploration.
http://hdl.handle.net/10993/37040
10.1186/s12859-018-2314-z

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
s12859-018-2314-z.pdfPublisher postprint1.07 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.