Open AccessProceedings Article
A Deterministic Multidimensional Scaling Algorithm for Data Visualization
Anthony Don,Nicolas Hanusse +1 more
- 01 Jul 2006
pp 511-520
1
TL;DR: I-PACK as discussed by the authors is a deterministic layout algorithm for embedding a data set X in 2D provided that distances (delta <sub>uv </sub>,<sub>u,visinX</sub>, between data items are given or can be computed.
read more
Abstract: In this paper, we present I-PACK, a deterministic layout algorithm for embedding a data set X in 2D provided that distances (delta<sub>uv </sub>)<sub>u,visinX</sub>, between data items are given or can be computed. The layout reflects well similarities and dissimilarities between items and it is computed in quasi-linear time. Experimental comparisons with other multidimensional scaling algorithms show that: i) our algorithm has similar performance when the aspect ratio A = max<sub>u,v</sub>)(delta<sub>uv</sub>)/ min<sub>u,v</sub>)(delta<sub>uv</sub>) is small (i.e. log<sub>2</sub>A < 10) and ii) the larger the aspect ratio, the better I-PACK performs with respect to other MDS algorithms. This is also true when data can be "naturally" clustered
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Dissertation
Indexation et navigation dans les contenus visuels : approches basées sur les graphes
Anthony Don
- 01 Jan 2006
TL;DR: In this article, a methode interactive de detection de groupes de plans, partageant un contenu couleur similaire, base on the fragmentation de graphe, is proposed.
9
References
Graph drawing by force-directed placement
TL;DR: A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Cover trees for nearest neighbor
Alina Beygelzimer,Sham M. Kakade,John Langford +2 more
- 25 Jun 2006
TL;DR: A tree data structure for fast nearest neighbor operations in general n-point metric spaces (where the data set consists of n points) that shows speedups over the brute force search varying between one and several orders of magnitude on natural machine learning datasets.
Finding nearest neighbors in growth-restricted metrics
David R. Karger,Matthias Ruhl +1 more
- 19 May 2002
TL;DR: This paper develops an efficient dynamic data structure for nearest neighbor queries in growth-constrained metrics that satisfy the property that for any point q and number r the ratio between numbers of points in balls of radius 2r and r is bounded by a constant.
•Proceedings Article
A Fast Adaptive Layout Algorithm for Undirected Graphs
Arne Frick,Andreas Ludwig,Heiko Mehldau +2 more
- 10 Oct 1994
TL;DR: A randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the spring-embedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations.
328
A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)
Arne Frick,Andreas Ludwig,Heiko Mehldau +2 more
- 10 Oct 1994
TL;DR: In this article, a randomized adaptive layout algorithm based on the spring-embedder paradigm is presented for nicely drawing undirected graphs and several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations.
Related Papers (5)
Jim Everett
- 01 Jan 1995
James Robert Capra
- 01 Jun 1970
Douglas B. Clarkson,James E Gentle +1 more
- 01 Jun 1986