Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kaare Brandt Petersen

dblp:68/4463 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Representation and self-supervised learning · 33%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
feature extraction
0.112006
Sparse Kernel Orthonormalized PLS for feature extraction in large data sets · NIPS 2006
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent factor model
partial least squares
0.112006
Sparse Kernel Orthonormalized PLS for feature extraction in large data sets · NIPS 2006
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › least squares regression
regularized least squares regression
0.112006
Sparse Kernel Orthonormalized PLS for feature extraction in large data sets · NIPS 2006

Methods — techniques the papers use, named apart from their topics

sparsity regularization · 0.1kernel methods · 0.1
YearPublicationVenuePosition
2019 Machine Learning for Condition Monitoring and Innovation
abstract
This paper is a tribute to the late Professor Jan Larsen's work on machine learning for condition monitoring of large diesel engines. We present the ultrasound signals used to monitor the condition of the large engines and revisit two methods for estimating the condition of the engines from the ultrasound signals. Finally, we touch upon the increased importance of condition monitoring in large diesel engine industry today.
Niels Henrik Pontoppidan, Tue Lehn-Schiøler, Kaare Brandt Petersen
ICASSP3
2007 Flexible and efficient implementations of Bayesian independent component analysis
Ole Winther, Kaare Brandt Petersen
Neurocomputing2
2007 State-Space Models: From the EM Algorithm to a Gradient Approach
abstract
Slow convergence is observed in the EM algorithm for linear state-space models. We propose to circumvent the problem by applying any off-the-shelf quasi-Newton-type optimizer, which operates on the gradient of the log-likelihood function. Such an algorithm is a practical alternative due to the fact that the exact gradient of the log-likelihood function can be computed by recycling components of the expectation-maximization (EM) algorithm. We demonstrate the efficiency of the proposed method in three relevant instances of the linear state-space model. In high signal-to-noise ratios, where EM is particularly prone to converge slowly, we show that gradient-based learning results in a sizable reduction of computation time.
Rasmus Kongsgaard Olsson, Kaare Brandt Petersen, Tue Lehn-Schiøler
Neural Comput.2
2006 Sparse Kernel Orthonormalized PLS for feature extraction in large data sets
abstract
In this paper we are presenting a novel multivariate analysis method. Our scheme is based on a novel kernel orthonormalized partial least squares (PLS) variant for feature extraction, imposing sparsity constrains in the solution to improve scalability. The algorithm is tested on a benchmark of UCI data sets, and on the analysis of integrated short-time music features for genre prediction. The upshot is that the method has strong expressive power even with rather few features, is clearly outperforming the ordinary kernel PLS, and therefore is an appealing method for feature extraction of labelled data.
Jerónimo Arenas-García, Kaare Brandt Petersen, Lars Kai Hansen
NIPS2
2005 The EM algorithm in independent component analysis
abstract
We investigate two techniques for independent component analysis which use the expectation-maximization algorithm. Analysis and simulations show that convergence becomes extraordinarily slow for almost all cases, compared to other optimization techniques. The two alternatives considered are "adaptive overrelaxed EM" and Ucminf (a BFGS with soft line search), which both improves the convergence dramatically with little or no extra analytical work. We discuss the generality and perspectives of the findings.
Kaare Brandt Petersen, Ole Winther
ICASSP (5)1
2005 On the Slow Convergence of EM and VBEM in Low-Noise Linear Models
abstract
We analyze convergence of the expectation maximization (EM) and variational Bayes EM (VBEM) schemes for parameter estimation in noisy linear models. The analysis shows that both schemes are inefficient in the low-noise limit. The linear model with additive noise includes as special cases independent component analysis, probabilistic principal component analysis, factor analysis, and Kalman filtering. Hence, the results are relevant for many practical applications.
Kaare Brandt Petersen, Ole Winther, Lars Kai Hansen
Neural Comput.1