Sciweavers

744 search results - page 40 / 149
» Information-theoretic metric learning
Sort
View
ICIP
2008
IEEE
14 years 11 months ago
Complex discriminant features for object classification
A new algorithm for the design of complex features, to be used in the discriminant saliency approach to object classification, is presented. The algorithm consists of sequential r...
Sunhyoung Han, Nuno Vasconcelos
IJCNN
2006
IEEE
14 years 3 months ago
Correntropy: A Localized Similarity Measure
—The measure of similarity normally utilized in statistical signal processing is based on second order moments. In this paper, we reveal the probabilistic meaning of correntropy ...
Weifeng Liu, Puskal P. Pokharel, Jose C. Principe
IJCAI
2007
13 years 11 months ago
Improving Embeddings by Flexible Exploitation of Side Information
Dimensionality reduction is a much-studied task in machine learning in which high-dimensional data is mapped, possibly via a non-linear transformation, onto a low-dimensional mani...
Ali Ghodsi, Dana F. Wilkinson, Finnegan Southey
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 9 months ago
Metric entropy in competitive on-line prediction
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
Vladimir Vovk
ECSQARU
2001
Springer
14 years 2 months ago
An Empirical Investigation of the K2 Metric
Abstract. The K2 metric is a well-known evaluation measure (or scoring function) for learning Bayesian networks from data [7]. It is derived by assuming uniform prior distributions...
Christian Borgelt, Rudolf Kruse