Related papers: Tropical $k$-means clustering for phylogenetic tre…
Given a set of $k$-colored points in the plane, we consider the problem of finding $k$ trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For $k=1$,…
We revisit Pollard's classical result on consistency for $k$-means clustering in Euclidean space, with a focus on extensions in two directions: first, to problems where the data may come from interesting geometric settings (e.g., Riemannian…
We introduce the aggregated clustering problem, where one is given $T$ instances of a center-based clustering task over the same $n$ points, but under different metrics. The goal is to open $k$ centers to minimize an aggregate of the…
In this paper we generalize the $j$-invariant criterion for the semistable reduction type of an elliptic curve to superelliptic curves $X$ given by $y^{n}=f(x)$. We first define a set of tropical invariants for $f(x)$ using symmetrized…
We compare the phylogenetic tensors for various trees and networks for two, three and four taxa. If the probability spaces between one tree or network and another are not identical then there will be phylogenetic tensors that could have…
Let E be a plane in an algebraic torus over an algebraically closed field. Given a balanced 1-dimensional fan C in the tropicalization of E, i.e. in the Bergman fan of the corresponding matroid, we give a complete algorithmic answer to the…
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
We define transversal tropical triangles (affine and projective) and characterize them via six inequalities to be satisfied by the coordinates of the vertices. We prove that the vertices of a transversal tropical triangle are tropically…
This report provides an exploration of different distance measures that can be used with the $K$-means algorithm for cluster analysis. Specifically, we investigate the Mahalanobis distance, and critically assess any benefits it may have…
In this article we study the treewidth of the \emph{display graph}, an auxiliary graph structure obtained from the fusion of phylogenetic (i.e., evolutionary) trees at their leaves. Earlier work has shown that the treewidth of the display…
In phylogenetic networks, it is desirable to estimate edge lengths in substitutions per site or calendar time. Yet, there is a lack of scalable methods that provide such estimates. Here we consider the problem of obtaining edge length…
Clustering is a fundamental unsupervised learning approach. Many clustering algorithms -- such as $k$-means -- rely on the euclidean distance as a similarity measure, which is often not the most relevant metric for high dimensional data…
We prove that the number of tropical critical points of an affine matroid (M,e) is equal to the beta invariant of M. Motivated by the computation of maximum likelihood degrees, this number is defined to be the degree of the intersection of…
We present a new method for clustering based on compression. The method doesn't use subject-specific features or background knowledge, and works as follows: First, we determine a universal similarity distance, the normalized compression…
We study the tropicalization of intersections of plane curves, under the assumption that they have the same tropicalization. We show that the set of tropical divisors that arise in this manner is a pure dimensional balanced polyhedral…
An evolutionary tree (phylogenetic tree) is a binary, rooted, unordered tree that models the evolutionary history of currently living species in which leaves are labeled by species. In this paper, we investigate the problem of finding the…
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…
In this article, we propose tree edit distance with variables, which is an extension of the tree edit distance to handle trees with variables and has a potential application to measuring the similarity between mathematical formulas,…
Different distance measures have been used for efficiently predicting software faults at early stages of software development. One stereotyped approach for software fault prediction due to its computational efficiency is K-means clustering,…
We associate to an analytic subvariety of a torus a tropical variety. In the first part, we generalize the results from tropical algebraic geometry to this non-archimedean analytic situation. The periodic case is applied to a totally…