Kerstin Bunte

Dr. Kerstin Bunte


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2012 in Neural Computation
Verified
Journal Article
Closed access
KBKerstin Bunte
Kerstin Bunte
MBMichael Biehl
Michael Biehl
BHBarbara Hammer
Barbara Hammer
In recent years, a wealth of dimension-reduction techniques for data visualization and preprocessing has been established. Nonparametric methods require additional effort for out-of-sample extensions, because they provide only a mapping of a given finite set of points. In this letter, we propose a general view on nonparametric dimension reduction based on the concept of cost functions and properties of the data. Based on this general principle, we transfer nonparametric dimension reduction to explicit mappings of the data manifold such that direct out-of-sample extensions become possible. Furthermore, this concept offers the possibility of investigating the generalization ability of data visualization to new data points. We demonstrate the approach based on a simple global linear mapping, as well as prototype-based local linear mappings. In addition, we can bias the functional form according to given auxiliary information. This leads to explicit supervised visualization mappings with discriminative properties comparable to state-of-the-art approaches.

1 February 2012 in Neural Networks
Verified
Journal Article
Closed access
KBKerstin Bunte
Kerstin Bunte
PSPetra Schneider
Petra Schneider
BHBarbara Hammer
Barbara Hammer
FSFrank-Michael Schleif
Frank-Michael Schleif
TVThomas Villmann
Thomas Villmann
MBMichael Biehl
Michael Biehl

1 August 2012 in Neurocomputing
Verified
Journal Article
Closed access
KBKerstin Bunte
Kerstin Bunte
SHSven Haase
Sven Haase
MBMichael Biehl
Michael Biehl
TVThomas Villmann
Thomas Villmann

23 August 2016 in Nature Communications
Verified
Journal Article
Open access
PDF file
SSSolveig K. Sieberts
Solveig K. Sieberts
FZFan Zhu
Fan Zhu
JGJavier García-García
Javier García-García
ESEli Stahl
Eli Stahl
APAbhishek Pratap
Abhishek Pratap
LMLara M. Mangravite
Lara M. Mangravite
Rheumatoid arthritis (RA) affects millions world-wide. While anti-TNF treatment is widely used to reduce disease progression, treatment fails in ∼one-third of patients. No biomarker currently exists that identifies non-responders before treatment. A rigorous community-based assessment of the utility of SNP data for predicting anti-TNF treatment efficacy in RA patients was performed in the context of a DREAM Challenge (http://www.synapse.org/RA_Challenge). An open challenge framework enabled the comparative evaluation of predictions developed by 73 research groups using the most comprehensive available data and covering a wide range of state-of-the-art modelling methodologies. Despite a significant genetic heritability estimate of treatment non-response trait (h2=0.18, P value=0.02), no significant genetic contribution to prediction accuracy is observed. Results formally confirm the expectations of the rheumatology community that SNP information does not significantly improve predictive performance relative to standard clinical traits, thereby justifying a refocusing of future efforts on collection of other data.

15 March 2010 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
PSPetra Schneider
Petra Schneider
KBKerstin Bunte
Kerstin Bunte
HSHan Stiekema
Han Stiekema
BHBarbara Hammer
Barbara Hammer
TVThomas Villmann
Thomas Villmann
MBMichael Biehl
Michael Biehl
In this paper, we present a regularization technique to extend recently proposed matrix learning schemes in learning vector quantization (LVQ). These learning algorithms extend the concept of adaptive distance measures in LVQ to the use of relevance matrices. In general, metric learning can display a tendency towards oversimplification in the course of training. An overly pronounced elimination of dimensions in feature space can have negative effects on the performance and may lead to instabilities in the training. We focus on matrix learning in generalized LVQ (GLVQ). Extending the cost function by an appropriate regularization term prevents the unfavorable behavior and can help to improve the generalization ability. The approach is first tested and illustrated in terms of artificial model data. Furthermore, we apply the scheme to benchmark classification data sets from the UCI Repository of Machine Learning. We demonstrate the usefulness of regularization also in the case of rank limited relevance matrices, i.e., matrix learning with an implicit, low-dimensional representation of the data.

19 February 2011 in Neurocomputing
Verified
Journal Article
Closed access
KBKerstin Bunte
Kerstin Bunte
BHBarbara Hammer
Barbara Hammer
TVThomas Villmann
Thomas Villmann
MBMichael Biehl
Michael Biehl
AWAxel Wismüller
Axel Wismüller