Sciweavers

511 search results - page 43 / 103
» The intrinsic dimensionality of graphs
Sort
View
TIP
2010
154views more  TIP 2010»
14 years 10 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
CVPR
2007
IEEE
16 years 1 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 6 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...
CLEF
2010
Springer
15 years 1 months ago
Using Web Graph Structure for Person Name Disambiguation
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
Elena Smirnova, Konstantin Avrachenkov, Brigitte T...
LPAR
2007
Springer
15 years 6 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli