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 条
  • [21] Identifying Patterns and Relationships within Noisy Acoustic Data Sets
    Balakrishnan, Krithika
    Bar-Kochba, Eyal
    Iwaskiw, Alexander S.
    JOHNS HOPKINS APL TECHNICAL DIGEST, 2022, 36 (03): : 259 - 269
  • [22] Improved niching and encoding strategies for clustering noisy data sets
    Nasraoui, O
    Leon, E
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 1324 - 1325
  • [23] Surrogates for finding unstable periodic, orbits in noisy data sets
    Dolan, K
    Witt, A
    Spano, ML
    Neiman, A
    Moss, F
    PHYSICAL REVIEW E, 1999, 59 (05) : 5235 - 5241
  • [24] Graphical approach to weak motif recognition in noisy data sets
    Ho, Loi Sy
    Rajapakse, Jagath C.
    PATTERN RECOGNITION IN BIOINFORMATICS, PROCEEDINGS, 2006, 4146 : 23 - +
  • [25] TESTS FOR HIERARCHICAL STRUCTURE IN RANDOM DATA SETS
    ROHLF, FJ
    FISHER, DR
    SYSTEMATIC ZOOLOGY, 1968, 17 (04): : 407 - &
  • [26] Fractal interpolation functions for random data sets
    Luor, Dah-Chin
    CHAOS SOLITONS & FRACTALS, 2018, 114 : 256 - 263
  • [27] Random and fuzzy sets in coarse data analysis
    Nguyen, Hung T.
    Wu, Berlin
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2006, 51 (01) : 70 - 85
  • [28] Correlations of random classifiers on large data sets
    Věra Kůrková
    Marcello Sanguineti
    Soft Computing, 2021, 25 : 12641 - 12648
  • [29] Correlations of random classifiers on large data sets
    Kurkova, Vera
    Sanguineti, Marcello
    SOFT COMPUTING, 2021, 25 (19) : 12641 - 12648
  • [30] Learning kernel Perceptrons on noisy data using random projections
    Stempfel, Guillaume
    Ralaivola, Liva
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2007, 4754 : 328 - +