Dissecting random and systematic differences between noisy composite data sets

被引:33
|
作者
Diederichs, Kay [1 ]
机构
[1] Univ Konstanz, Dept Biol, Univ Str 19, D-78457 Constance, Germany
关键词
random and systematic error; correlation coefficient; eigenanalysis; sparse data; isomorphism; classification; dimensionality reduction; SERIAL CRYSTALLOGRAPHY; MISSING DATA; DATA QUALITY; MODEL;
D O I
10.1107/S2059798317000699
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Composite data sets measured on different objects are usually affected by random errors, but may also be influenced by systematic (genuine) differences in the objects themselves, or the experimental conditions. If the individual measurements forming each data set are quantitative and approximately normally distributed, a correlation coefficient is often used to compare data sets. However, the relations between data sets are not obvious from the matrix of pairwise correlations since the numerical value of the correlation coefficient is lowered by both random and systematic differences between the data sets. This work presents a multidimensional scaling analysis of the pairwise correlation coefficients which places data sets into a unit sphere within low-dimensional space, at a position given by their CC* values [as defined by Karplus & Diederichs (2012), Science, 336, 1030-1033] in the radial direction and by their systematic differences in one or more angular directions. This dimensionality reduction can not only be used for classification purposes, but also to derive data-set relations on a continuous scale. Projecting the arrangement of data sets onto the subspace spanned by systematic differences (the surface of a unit sphere) allows, irrespective of the random-error levels, the identification of clusters of closely related data sets. The method gains power with increasing numbers of data sets. It is illustrated with an example from low signal-to-noise ratio image processing, and an application in macromolecular crystallography is shown, but the approach is completely general and thus should be widely applicable.
引用
收藏
页码:286 / 293
页数:8
相关论文
共 50 条
  • [1] Probabilistic Random Forest: A Machine Learning Algorithm for Noisy Data Sets
    Reis, Itamar
    Baron, Dalya
    Shahaf, Sahar
    ASTRONOMICAL JOURNAL, 2019, 157 (01):
  • [2] ASSESSING QUALITATIVE DIFFERENCES BETWEEN SETS OF DATA
    TISDALE, JR
    JOURNAL OF PSYCHOLOGY, 1967, 66 (02): : 175 - &
  • [3] Systematic and random error components in satellite precipitation data sets
    AghaKouchak, Amir
    Mehran, Ali
    Norouzi, Hamidreza
    Behrangi, Ali
    GEOPHYSICAL RESEARCH LETTERS, 2012, 39
  • [4] Data Driven Computing with noisy material data sets
    Kirchdoerfer, T.
    Ortiz, M.
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2017, 326 : 622 - 641
  • [5] Sums and differences of correlated random sets
    Do, Thao
    Kulkarni, Archit
    Miller, Steven J.
    Moon, David
    Wellens, Jake
    JOURNAL OF NUMBER THEORY, 2015, 147 : 44 - 68
  • [6] Surface reconstruction of noisy and defective data sets
    Xie, H
    McDonnell, KT
    Qin, H
    IEEE VISUALIZATION 2004, PROCEEEDINGS, 2004, : 259 - 266
  • [7] Individual Differences in Explaining Noisy Data
    Little, Daniel R.
    Shiffrin, Richard M.
    COGNITION IN FLUX, 2010, : 520 - 520
  • [8] Data depth for measurable noisy random functions
    Nagy, Stanislav
    Ferraty, Frederic
    JOURNAL OF MULTIVARIATE ANALYSIS, 2019, 170 : 95 - 114
  • [9] CALCULATING LYAPUNOV EXPONENTS FOR SHORT AND OR NOISY DATA SETS
    BROWN, R
    PHYSICAL REVIEW E, 1993, 47 (06): : 3962 - 3969
  • [10] DISSECTING THE MOLECULAR DIFFERENCES BETWEEN CHRONIC KIDNEY DISEASE SUBTYPES FROM TRANSCRIPTOMICS DATA
    Tajti, Ferenc
    Kuppe, Christoph
    Antoranz, Asier
    Ibrahim, Mahmoud
    Kim, Hyojin
    Ceccarelli, Francesco
    Holland, Christian
    Olauson, Hannes
    Floege, Juergen
    Alexopoulos, Leonidas G.
    Kramann, Rafael
    Saez-Rodriguez, Julio
    NEPHROLOGY DIALYSIS TRANSPLANTATION, 2019, 34