Kai Labusch

Orcid: 0000-0002-7275-5483

According to our database1, Kai Labusch authored at least 23 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Document Layout Analysis with Deep Learning and Heuristics.
Proceedings of the 7th International Workshop on Historical Document Imaging and Processing, 2023

Gauging the Limitations of Natural Language Supervised Text-Image Metrics Learning by Iconclass Visual Concepts.
Proceedings of the 7th International Workshop on Historical Document Imaging and Processing, 2023

2022
Entity Linking in Multilingual Newspapers and Classical Commentaries with BERT.
Proceedings of the Working Notes of CLEF 2022 - Conference and Labs of the Evaluation Forum, Bologna, Italy, September 5th - to, 2022

2020

Named Entity Disambiguation and Linking Historic Newspaper OCR with BERT.
Proceedings of the Working Notes of CLEF 2020, 2020

2019
BERT for Named Entity Recognition in Contemporary and Historic German.
Proceedings of the 15th Conference on Natural Language Processing, 2019

2012
Soft-competitive learning of sparse data models.
PhD thesis, 2012

Sparse Coding and Selected Applications.
Künstliche Intell., 2012

2011
Robust and Fast Learning of Sparse Codes With Stochastic Gradient Descent.
IEEE J. Sel. Top. Signal Process., 2011

Soft-competitive learning of sparse codes and its application to image reconstruction.
Neurocomputing, 2011

2010
Sparse Coding for Feature Selection on Genome-Wide Association Data.
Proceedings of the Artificial Neural Networks - ICANN 2010, 2010

Learning sparse codes for image reconstruction.
Proceedings of the 18th European Symposium on Artificial Neural Networks, 2010

Bag of Pursuits and Neural Gas for Improved Sparse Coding.
Proceedings of the 19th International Conference on Computational Statistics, 2010

2009
SoftDoubleMaxMinOver: Perceptron-Like Training of Support Vector Machines.
IEEE Trans. Neural Networks, 2009

Sparse Coding Neural Gas: Learning of overcomplete data representations.
Neurocomputing, 2009

Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas.
Proceedings of the Advances in Self-Organizing Maps, 7th International Workshop, 2009

2008
Simple Method for High-Performance Digit Recognition Based on Sparse Coding.
IEEE Trans. Neural Networks, 2008

Sparse Coding Neural Gas for the Separation of Noisy Overcomplete Sources.
Proceedings of the Artificial Neural Networks, 2008

Learning Data Representations with Sparse Coding Neural Gas.
Proceedings of the 16th European Symposium on Artificial Neural Networks, 2008

Simple Incremental One-Class Support Vector Classification.
Proceedings of the Pattern Recognition, 2008

2007
Learning optimal features for visual pattern recognition.
Proceedings of the Human Vision and Electronic Imaging XII, San Jose, CA, USA, January 29, 2007

2006
MaxMinOver Regression: A Simple Incremental Approach for Support Vector Function Approximation.
Proceedings of the Artificial Neural Networks, 2006

2005
SoftDoubleMinOver: A Simple Procedure for Maximum Margin Classification.
Proceedings of the Artificial Neural Networks: Formal Models and Their Applications, 2005


  Loading...