Sciweavers

2512 search results - page 153 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
PR
2010
186views more  PR 2010»
14 years 8 months ago
Feature extraction by learning Lorentzian metric tensor and its extensions
We develop a supervised dimensionality reduction method, called Lorentzian Discriminant Projection (LDP), for feature extraction and classification. Our method represents the str...
Risheng Liu, Zhouchen Lin, Zhixun Su, Kewei Tang
101
Voted
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
14 years 11 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha
ICASSP
2010
IEEE
14 years 10 months ago
Structuring a gene network using a multiresolution independence test
In order to structure a gene network, a score-based approach is often used. A score-based approach, however, is problematic because by assuming a probability distribution, one is ...
Takayuki Yamamoto, Tetsuya Takiguchi, Yasuo Ariki
AMC
2006
79views more  AMC 2006»
14 years 10 months ago
VC-dimension and structural risk minimization for the analysis of nonlinear ecological models
The problem of distinguishing density-independent (DI) from density-dependent (DD) demographic time series is important for understanding the mechanisms that regulate populations ...
Giorgio Corani, Marino Gatto
EUROPAR
2003
Springer
15 years 3 months ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström