Sciweavers

240 search results - page 41 / 48
» Laplacian Spectrum Learning
Sort
View
IJON
2010
178views more  IJON 2010»
13 years 7 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
IJON
2010
121views more  IJON 2010»
13 years 6 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
PAMI
2012
11 years 11 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
SCIA
2007
Springer
182views Image Analysis» more  SCIA 2007»
14 years 2 months ago
The Statistical Properties of Local Log-Contrast in Natural Images
Abstract. The study of natural image statistics considers the statistical properties of large collections of images from natural scenes, and has applications in image processing, c...
Jussi T. Lindgren, Jarmo Hurri, Aapo Hyvärine...
ICML
2007
IEEE
14 years 9 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos