Sciweavers

105 search results - page 9 / 21
» Learning with Tree-Averaged Densities and Distributions
Sort
View
ICIP
2008
IEEE
14 years 2 months ago
Learning efficient codes for 3D face recognition
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
Cheng Zhong, Zhenan Sun, Tieniu Tan
ICANN
2007
Springer
14 years 2 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
ICPR
2004
IEEE
14 years 9 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
JMLR
2002
73views more  JMLR 2002»
13 years 7 months ago
Variational Learning of Clusters of Undercomplete Nonsymmetric Independent Components
We apply a variational method to automatically determine the number of mixtures of independent components in high-dimensional datasets, in which the sources may be nonsymmetricall...
Kwokleung Chan, Te-Won Lee, Terrence J. Sejnowski
ICPR
2002
IEEE
14 years 9 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto