Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
In this note, it is shown that by applying ranking procedures to data that allow, for any three objects a 1 , a 2 , b in a collection X of objects of interest, to make consistent decisions about which of the two objects a 1 or a 2 is more similar to b, a family of cluster systems A (k) (k = 0, 1, . . .) can be constructed that start with the associated Apresjan Hierarchy and keep growing until, for k = #X − 1, the full set P (X) of all subsets of X is reached. Various ideas regarding canonical modifications of the similarity values so that these cluster systems contain as many clusters as possible for small values of k (and in particular for k := 0) and/or are rooted at a specific element in X, possible applications, e.g. concerning (i) the comparison of distinct dissimilarity data defined on the same set X or (ii) diversity optimization, and new tasks arising in ranking statistics are also discussed.
In this note, it is shown that by applying ranking procedures to data that allow, for any three objects a 1 , a 2 , b in a collection X of objects of interest, to make consistent decisions about which of the two objects a 1 or a 2 is more similar to b, a family of cluster systems A (k) (k = 0, 1, . . .) can be constructed that start with the associated Apresjan Hierarchy and keep growing until, for k = #X − 1, the full set P (X) of all subsets of X is reached. Various ideas regarding canonical modifications of the similarity values so that these cluster systems contain as many clusters as possible for small values of k (and in particular for k := 0) and/or are rooted at a specific element in X, possible applications, e.g. concerning (i) the comparison of distinct dissimilarity data defined on the same set X or (ii) diversity optimization, and new tasks arising in ranking statistics are also discussed.
In 1970, Farris introduced a procedure that can be used to transform a tree metric into an ultra metric. Since its discovery, Farris' procedure has been used extensively within phylogenetics where it has become commonly known as the Farris transform. Remarkably, the Farris transform has not only been rediscovered several times within phylogenetics, but also in other fields. In this paper, we will review some of its various properties and uses.The paper is divided into four parts and, altogether, 12 sections. In the first part, we introduce a standardized scheme for classifying those dissimilarity mappings to which the Farris transform can be applied -a scheme that has evolved over the years, but has apparently not been spelled out before in sufficient detail. In the second part, we will discuss how a straightforward generalization of the Farris transform naturally arises in T-Theory. The third part describes how this generalized Farris transform can be used to approximate dissimilarities by tree metrics. And in the final part, we describe some further, "non-standard" applications of the Farris transform.
There is a natural way to associate to any tree T with leaf set X, and with edges weighted by elements from an abelian group G, a map from the power set of X into G -simply add the elements on the edges that connect the leaves in that subset. This map has been wellstudied in the case where G has no elements of order 2 (particularly when G is the additive group of real numbers) and, for this setting, subsets of leaves of size two play a crucial role. However, the existence and uniqueness results in that setting do not extend to arbitrary abelian groups. We study this more general problem here, and by working instead with both, pairs and triples of leaves, we obtain analogous existence and uniqueness results. Some particular results for elementary abelian 2-groups are also described.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.