Results 11  20
of
176,029
Clustering Pairwise Distances with Missing Data: Maximum Cuts versus Normalized Cuts?
"... Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clustering algorithms. In contrast, algorithms working with the pairwise distance matrix have been studied rarely for clust ..."
Abstract
 Add to MetaCart
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clustering algorithms. In contrast, algorithms working with the pairwise distance matrix have been studied rarely
On pairwise distances and median score of three genomes under DCJ
"... In comparative genomics, the rearrangement distance between two genomes (equal the minimal number of genome rearrangements required to transform them into a single genome) is often used for measuring their evolutionary remoteness. Generalization of this measure to three genomes is known as the media ..."
Abstract
 Add to MetaCart
, the most natural of which appears to be the halved sum of pairwise distances which in fact represents a lower bound for the median score. In this work, we study relationship and interplay of pairwise distances between three genomes and their median score under the model of DoubleCutandJoin (DCJ
Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
, 909
"... Abstract. In the context of clustering, we consider a generative model in a Euclidean ambient space with clusters of different shapes, dimensions, sizes and densities. In an asymptotic setting where the number of points becomes large, we obtain theoretical guaranties for a few emblematic methods bas ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
based on pairwise distances: a simple algorithm based on the extraction of connected components in a neighborhood graph; the spectral clustering method of Ng, Jordan and Weiss; and hierarchical clustering with single linkage. The methods are shown to enjoy some nearoptimal properties in terms
Effects of sparseness and randomness of pairwise distance matrix on tSNE results
"... Abstract. We apply ideas from random graph theory to sparse pairwise distance matrices in dimension reduction. We use matrices with some short and some randomly chosen distances, and study effects of matrix sparseness and randomness on trustworthiness and continuity of tSNE visualizations. The exis ..."
Abstract
 Add to MetaCart
Abstract. We apply ideas from random graph theory to sparse pairwise distance matrices in dimension reduction. We use matrices with some short and some randomly chosen distances, and study effects of matrix sparseness and randomness on trustworthiness and continuity of tSNE visualizations
Extending the Classical Multidimensional Scaling Algorithm Given Partial Pairwise Distance Measurements
"... Abstractâ€”We consider the problem of node localization given partial pairwise distance measurements. Current solutions first complete the missing distances and then apply the classical multidimensional scaling (MDS) algorithm. Instead, we extend the classical MDS to a setup where the sensor network i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstractâ€”We consider the problem of node localization given partial pairwise distance measurements. Current solutions first complete the missing distances and then apply the classical multidimensional scaling (MDS) algorithm. Instead, we extend the classical MDS to a setup where the sensor network
Clustering by Friends: A New Nonparametric Pairwise Distance Based Clustering Algorithm
, 2002
"... We present a novel pairwise clustering method. Given a proximity matrix of pairwise relations (i.e. pairwise similarity or dissimilarity estimates) between data points, our algorithm extracts the two most prominent clusters in the data set. The algorithm, which is completely nonparametric, iterative ..."
Abstract
 Add to MetaCart
, iteratively employs a twostep transformation on the proximity matrix. The rst step of the transformation represents each point by its relation to all other data points, and the second step reestimates the pairwise distances using a statistically motivated proximity measure on these representation. Hence
Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
"... Abstract. The phylogenetic Mean Pairwise Distance (MPD) is one of the most popular measures for computing the phylogenetic distance between a given group of species. More specifically, for a phylogenetic tree T and for a set of species R represented by a subset of the leaf nodes of T, the MPD of R ..."
Abstract
 Add to MetaCart
Abstract. The phylogenetic Mean Pairwise Distance (MPD) is one of the most popular measures for computing the phylogenetic distance between a given group of species. More specifically, for a phylogenetic tree T and for a set of species R represented by a subset of the leaf nodes of T, the MPD of R
A Pairwise Key PreDistribution Scheme for Wireless Sensor Networks
, 2003
"... this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resili ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smallerscale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain
Article PairwiseDistanceAnalysisDriven Dimensionality Reduction Model with Double Mappings for
"... remote sensing ..."
Point Sets Up to Rigid Transformations are Determined by the Distribution of their Pairwise Distances
, 2008
"... This report is a summary of [BK06], which gives a simpler, albeit less general proof for the result of [BK04]. 1 ..."
Abstract
 Add to MetaCart
This report is a summary of [BK06], which gives a simpler, albeit less general proof for the result of [BK04]. 1
Results 11  20
of
176,029