Sciweavers

2183 search results - page 7 / 437
» On Combining Dissimilarity Representations
Sort
View
AB
2008
Springer
13 years 9 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
ICML
2010
IEEE
13 years 8 months ago
The Translation-invariant Wishart-Dirichlet Process for Clustering Distance Data
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
Julia E. Vogt, Sandhya Prabhakaran, Thomas J. Fuch...
CSDA
2006
67views more  CSDA 2006»
13 years 7 months ago
Sensitivity analysis of the strain criterion for multidimensional scaling
Multidimensional scaling (MDS) is a collection of data analytic techniques for constructing configurations of points from dissimilarity information about interpoint distances. Cla...
R. M. Lewis, M. W. Trosset
TSMC
1998
96views more  TSMC 1998»
13 years 6 months ago
The MDS-ANAVA technique for assessing knowledge representation differences between skill groups
—Knowledge representation is one of important factors that determine human performance on cognitive tasks. Due to different levels of experience, different groups of people may d...
Nong Ye
CVPR
2006
IEEE
14 years 9 months ago
Shape Topics: A Compact Representation and New Algorithms for 3D Partial Shape Retrieval
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
Yi Liu, Hongbin Zha, Hong Qin