253 search results - page 9 / 51 » Principal Graphs and Manifolds |
DM
2006
14 years 11 months ago
2006
The recursive computation of the interlace polynomial introduced by Arratia, Bollob
97
Voted
ECML
2004
Springer
15 years 4 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
NIPS
2000
15 years 14 days ago
2000
A central issue in principal component analysis (PCA) is choosing the number of principal components to be retained. By interpreting PCA as density estimation, this paper shows ho...
102
Voted
BMVC
2010
14 years 9 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
ICPR
2006
IEEE
16 years 6 days ago
2006
IEEE
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...