Algorithmic dimensionality reduction for molecular structure analysis

被引:60
|
作者
Brown, W. Michael [1 ]
Martin, Shawn [1 ]
Pollock, Sara N. [2 ,3 ,4 ]
Coutsias, Evangelos A. [4 ]
Watson, Jean-Paul [1 ]
机构
[1] Sandia Natl Labs, Albuquerque, NM 87185 USA
[2] Univ New Mexico, Dept Biochem, Albuquerque, NM 87131 USA
[3] Univ New Mexico, Mol Biol Div Biocomp, Albuquerque, NM 87131 USA
[4] Univ New Mexico, Dept Math, Albuquerque, NM 87131 USA
来源
JOURNAL OF CHEMICAL PHYSICS | 2008年 / 129卷 / 06期
关键词
D O I
10.1063/1.2968610
中图分类号
O64 [物理化学(理论化学)、化学物理学];
学科分类号
070304 ; 081704 ;
摘要
Dimensionality reduction approaches have been used to exploit the redundancy in a Cartesian coordinate representation of molecular motion by producing low-dimensional representations of molecular motion. This has been used to help visualize complex energy landscapes, to extend the time scales of simulation, and to improve the efficiency of optimization. Until recently, linear approaches for dimensionality reduction have been employed. Here, we investigate the efficacy of several automated algorithms for nonlinear dimensionality reduction for representation of trans, trans-1,2,4-trifluorocyclo-octane conformation-a molecule whose structure can be described on a 2-manifold in a Cartesian coordinate phase space. We describe an efficient approach for a deterministic enumeration of ring conformations. We demonstrate a drastic improvement in dimensionality reduction with the use of nonlinear methods. We discuss the use of dimensionality reduction algorithms for estimating intrinsic dimensionality and the relationship to the Whitney embedding theorem. Additionally, we investigate the influence of the choice of high-dimensional encoding on the reduction. We show for the case studied that, in terms of reconstruction error root mean square deviation, Cartesian coordinate representations and encodings based on interatom distances provide better performance than encodings based on a dihedral angle representation. (C) 2008 American Institute of Physics.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Algorithmic Feature Selection and Dimensionality Reduction in Signal Classification Tasks
    Zavadil, Jan
    Kus, Vaclav
    Chlada, Milan
    MATHEMATICAL MODELING IN PHYSICAL SCIENCES, IC-MSQUARE 2023, 2024, 446 : 187 - 193
  • [2] Hybrid structure for robust dimensionality reduction
    Lu, Xiaoqiang
    Yuan, Yuan
    NEUROCOMPUTING, 2014, 124 : 131 - 138
  • [3] Dimensionality Reduction with Subspace Structure Preservation
    Arpit, Devansh
    Nwogu, Ifeoma
    Govindaraju, Venu
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [4] Structure preserved fast dimensionality reduction
    Yi, Jihai
    Duan, Huiyu
    Wang, Jikui
    Yang, Zhengguo
    Nie, Feiping
    APPLIED SOFT COMPUTING, 2024, 162
  • [5] DEPENDENCE OF DIMENSIONALITY REDUCTION AND CLASSIFICATION ON STRUCTURE
    KANAL, LN
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1971, SMC1 (04): : 402 - &
  • [6] DIMENSIONALITY REDUCTION OF HYPERSPECTRAL IMAGES WITH LOCAL GEOMETRIC STRUCTURE FISHER ANALYSIS
    Luo, Fulin
    Huang, Hong
    Yang, Yaqiong
    Lv, ZhiYong
    2016 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM (IGARSS), 2016, : 52 - 55
  • [7] Fast and reliable analysis of molecular motion using proximity relations and dimensionality reduction
    Plaku, Erion
    Stamati, Hernan
    Clementi, Cecilia
    Kavraki, Lydia E.
    PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2007, 67 (04) : 897 - 907
  • [8] Dimensionality reduction for data of unknown cluster structure
    Nowakowska, Ewa
    Koronacki, Jacek
    Lipovetsky, Stan
    INFORMATION SCIENCES, 2016, 330 : 74 - 87
  • [9] Unsupervised approach for structure preserving dimensionality reduction
    Saxena, Amit
    Kothari, Megha
    PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON ADVANCES IN PATTERN RECOGNITION, 2007, : 315 - +
  • [10] Probabilistic Dimensionality Reduction via Structure Learning
    Wang, Li
    Mao, Qi
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (01) : 205 - 219