Publication

Co-clustering : A versatile Tool for Data Analysis in Biomedical Informatics

Giovanni De Micheli, Luca Benini
2007
Journal Articles

Abstract

Co-clustering has not been much exploited in biomedical in- formatics, despite its success in other domains. Most of the previous applications were limited to analyzing gene expression data. We performed co-clustering analysis on other types of data and obtained promising results, as summarized in this paper.

Official source

Giovanni De Micheli, Luca Benini
2007
Journal Articles

Abstract

Official source

Related concepts (12)

Data analysis

Data analysis is the process of inspecting, cleansing, transforming, and modeling data with the goal of discovering useful information, informing conclusions, and supporting decision-making. Data analysis has multiple facets and approaches, encompassing diverse techniques under a variety of names, and is used in different business, science, and social science domains. In today's business world, data analysis plays a role in making decisions more scientific and helping businesses operate more effectively.

Cluster analysis

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters). It is a main task of exploratory data analysis, and a common technique for statistical data analysis, used in many fields, including pattern recognition, , information retrieval, bioinformatics, data compression, computer graphics and machine learning.

K-means clustering

k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells. k-means clustering minimizes within-cluster variances (squared Euclidean distances), but not regular Euclidean distances, which would be the more difficult Weber problem: the mean optimizes squared errors, whereas only the geometric median minimizes Euclidean distances.

Related publications (34)

Co-clustering : A versatile Tool for Data Analysis in Biomedical Informatics

Graph Chatbot

A Human-Centric Approach to Explainable AI for Personalized Education

Nanoindentation hardness and modulus of Al2O3-SiO2-CaO and MnO-SiO2-FeO inclusions in iron

Data set for control of Ge island coalescence for the formation of nanowires on silicon