Tangent Phylogenetic PCA
نویسندگان
چکیده
Phylogenetic PCA (p-PCA) is a version of for observations that are leaf nodes phylogenetic tree. P-PCA accounts the fact such not independent, due to shared evolutionary history. The method works on Euclidean data, but in biology there need applying it data manifolds, particularly shapes. We provide generalization p-PCA lying Riemannian called Tangent p-PCA. thus makes possible perform dimension reduction set shapes, taking into account both non-linear structure shape space as well covariance. show simulation results sphere, demonstrating well-behaved error distributions and fast convergence estimators. Furthermore, we apply mammal jaws, represented points landmark manifold equipped with LDDMM metric.
منابع مشابه
Robust local tangent space alignment via iterative weighted PCA
Recently manifold learning has attracted extensive interest in machine learning and related communities. This paper investigates the noise manifold learning problem, which is a key issue in applying manifold learning algorithm to practical problems. We propose a robust version of LTSA algorithm called RLTSA. The proposed RLTSA algorithm makes LTSA more robust from three aspects: firstly robust ...
متن کاملTangent Algebras
We study the Zariski tangent cone TX π −→ X to an affine variety X and the closure TX of π−1(Reg(X)) in TX . We focus on the comparison between TX and TX , giving sufficient conditions on X in order that TX = TX . One aspect of the results is to understand when this equality takes place in the presence of the reducedness of the Zariski tangent cone. Our other interest is to consider conditions ...
متن کاملNew structures on the tangent bundles and tangent sphere bundles
In this paper we study a Riemanian metric on the tangent bundle T (M) of a Riemannian manifold M which generalizes Sasaki metric and Cheeger Gromoll metric and a compatible almost complex structure which together with the metric confers to T (M) a structure of locally conformal almost Kählerian manifold. This is the natural generalization of the well known almost Kählerian structure on T (M). W...
متن کاملTangent Codes
We interpret the finite Zariski tangent spaces Ta(X,Fqm) to an affine variety X ⊂ Fq n as linear codes. If the degree ofX is relatively prime to the characteristic p = charFq, we show that the minimum distance of Ta(X,Fqm) stabilizes while varying a ∈ X(Fqm) := X ∩ Fnqm and m ∈ N. The article provides a pseudocode for obtaining the generic minimum distance of a tangent code and points, at which...
متن کاملTransformation Invariance in Pattern Recognition - Tangent Distance and Tangent Propagation
In pattern recognition, statistical modeling, or regression, the amount of data is the most critical factor a ecting the performance. If the amount of data and computational resources are near in nite, many algorithms will provably converge to the optimal solution. When this is not the case, one has to introduce regularizers and a-priori knowledge to supplement the available data in order to bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-31438-4_6