title: The depth problem: identifying the most representative units in a data group.
abstract: This paper presents a solution to the problem of how to identify the units in groups or clusters that have the greatest degree of centrality and best characterize each group. This problem frequently arises in the classification of data such as types of tumor, gene expression profiles or general biomedical data. It is particularly important in the common context that many units do not properly belong to any cluster. Furthermore, in gene expression data classification, good identification of the most central units in a cluster enables recognition of the most important samples in a particular pathological process. We propose a new depth function that allows us to identify central units. As our approach is based on a measure of distance or dissimilarity between any pair of units, it can be applied to any kind of multivariate data (continuous, binary or multiattribute data). Therefore, it is very valuable in many biomedical applications, which usually involve noncontinuous data, such as clinical, pathological, or biological data sources. We validate the approach using artificial examples and apply it to empirical data. The results show the good performance of our statistical approach.
authors.affiliation: Department of Computation Science and Artificial Intelligence, University of the Basque Country, Donostia, Spain. itziar.irigoien@ehu.es
authors.forename: Itziar
authors.initials: I
authors.lastname: Irigoien
authors.forename: Francesc
authors.initials: F
authors.lastname: Mestres
authors.forename: Concepción
authors.initials: C
authors.lastname: Arenas
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D016208:Databases, Factual; D020869:Gene Expression Profiling; D006801:Humans; D008954:Models, Biological; D009369:Neoplasms / Q000235:genetics / Q000378:metabolism; D015203:Reproducibility of Results