Journal ArticleDOI
Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
Susanna Röblitz,Marcus Weber +1 more
TLDR
It is demonstrated in this paper that PCCA+ always delivers an optimal fuzzy clustering for nearly uncoupled, not necessarily reversible, Markov chains with transition states.Abstract:
Given a row-stochastic matrix describing pairwise similarities between data objects, spectral clustering makes use of the eigenvectors of this matrix to perform dimensionality reduction for clustering in fewer dimensions. One example from this class of algorithms is the Robust Perron Cluster Analysis (PCCA+), which delivers a fuzzy clustering. Originally developed for clustering the state space of Markov chains, the method became popular as a versatile tool for general data classification problems. The robustness of PCCA+, however, cannot be explained by previous perturbation results, because the matrices in typical applications do not comply with the two main requirements: reversibility and nearly decomposability. We therefore demonstrate in this paper that PCCA+ always delivers an optimal fuzzy clustering for nearly uncoupled, not necessarily reversible, Markov chains with transition states.read more
Citations
More filters
Posted ContentDOI
Effect of Histidine Covalent Modification on Strigolactone Receptor Activation and Selectivity
Liming Chen,Diwakar Shukla +1 more
TL;DR: Using molecular dynamics simulations, it is demonstrated that the presence of the covalent butenolide enhances activation in both At D14 and ShHTL7, but the enhancement is ∼50 times greater in Sh HTL7.
Journal ArticleDOI
The Augmented Jump Chain
TL;DR: The augmented jump chain inherits the sparseness of the infinitesimal generator of the original process and therefore provides a useful tool for studying time-dependent dynamics even in high dimensions.
Journal ArticleDOI
Selecting Features for Markov Modeling: A Case Study on HP35.
TL;DR: In this paper , the authors adopt the folding of villin headpiece (HP35) as a well-established model problem, and discuss the selection of suitable input coordinates or "features", such as backbone dihedral angles and interresidue distances.
Dissertation
Computational studies of Glucocerebrosidase in complex with its facilitator protein Saposin-C
TL;DR: A reliable model of the complex of the enzyme GCase with its facilitator protein, Saposin-C (Sap-C) was generated using Protein-Protein docking (PPD) and supports the activation mechanism hyphothesis.
Journal ArticleDOI
Reweighting non-equilibrium steady-state dynamics along collective variables
TL;DR: In this paper, the authors proposed a maximum-caliber approach for dynamical reweighting of trajectories of complex systems at a single thermodynamic state point, which can be dynamically reweighted both from and to equilibrium or non-equilibrium steady states.
References
More filters
Book
Perturbation theory for linear operators
TL;DR: The monograph by T Kato as discussed by the authors is an excellent reference work in the theory of linear operators in Banach and Hilbert spaces and is a thoroughly worthwhile reference work both for graduate students in functional analysis as well as for researchers in perturbation, spectral, and scattering theory.
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
A tutorial on spectral clustering
TL;DR: In this article, the authors present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches, and discuss the advantages and disadvantages of these algorithms.
Proceedings Article
On Spectral Clustering: Analysis and an algorithm
TL;DR: A simple spectral clustering algorithm that can be implemented using a few lines of Matlab is presented, and tools from matrix perturbation theory are used to analyze the algorithm, and give conditions under which it can be expected to do well.
Journal ArticleDOI
Laplacian Eigenmaps for dimensionality reduction and data representation
Mikhail Belkin,Partha Niyogi +1 more
TL;DR: In this article, the authors proposed a geometrically motivated algorithm for representing high-dimensional data, based on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold and the connections to the heat equation.