Sciweavers

704 search results - page 6 / 141
» Isometrically Embedded Graphs
Sort
View
SDM
2009
SIAM
152views Data Mining» more  SDM 2009»
14 years 4 months ago
Non-negative Matrix Factorization, Convexity and Isometry.
In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICMCS
2005
IEEE
79views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Supervised semi-definite embedding for image manifolds
Semi-definite Embedding (SDE) has been a recently proposed to maximize the sum of pair wise squared distances between outputs while the input data and outputs are locally isometri...
Benyu Zhang, Jun Yan, Ning Liu, QianSheng Cheng, Z...

Presentation
391views
15 years 6 months ago
Geometry of Graphs
Geometry of Graphs. Talk on celebrated LLR Paper, (November 2006)
Sujit Gujar
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
13 years 11 months ago
Minimum Depth Graph Embedding
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
Maurizio Pizzonia, Roberto Tamassia